YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:26:39,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:26:39,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:26:39,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:26:39,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:26:39,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:26:39,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:26:39,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:26:39,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:26:39,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:26:39,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:26:39,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:26:39,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:26:39,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:26:39,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:26:39,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:26:39,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:26:39,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:26:39,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:26:39,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:26:39,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:26:39,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:26:39,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:26:39,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:26:39,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:26:39,054 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:26:39,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:26:39,055 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:26:39,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:26:39,056 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:26:39,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:26:39,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:26:39,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:26:39,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:26:39,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:26:39,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:26:39,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:26:39,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:26:39,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:26:39,062 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:26:39,077 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:26:39,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:26:39,078 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:26:39,078 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:26:39,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:26:39,079 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:26:39,079 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:26:39,079 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:26:39,079 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:26:39,079 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:26:39,079 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:26:39,080 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:26:39,080 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:26:39,080 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:26:39,080 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:26:39,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:26:39,080 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:26:39,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:26:39,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:26:39,081 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:26:39,081 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:26:39,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:26:39,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:26:39,082 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:26:39,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:26:39,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:26:39,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:26:39,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:26:39,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:26:39,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:26:39,121 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:26:39,124 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:26:39,126 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:26:39,126 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:26:39,127 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:26:39,196 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/57906b3a79f546f780f5deecffd631c6/FLAG7df65120b !SESSION 2020-06-22 10:26:36.720 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 10:26:39.458 !MESSAGE Indexed 'FLAG7df65120b' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 10:26:39,563 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:26:39,564 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:26:39,564 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:26:39,572 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/57906b3a79f546f780f5deecffd631c6/FLAG7df65120b [2020-06-22 10:26:39,985 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/57906b3a79f546f780f5deecffd631c6 [2020-06-22 10:26:39,997 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:26:39,998 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:26:39,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:26:39,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:26:40,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:26:40,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:26:39" (1/1) ... [2020-06-22 10:26:40,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8dd905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40, skipping insertion in model container [2020-06-22 10:26:40,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:26:39" (1/1) ... [2020-06-22 10:26:40,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:26:40,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:26:40,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:26:40,297 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:26:40,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:26:40,333 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:26:40,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40 WrapperNode [2020-06-22 10:26:40,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:26:40,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:26:40,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:26:40,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:26:40,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:26:40,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:26:40,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:26:40,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:26:40,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:26:40,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:26:40,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:26:40,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:26:40,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:26:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:26:40,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:26:40,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:26:40,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:26:40,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:26:40,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:26:40,750 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:26:40,750 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:26:40,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:40 BoogieIcfgContainer [2020-06-22 10:26:40,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:26:40,752 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:26:40,753 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:26:40,755 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:26:40,756 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:40" (1/1) ... [2020-06-22 10:26:40,776 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 47 edges [2020-06-22 10:26:40,778 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:26:40,779 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:26:40,779 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:26:40,780 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:26:40,781 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:26:40,782 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:26:40,782 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:26:40,809 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:26:40,843 INFO L200 BlockEncoder]: SBE split 19 edges [2020-06-22 10:26:40,848 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:26:40,850 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:26:40,878 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:26:40,881 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 10:26:40,882 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:26:40,883 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:26:40,889 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 10:26:40,890 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:26:40,890 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:26:40,891 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:26:40,891 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:26:40,892 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:26:40,892 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 64 edges [2020-06-22 10:26:40,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:26:40 BasicIcfg [2020-06-22 10:26:40,893 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:26:40,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:26:40,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:26:40,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:26:40,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:26:39" (1/4) ... [2020-06-22 10:26:40,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b95a607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:26:40, skipping insertion in model container [2020-06-22 10:26:40,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (2/4) ... [2020-06-22 10:26:40,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b95a607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:26:40, skipping insertion in model container [2020-06-22 10:26:40,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:40" (3/4) ... [2020-06-22 10:26:40,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b95a607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:26:40, skipping insertion in model container [2020-06-22 10:26:40,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:26:40" (4/4) ... [2020-06-22 10:26:40,901 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:26:40,911 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:26:40,919 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 10:26:40,936 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 10:26:40,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:26:40,965 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:26:40,965 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:26:40,966 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:26:40,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:26:40,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:26:40,966 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:26:40,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:26:40,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:26:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-06-22 10:26:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:26:40,987 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:40,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:26:40,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash 218260429, now seen corresponding path program 1 times [2020-06-22 10:26:40,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:40,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:41,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:41,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:41,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:41,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:41,197 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-06-22 10:26:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:41,368 INFO L93 Difference]: Finished difference Result 50 states and 109 transitions. [2020-06-22 10:26:41,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:41,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:26:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:41,383 INFO L225 Difference]: With dead ends: 50 [2020-06-22 10:26:41,383 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:26:41,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:26:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:26:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:26:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2020-06-22 10:26:41,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 5 [2020-06-22 10:26:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:41,427 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2020-06-22 10:26:41,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2020-06-22 10:26:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:26:41,427 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:41,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:26:41,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:41,428 INFO L82 PathProgramCache]: Analyzing trace with hash 218260431, now seen corresponding path program 1 times [2020-06-22 10:26:41,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:41,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:41,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:41,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:41,475 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 4 states. [2020-06-22 10:26:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:41,559 INFO L93 Difference]: Finished difference Result 30 states and 60 transitions. [2020-06-22 10:26:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:41,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:26:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:41,561 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:26:41,561 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:26:41,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:26:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:26:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:26:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 59 transitions. [2020-06-22 10:26:41,567 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 59 transitions. Word has length 5 [2020-06-22 10:26:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:41,568 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 59 transitions. [2020-06-22 10:26:41,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 59 transitions. [2020-06-22 10:26:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:26:41,569 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:41,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:26:41,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:41,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash 218260432, now seen corresponding path program 1 times [2020-06-22 10:26:41,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:41,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:41,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:41,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:41,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:41,610 INFO L87 Difference]: Start difference. First operand 29 states and 59 transitions. Second operand 3 states. [2020-06-22 10:26:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:41,737 INFO L93 Difference]: Finished difference Result 29 states and 59 transitions. [2020-06-22 10:26:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:41,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:26:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:41,738 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:26:41,738 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:26:41,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:26:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:26:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:26:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2020-06-22 10:26:41,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 5 [2020-06-22 10:26:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:41,744 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2020-06-22 10:26:41,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2020-06-22 10:26:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:26:41,745 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:41,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:26:41,745 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1823862590, now seen corresponding path program 1 times [2020-06-22 10:26:41,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:41,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:41,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:41,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:41,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:41,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:41,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:41,782 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 3 states. [2020-06-22 10:26:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:41,885 INFO L93 Difference]: Finished difference Result 28 states and 58 transitions. [2020-06-22 10:26:41,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:41,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:26:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:41,886 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:26:41,887 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:26:41,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:26:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:26:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:26:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2020-06-22 10:26:41,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 6 [2020-06-22 10:26:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:41,892 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2020-06-22 10:26:41,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2020-06-22 10:26:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:26:41,892 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:41,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:26:41,893 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1823862589, now seen corresponding path program 1 times [2020-06-22 10:26:41,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:41,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:41,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:41,929 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 4 states. [2020-06-22 10:26:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:42,015 INFO L93 Difference]: Finished difference Result 28 states and 56 transitions. [2020-06-22 10:26:42,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:42,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:26:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:42,017 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:26:42,017 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:26:42,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:26:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:26:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:26:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2020-06-22 10:26:42,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 55 transitions. Word has length 6 [2020-06-22 10:26:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:42,022 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 55 transitions. [2020-06-22 10:26:42,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 55 transitions. [2020-06-22 10:26:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:26:42,023 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:42,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:26:42,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1823862588, now seen corresponding path program 1 times [2020-06-22 10:26:42,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:42,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:42,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:42,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:26:42,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:42,065 INFO L87 Difference]: Start difference. First operand 27 states and 55 transitions. Second operand 3 states. [2020-06-22 10:26:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:42,161 INFO L93 Difference]: Finished difference Result 27 states and 55 transitions. [2020-06-22 10:26:42,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:42,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:26:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:42,162 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:26:42,162 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:26:42,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:26:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:26:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:26:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2020-06-22 10:26:42,167 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 6 [2020-06-22 10:26:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:42,168 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2020-06-22 10:26:42,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2020-06-22 10:26:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:42,168 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:42,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:42,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:42,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -705163977, now seen corresponding path program 1 times [2020-06-22 10:26:42,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:42,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:42,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:42,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:42,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:26:42,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:26:42,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:26:42,206 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 4 states. [2020-06-22 10:26:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:42,296 INFO L93 Difference]: Finished difference Result 26 states and 54 transitions. [2020-06-22 10:26:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:26:42,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:26:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:42,297 INFO L225 Difference]: With dead ends: 26 [2020-06-22 10:26:42,297 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:26:42,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:26:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:26:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:26:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:26:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2020-06-22 10:26:42,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 7 [2020-06-22 10:26:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:42,302 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2020-06-22 10:26:42,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:26:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2020-06-22 10:26:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:26:42,303 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:42,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:42,303 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash -705163975, now seen corresponding path program 1 times [2020-06-22 10:26:42,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:42,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:42,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:42,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:26:42,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:26:42,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:26:42,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:26:42,370 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 6 states. [2020-06-22 10:26:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:42,527 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2020-06-22 10:26:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:26:42,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 10:26:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:42,529 INFO L225 Difference]: With dead ends: 42 [2020-06-22 10:26:42,529 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:26:42,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:26:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:26:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2020-06-22 10:26:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:26:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2020-06-22 10:26:42,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 54 transitions. Word has length 7 [2020-06-22 10:26:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:42,535 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 54 transitions. [2020-06-22 10:26:42,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:26:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 54 transitions. [2020-06-22 10:26:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:26:42,536 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:42,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:42,536 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash -856108097, now seen corresponding path program 1 times [2020-06-22 10:26:42,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:42,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:42,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:42,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:26:42,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:26:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:26:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:26:42,575 INFO L87 Difference]: Start difference. First operand 27 states and 54 transitions. Second operand 5 states. [2020-06-22 10:26:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:42,685 INFO L93 Difference]: Finished difference Result 46 states and 90 transitions. [2020-06-22 10:26:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:26:42,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 10:26:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:42,686 INFO L225 Difference]: With dead ends: 46 [2020-06-22 10:26:42,687 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 10:26:42,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:26:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 10:26:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2020-06-22 10:26:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:26:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2020-06-22 10:26:42,693 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 82 transitions. Word has length 10 [2020-06-22 10:26:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:42,693 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 82 transitions. [2020-06-22 10:26:42,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:26:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 82 transitions. [2020-06-22 10:26:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:26:42,694 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:42,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:42,694 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash -856108100, now seen corresponding path program 1 times [2020-06-22 10:26:42,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:42,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:42,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:42,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:26:42,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:26:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:26:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:26:42,753 INFO L87 Difference]: Start difference. First operand 34 states and 82 transitions. Second operand 5 states. [2020-06-22 10:26:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:42,864 INFO L93 Difference]: Finished difference Result 34 states and 82 transitions. [2020-06-22 10:26:42,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:26:42,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 10:26:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:42,865 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:26:42,865 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:26:42,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:26:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:26:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:26:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:26:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2020-06-22 10:26:42,871 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 70 transitions. Word has length 10 [2020-06-22 10:26:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:42,871 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 70 transitions. [2020-06-22 10:26:42,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:26:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 70 transitions. [2020-06-22 10:26:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:26:42,872 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:42,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:42,872 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -856108098, now seen corresponding path program 1 times [2020-06-22 10:26:42,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:42,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:42,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:42,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:26:42,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:26:42,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:26:42,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:26:42,959 INFO L87 Difference]: Start difference. First operand 31 states and 70 transitions. Second operand 6 states. [2020-06-22 10:26:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:43,095 INFO L93 Difference]: Finished difference Result 37 states and 75 transitions. [2020-06-22 10:26:43,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:26:43,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 10:26:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:43,096 INFO L225 Difference]: With dead ends: 37 [2020-06-22 10:26:43,096 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 10:26:43,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:26:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 10:26:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-06-22 10:26:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:26:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 67 transitions. [2020-06-22 10:26:43,102 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 67 transitions. Word has length 10 [2020-06-22 10:26:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:43,102 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 67 transitions. [2020-06-22 10:26:43,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:26:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 67 transitions. [2020-06-22 10:26:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:26:43,103 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:43,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:43,103 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 889158909, now seen corresponding path program 1 times [2020-06-22 10:26:43,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:43,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:43,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:43,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:43,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:43,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:43,136 INFO L87 Difference]: Start difference. First operand 31 states and 67 transitions. Second operand 3 states. [2020-06-22 10:26:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:43,206 INFO L93 Difference]: Finished difference Result 57 states and 127 transitions. [2020-06-22 10:26:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:43,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-06-22 10:26:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:43,207 INFO L225 Difference]: With dead ends: 57 [2020-06-22 10:26:43,207 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 10:26:43,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 10:26:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-06-22 10:26:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:26:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2020-06-22 10:26:43,212 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 14 [2020-06-22 10:26:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:43,212 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2020-06-22 10:26:43,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2020-06-22 10:26:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:26:43,213 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:43,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:43,213 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash 889218491, now seen corresponding path program 1 times [2020-06-22 10:26:43,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:43,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:26:43,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:26:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:26:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:43,238 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 3 states. [2020-06-22 10:26:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:43,299 INFO L93 Difference]: Finished difference Result 59 states and 125 transitions. [2020-06-22 10:26:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:26:43,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-06-22 10:26:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:43,300 INFO L225 Difference]: With dead ends: 59 [2020-06-22 10:26:43,300 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 10:26:43,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:26:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 10:26:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 10:26:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:26:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2020-06-22 10:26:43,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 14 [2020-06-22 10:26:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:43,305 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 66 transitions. [2020-06-22 10:26:43,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:26:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 66 transitions. [2020-06-22 10:26:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 10:26:43,306 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:43,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:43,306 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1795969641, now seen corresponding path program 1 times [2020-06-22 10:26:43,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:43,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:43,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:43,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:43,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:26:43,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:26:43,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:26:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:26:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:26:43,373 INFO L87 Difference]: Start difference. First operand 34 states and 66 transitions. Second operand 7 states. [2020-06-22 10:26:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:43,545 INFO L93 Difference]: Finished difference Result 64 states and 123 transitions. [2020-06-22 10:26:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:26:43,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-06-22 10:26:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:43,546 INFO L225 Difference]: With dead ends: 64 [2020-06-22 10:26:43,546 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 10:26:43,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:26:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 10:26:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-06-22 10:26:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:26:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2020-06-22 10:26:43,551 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 15 [2020-06-22 10:26:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:43,551 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. [2020-06-22 10:26:43,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:26:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. [2020-06-22 10:26:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 10:26:43,552 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:43,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:43,552 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:43,552 INFO L82 PathProgramCache]: Analyzing trace with hash -218308789, now seen corresponding path program 1 times [2020-06-22 10:26:43,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:43,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:43,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:43,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:26:43,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:26:43,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:43,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:26:43,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:43,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:26:43,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-06-22 10:26:43,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:26:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:26:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:26:43,710 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 7 states. [2020-06-22 10:26:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:43,861 INFO L93 Difference]: Finished difference Result 42 states and 73 transitions. [2020-06-22 10:26:43,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:26:43,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-06-22 10:26:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:43,862 INFO L225 Difference]: With dead ends: 42 [2020-06-22 10:26:43,862 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 10:26:43,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:26:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 10:26:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-06-22 10:26:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:26:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 63 transitions. [2020-06-22 10:26:43,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 63 transitions. Word has length 16 [2020-06-22 10:26:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:43,868 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 63 transitions. [2020-06-22 10:26:43,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:26:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 63 transitions. [2020-06-22 10:26:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 10:26:43,868 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:43,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:43,869 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash -218308790, now seen corresponding path program 1 times [2020-06-22 10:26:43,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:43,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:44,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:26:44,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:26:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:44,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 10:26:44,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:44,158 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:26:44,158 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:44,169 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:44,171 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:44,171 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 10:26:44,249 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:44,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 10:26:44,253 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:26:44,267 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:44,272 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:26:44,272 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 10:26:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:26:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2020-06-22 10:26:44,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 10:26:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 10:26:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:26:44,361 INFO L87 Difference]: Start difference. First operand 35 states and 63 transitions. Second operand 15 states. [2020-06-22 10:26:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:46,926 INFO L93 Difference]: Finished difference Result 63 states and 114 transitions. [2020-06-22 10:26:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-06-22 10:26:46,926 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2020-06-22 10:26:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:46,927 INFO L225 Difference]: With dead ends: 63 [2020-06-22 10:26:46,927 INFO L226 Difference]: Without dead ends: 57 [2020-06-22 10:26:46,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-06-22 10:26:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-06-22 10:26:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2020-06-22 10:26:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:26:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-06-22 10:26:46,934 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 16 [2020-06-22 10:26:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:46,934 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-06-22 10:26:46,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 10:26:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-06-22 10:26:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 10:26:46,935 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:46,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:46,935 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1822332538, now seen corresponding path program 1 times [2020-06-22 10:26:46,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:46,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:47,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:26:47,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:26:47,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:47,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 10:26:47,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:47,173 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:26:47,173 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:47,176 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:47,177 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:26:47,177 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-06-22 10:26:47,195 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:26:47,195 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:47,202 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:47,203 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:47,203 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-06-22 10:26:47,232 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:26:47,233 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:47,243 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:47,245 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:47,245 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 [2020-06-22 10:26:47,285 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:47,286 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-06-22 10:26:47,287 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:26:47,299 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:47,302 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:26:47,302 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:27 [2020-06-22 10:26:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:47,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:26:47,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-06-22 10:26:47,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 10:26:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 10:26:47,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:26:47,386 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 15 states. [2020-06-22 10:26:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:48,529 INFO L93 Difference]: Finished difference Result 67 states and 129 transitions. [2020-06-22 10:26:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 10:26:48,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-06-22 10:26:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:48,530 INFO L225 Difference]: With dead ends: 67 [2020-06-22 10:26:48,530 INFO L226 Difference]: Without dead ends: 65 [2020-06-22 10:26:48,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2020-06-22 10:26:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-06-22 10:26:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2020-06-22 10:26:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 10:26:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 92 transitions. [2020-06-22 10:26:48,541 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 92 transitions. Word has length 17 [2020-06-22 10:26:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:48,541 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 92 transitions. [2020-06-22 10:26:48,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 10:26:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 92 transitions. [2020-06-22 10:26:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 10:26:48,542 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:48,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:48,542 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1822332539, now seen corresponding path program 1 times [2020-06-22 10:26:48,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:48,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:48,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:48,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:48,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:48,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:26:48,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:26:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:48,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:26:48,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:48,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:26:48,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 10:26:48,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:26:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:26:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:26:48,654 INFO L87 Difference]: Start difference. First operand 46 states and 92 transitions. Second operand 6 states. [2020-06-22 10:26:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:48,815 INFO L93 Difference]: Finished difference Result 48 states and 92 transitions. [2020-06-22 10:26:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:26:48,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-06-22 10:26:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:48,816 INFO L225 Difference]: With dead ends: 48 [2020-06-22 10:26:48,816 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 10:26:48,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:26:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 10:26:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-06-22 10:26:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 10:26:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 89 transitions. [2020-06-22 10:26:48,825 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 89 transitions. Word has length 17 [2020-06-22 10:26:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:48,825 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 89 transitions. [2020-06-22 10:26:48,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:26:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 89 transitions. [2020-06-22 10:26:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 10:26:48,826 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:48,826 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:48,827 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1484067286, now seen corresponding path program 2 times [2020-06-22 10:26:48,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:48,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:48,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:26:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:49,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:26:49,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:26:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:26:49,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:26:49,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:26:49,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 10:26:49,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:49,168 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:49,169 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 10:26:49,169 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:49,184 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 10:26:49,185 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:26:49,185 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 10:26:49,203 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:26:49,203 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:49,209 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:49,210 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:49,210 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 10:26:49,273 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:49,274 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 10:26:49,275 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:26:49,285 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:49,286 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:26:49,287 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 10:26:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 10:26:49,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:26:49,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-06-22 10:26:49,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-06-22 10:26:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 10:26:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-06-22 10:26:49,373 INFO L87 Difference]: Start difference. First operand 45 states and 89 transitions. Second operand 14 states. [2020-06-22 10:26:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:26:50,333 INFO L93 Difference]: Finished difference Result 80 states and 145 transitions. [2020-06-22 10:26:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 10:26:50,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-06-22 10:26:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:26:50,334 INFO L225 Difference]: With dead ends: 80 [2020-06-22 10:26:50,334 INFO L226 Difference]: Without dead ends: 79 [2020-06-22 10:26:50,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=573, Unknown=0, NotChecked=0, Total=812 [2020-06-22 10:26:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-06-22 10:26:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2020-06-22 10:26:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 10:26:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 119 transitions. [2020-06-22 10:26:50,345 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 119 transitions. Word has length 22 [2020-06-22 10:26:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:26:50,345 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 119 transitions. [2020-06-22 10:26:50,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-06-22 10:26:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 119 transitions. [2020-06-22 10:26:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-06-22 10:26:50,346 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:26:50,346 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:26:50,346 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:26:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:26:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1652604293, now seen corresponding path program 2 times [2020-06-22 10:26:50,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:26:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:26:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:50,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:26:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:26:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:50,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:26:50,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:26:50,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:26:50,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:26:50,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:26:50,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 63 conjunts are in the unsatisfiable core [2020-06-22 10:26:50,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:50,776 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:26:50,777 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:50,783 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:50,784 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:26:50,784 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:26:50,823 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:26:50,824 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:50,835 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:50,836 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:50,836 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-06-22 10:26:50,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-06-22 10:26:50,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:50,889 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:50,890 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:50,891 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-06-22 10:26:51,350 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:51,350 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 56 [2020-06-22 10:26:51,355 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:51,373 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:51,377 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:26:51,377 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:76, output treesize:20 [2020-06-22 10:26:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:26:51,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:26:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2020-06-22 10:26:51,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-06-22 10:26:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-06-22 10:26:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2020-06-22 10:26:51,432 INFO L87 Difference]: Start difference. First operand 57 states and 119 transitions. Second operand 21 states. [2020-06-22 10:26:52,024 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2020-06-22 10:26:52,342 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2020-06-22 10:26:52,486 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2020-06-22 10:26:52,782 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2020-06-22 10:26:56,177 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2020-06-22 10:26:57,941 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2020-06-22 10:26:59,393 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2020-06-22 10:26:59,884 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2020-06-22 10:27:04,181 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2020-06-22 10:27:05,514 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2020-06-22 10:27:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:07,067 INFO L93 Difference]: Finished difference Result 184 states and 377 transitions. [2020-06-22 10:27:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-06-22 10:27:07,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2020-06-22 10:27:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:07,069 INFO L225 Difference]: With dead ends: 184 [2020-06-22 10:27:07,069 INFO L226 Difference]: Without dead ends: 183 [2020-06-22 10:27:07,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=482, Invalid=1679, Unknown=1, NotChecked=0, Total=2162 [2020-06-22 10:27:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-06-22 10:27:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 111. [2020-06-22 10:27:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-06-22 10:27:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 233 transitions. [2020-06-22 10:27:07,091 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 233 transitions. Word has length 27 [2020-06-22 10:27:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:07,091 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 233 transitions. [2020-06-22 10:27:07,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-06-22 10:27:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 233 transitions. [2020-06-22 10:27:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-06-22 10:27:07,092 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:07,092 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:07,093 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:27:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1452789981, now seen corresponding path program 1 times [2020-06-22 10:27:07,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:07,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:07,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:27:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 10:27:07,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:27:07,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:27:07,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:07,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 10:27:07,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:07,314 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 10:27:07,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,330 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 10:27:07,330 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,330 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 10:27:07,334 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:27:07,334 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,336 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,337 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,337 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:27:07,349 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,349 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 10:27:07,350 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:27:07,358 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,358 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,359 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 10:27:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 10:27:07,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:27:07,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-06-22 10:27:07,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-06-22 10:27:07,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 10:27:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:27:07,415 INFO L87 Difference]: Start difference. First operand 111 states and 233 transitions. Second operand 10 states. [2020-06-22 10:27:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:07,633 INFO L93 Difference]: Finished difference Result 111 states and 233 transitions. [2020-06-22 10:27:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 10:27:07,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-06-22 10:27:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:07,635 INFO L225 Difference]: With dead ends: 111 [2020-06-22 10:27:07,635 INFO L226 Difference]: Without dead ends: 110 [2020-06-22 10:27:07,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-06-22 10:27:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-06-22 10:27:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2020-06-22 10:27:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-06-22 10:27:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 151 transitions. [2020-06-22 10:27:07,650 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 151 transitions. Word has length 28 [2020-06-22 10:27:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:07,651 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 151 transitions. [2020-06-22 10:27:07,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-06-22 10:27:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 151 transitions. [2020-06-22 10:27:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-06-22 10:27:07,652 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:07,652 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:07,653 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:27:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1935515964, now seen corresponding path program 3 times [2020-06-22 10:27:07,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:07,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:07,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 10:27:07,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:27:07,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:27:07,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 10:27:07,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-06-22 10:27:07,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:27:07,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 53 conjunts are in the unsatisfiable core [2020-06-22 10:27:07,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:07,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:27:07,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,917 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,920 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 10:27:07,920 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,928 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,929 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,929 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-06-22 10:27:07,952 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:27:07,952 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:07,962 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:07,962 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:27:07,962 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2020-06-22 10:27:07,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 10:27:07,990 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:08,000 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:08,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:27:08,001 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2020-06-22 10:27:08,340 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:08,341 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 62 [2020-06-22 10:27:08,363 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:27:08,405 INFO L497 ElimStorePlain]: treesize reduction 32, result has 61.0 percent of original size [2020-06-22 10:27:08,407 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:27:08,407 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:25 [2020-06-22 10:27:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 10:27:08,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:27:08,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2020-06-22 10:27:08,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 10:27:08,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 10:27:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2020-06-22 10:27:08,496 INFO L87 Difference]: Start difference. First operand 76 states and 151 transitions. Second operand 20 states. [2020-06-22 10:30:40,154 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2020-06-22 10:30:45,547 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2020-06-22 10:30:45,733 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2020-06-22 10:30:50,963 WARN L188 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2020-06-22 10:30:51,128 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2020-06-22 10:30:51,312 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-06-22 10:30:51,601 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-06-22 10:30:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:30:51,867 INFO L93 Difference]: Finished difference Result 179 states and 353 transitions. [2020-06-22 10:30:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-06-22 10:30:51,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2020-06-22 10:30:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:30:51,868 INFO L225 Difference]: With dead ends: 179 [2020-06-22 10:30:51,869 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:30:51,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=489, Invalid=1146, Unknown=5, NotChecked=0, Total=1640 [2020-06-22 10:30:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:30:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:30:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:30:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:30:51,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-06-22 10:30:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:30:51,871 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:30:51,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 10:30:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:30:51,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:30:51,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:30:52,336 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 273 [2020-06-22 10:30:52,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:30:52,485 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 218 [2020-06-22 10:30:54,986 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 265 DAG size of output: 125 [2020-06-22 10:31:01,119 WARN L188 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 216 DAG size of output: 119 [2020-06-22 10:31:01,122 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-06-22 10:31:01,123 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 41) no Hoare annotation was computed. [2020-06-22 10:31:01,123 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:31:01,123 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 22) no Hoare annotation was computed. [2020-06-22 10:31:01,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 22) the Hoare annotation is: (let ((.cse3 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse8 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse11 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse19 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse4 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse20 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse18 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (.cse9 (= ULTIMATE.start_main_~length1~0 .cse3)) (.cse0 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse1 (not (= ULTIMATE.start_cstrpbrk_~s2.base ULTIMATE.start_cstrpbrk_~sc1~0.base))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse5 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (- 1))) 0)))) (.cse6 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse16 (= (select |#valid| ULTIMATE.start_cstrpbrk_~sc1~0.base) 1))) (or (let ((.cse2 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base))) (and .cse0 .cse1 (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 2) .cse2) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse3 (- 1)))) .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (and (<= 1 ULTIMATE.start_cstrpbrk_~sc1~0.offset) (and (let ((.cse7 (not (= ULTIMATE.start_cstrpbrk_~c~0 0))) (.cse10 (= (select |#valid| ULTIMATE.start_cstrpbrk_~s~0.base) 1)) (.cse12 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse13 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse17 (= 1 .cse18))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_cstrpbrk_~s~0.offset) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse7 .cse8 (<= 1 ULTIMATE.start_cstrpbrk_~s~0.offset) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) .cse19) .cse20) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) (+ .cse2 (- 1))) 0))) (and .cse8 .cse11 .cse19 .cse4 .cse15 .cse20 (= .cse18 1) (= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset) (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (- 1)))))) .cse9 .cse0 .cse1 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrpbrk_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)))) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)) (<= ULTIMATE.start_cstrpbrk_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length2~0))) .cse14 .cse5 .cse6 .cse16 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0))))))) [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,125 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,126 INFO L448 ceAbstractionStarter]: For program point L18-3(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,126 INFO L448 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. [2020-06-22 10:31:01,126 INFO L448 ceAbstractionStarter]: For program point L18-6(lines 18 19) no Hoare annotation was computed. [2020-06-22 10:31:01,126 INFO L444 ceAbstractionStarter]: At program point L18-8(lines 18 19) the Hoare annotation is: (let ((.cse29 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (.cse31 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)) (.cse26 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse33 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse3 (not (= ULTIMATE.start_cstrpbrk_~c~0 0))) (.cse4 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse6 (= ULTIMATE.start_main_~length1~0 .cse33)) (.cse8 (= (select |#valid| ULTIMATE.start_cstrpbrk_~s~0.base) 1)) (.cse9 (not (= 0 .cse26))) (.cse10 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse12 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse30 (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base)) (.cse13 (<= 1 .cse31)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse32 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (.cse15 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse16 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse17 (= (select |#valid| ULTIMATE.start_cstrpbrk_~sc1~0.base) 1)) (.cse18 (= 1 .cse29))) (let ((.cse2 (= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse11 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrpbrk_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base))))) (.cse0 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse33 (- 1))))) (.cse1 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (- 1))) 0)))) (.cse19 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse20 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse25 (and .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse12 (= 0 ULTIMATE.start_cstrpbrk_~s~0.offset) (or (<= 2 .cse31) (= 0 (select .cse30 ULTIMATE.start_cstrpbrk_~s2.offset))) .cse13 .cse14 (<= 1 .cse32) .cse15 .cse16 .cse17 .cse18)) (.cse5 (<= 1 ULTIMATE.start_cstrpbrk_~s~0.offset)) (.cse7 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse22 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0)))) (.cse21 (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) .cse32)) (.cse23 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) (+ .cse32 (- 1))) 0)) (.cse24 (not (= ULTIMATE.start_cstrpbrk_~s2.base ULTIMATE.start_cstrpbrk_~sc1~0.base)))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20 .cse21 .cse22 .cse23) .cse24) (and .cse25 (= ULTIMATE.start_cstrpbrk_~c~0 .cse26) .cse2 .cse7 .cse24 .cse11 (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) .cse0 .cse1 .cse19 .cse22 .cse23) (and .cse0 .cse1 .cse19 (let ((.cse27 (<= 1 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse28 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)))) (or (and (and .cse27 .cse7 .cse20 .cse25 .cse28 .cse22) .cse23) (and (and .cse4 .cse8 .cse10 .cse12 .cse27 .cse13 .cse15 .cse16 .cse28 .cse3 (= .cse29 1) .cse5 .cse6 .cse7 .cse9 .cse14 .cse17 .cse22) (= (select .cse30 (+ .cse31 (- 1))) 0) .cse21 .cse23))) .cse24))))) [2020-06-22 10:31:01,126 INFO L448 ceAbstractionStarter]: For program point L18-9(lines 18 19) no Hoare annotation was computed. [2020-06-22 10:31:01,127 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2020-06-22 10:31:01,127 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-06-22 10:31:01,127 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:31:01,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:01,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:01,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:01,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:01,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:01,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:01,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:01,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:01,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:01,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:01,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:01,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:31:01 BasicIcfg [2020-06-22 10:31:01,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:31:01,254 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:31:01,254 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:31:01,257 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:31:01,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:31:01,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:26:39" (1/5) ... [2020-06-22 10:31:01,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2affa8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:31:01, skipping insertion in model container [2020-06-22 10:31:01,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:31:01,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:26:40" (2/5) ... [2020-06-22 10:31:01,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2affa8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:31:01, skipping insertion in model container [2020-06-22 10:31:01,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:31:01,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:26:40" (3/5) ... [2020-06-22 10:31:01,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2affa8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:31:01, skipping insertion in model container [2020-06-22 10:31:01,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:31:01,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:26:40" (4/5) ... [2020-06-22 10:31:01,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2affa8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:31:01, skipping insertion in model container [2020-06-22 10:31:01,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:31:01,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:31:01" (5/5) ... [2020-06-22 10:31:01,262 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:31:01,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:31:01,283 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:31:01,283 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:31:01,283 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:31:01,283 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:31:01,283 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:31:01,283 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:31:01,283 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:31:01,283 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:31:01,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 10:31:01,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:31:01,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:01,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:01,297 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,297 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,297 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:31:01,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 10:31:01,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:31:01,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:01,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:01,299 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,304 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 11#L29true [92] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 6#L29-2true [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 14#L32-1true [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 23#L37true [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 32#L37-1true [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 29#L15-4true [2020-06-22 10:31:01,305 INFO L796 eck$LassoCheckResult]: Loop: 29#L15-4true [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 31#L15-1true [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 24#L17true [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 16#L18-8true [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 9#L18-1true [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 5#L18-2true [87] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} AuxVars[] AssignedVars[] 19#L18-6true [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 26#L18-9true [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 29#L15-4true [2020-06-22 10:31:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1860234476, now seen corresponding path program 1 times [2020-06-22 10:31:01,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:01,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 703825683, now seen corresponding path program 1 times [2020-06-22 10:31:01,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:01,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:31:01,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:31:01,348 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:31:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:31:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:31:01,350 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-06-22 10:31:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:31:01,427 INFO L93 Difference]: Finished difference Result 32 states and 64 transitions. [2020-06-22 10:31:01,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:31:01,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 64 transitions. [2020-06-22 10:31:01,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:31:01,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 18 states and 36 transitions. [2020-06-22 10:31:01,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 10:31:01,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 10:31:01,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 36 transitions. [2020-06-22 10:31:01,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:31:01,435 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. [2020-06-22 10:31:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 36 transitions. [2020-06-22 10:31:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:31:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:31:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2020-06-22 10:31:01,437 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. [2020-06-22 10:31:01,437 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. [2020-06-22 10:31:01,437 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:31:01,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 36 transitions. [2020-06-22 10:31:01,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:31:01,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:01,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:01,438 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,438 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,439 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 82#L29 [92] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 76#L29-2 [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 77#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 73#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 74#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 84#L15-4 [2020-06-22 10:31:01,440 INFO L796 eck$LassoCheckResult]: Loop: 84#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 86#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 78#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 79#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 80#L18-1 [183] L18-1-->L18-2: Formula: (and (not |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0)) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 81#L18-2 [87] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} AuxVars[] AssignedVars[] 88#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 83#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 84#L15-4 [2020-06-22 10:31:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1860234476, now seen corresponding path program 2 times [2020-06-22 10:31:01,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash 703885265, now seen corresponding path program 1 times [2020-06-22 10:31:01,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:31:01,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:01,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:31:01,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:31:01,505 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:31:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:31:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:31:01,506 INFO L87 Difference]: Start difference. First operand 18 states and 36 transitions. cyclomatic complexity: 19 Second operand 7 states. [2020-06-22 10:31:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:31:01,707 INFO L93 Difference]: Finished difference Result 26 states and 53 transitions. [2020-06-22 10:31:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:31:01,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 53 transitions. [2020-06-22 10:31:01,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 10:31:01,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 52 transitions. [2020-06-22 10:31:01,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 10:31:01,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 10:31:01,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 52 transitions. [2020-06-22 10:31:01,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:31:01,710 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 52 transitions. [2020-06-22 10:31:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 52 transitions. [2020-06-22 10:31:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-06-22 10:31:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:31:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-06-22 10:31:01,711 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 46 transitions. [2020-06-22 10:31:01,711 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 46 transitions. [2020-06-22 10:31:01,711 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:31:01,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 46 transitions. [2020-06-22 10:31:01,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:31:01,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:01,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:01,713 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,713 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:01,713 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 147#L29 [92] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 141#L29-2 [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 142#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 137#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 138#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 149#L15-4 [2020-06-22 10:31:01,715 INFO L796 eck$LassoCheckResult]: Loop: 149#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 151#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 143#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 144#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 145#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 146#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 154#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 153#L18-4 [193] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (<= .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short5_4|))) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 152#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 148#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 149#L15-4 [2020-06-22 10:31:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1860234476, now seen corresponding path program 3 times [2020-06-22 10:31:01,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2065085536, now seen corresponding path program 1 times [2020-06-22 10:31:01,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:31:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2008239027, now seen corresponding path program 1 times [2020-06-22 10:31:01,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:01,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:01,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:31:01,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 10:31:01,984 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-06-22 10:31:02,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:31:02,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:31:02,021 INFO L87 Difference]: Start difference. First operand 20 states and 46 transitions. cyclomatic complexity: 27 Second operand 9 states. [2020-06-22 10:31:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:31:02,428 INFO L93 Difference]: Finished difference Result 40 states and 84 transitions. [2020-06-22 10:31:02,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:31:02,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 84 transitions. [2020-06-22 10:31:02,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2020-06-22 10:31:02,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 83 transitions. [2020-06-22 10:31:02,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 10:31:02,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-06-22 10:31:02,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 83 transitions. [2020-06-22 10:31:02,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:31:02,432 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 83 transitions. [2020-06-22 10:31:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 83 transitions. [2020-06-22 10:31:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2020-06-22 10:31:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 10:31:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 73 transitions. [2020-06-22 10:31:02,433 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 73 transitions. [2020-06-22 10:31:02,433 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 73 transitions. [2020-06-22 10:31:02,434 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:31:02,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 73 transitions. [2020-06-22 10:31:02,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-06-22 10:31:02,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:02,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:02,435 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:02,435 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:02,436 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 230#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 231#L29-2 [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 234#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 235#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 250#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 233#L15-4 [2020-06-22 10:31:02,436 INFO L796 eck$LassoCheckResult]: Loop: 233#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 240#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 241#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 243#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 248#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 247#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 246#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 244#L18-4 [193] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (<= .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short5_4|))) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 242#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 232#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 233#L15-4 [2020-06-22 10:31:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1825140678, now seen corresponding path program 1 times [2020-06-22 10:31:02,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2065085536, now seen corresponding path program 2 times [2020-06-22 10:31:02,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:02,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash -834334375, now seen corresponding path program 1 times [2020-06-22 10:31:02,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:02,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:31:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:31:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:31:02,703 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-06-22 10:31:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:31:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:31:02,748 INFO L87 Difference]: Start difference. First operand 34 states and 73 transitions. cyclomatic complexity: 41 Second operand 7 states. [2020-06-22 10:31:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:31:02,986 INFO L93 Difference]: Finished difference Result 76 states and 166 transitions. [2020-06-22 10:31:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:31:02,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 166 transitions. [2020-06-22 10:31:02,988 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 48 [2020-06-22 10:31:02,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 166 transitions. [2020-06-22 10:31:02,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-06-22 10:31:02,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-06-22 10:31:02,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 166 transitions. [2020-06-22 10:31:02,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:31:02,991 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 166 transitions. [2020-06-22 10:31:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 166 transitions. [2020-06-22 10:31:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2020-06-22 10:31:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-06-22 10:31:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 128 transitions. [2020-06-22 10:31:02,993 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 128 transitions. [2020-06-22 10:31:02,993 INFO L609 BuchiCegarLoop]: Abstraction has 61 states and 128 transitions. [2020-06-22 10:31:02,994 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:31:02,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 128 transitions. [2020-06-22 10:31:02,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-06-22 10:31:02,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:02,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:02,995 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:02,995 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:02,996 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 359#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 360#L29-2 [131] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 388#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 386#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 385#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 384#L15-4 [2020-06-22 10:31:02,997 INFO L796 eck$LassoCheckResult]: Loop: 384#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 383#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 382#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 371#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 391#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 390#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 375#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 376#L18-4 [193] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (<= .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short5_4|))) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 369#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 370#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 384#L15-4 [2020-06-22 10:31:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1823859665, now seen corresponding path program 1 times [2020-06-22 10:31:02,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:02,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:02,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:03,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2065085536, now seen corresponding path program 3 times [2020-06-22 10:31:03,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:03,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:03,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1098518770, now seen corresponding path program 1 times [2020-06-22 10:31:03,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:03,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:03,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:31:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:03,147 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-06-22 10:31:03,396 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2020-06-22 10:31:03,501 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 10:31:03,514 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:31:03,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:31:03,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:31:03,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:31:03,515 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:31:03,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:31:03,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:31:03,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:31:03,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:31:03,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:31:03,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:31:03,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,788 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-06-22 10:31:03,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:03,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:04,293 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:31:04,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:31:04,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:04,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:04,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:04,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:04,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:04,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:04,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:04,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:04,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:04,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:04,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:04,395 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:31:04,411 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:31:04,411 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:31:04,414 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:31:04,415 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:31:04,415 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:31:04,415 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2020-06-22 10:31:04,444 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-06-22 10:31:04,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:04,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:31:04,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:04,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:31:04,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:04,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:31:04,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:04,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:31:04,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:04,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:31:04,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:04,686 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:31:04,690 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 10:31:04,691 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 61 states and 128 transitions. cyclomatic complexity: 70 Second operand 4 states. [2020-06-22 10:31:04,849 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 61 states and 128 transitions. cyclomatic complexity: 70. Second operand 4 states. Result 104 states and 227 transitions. Complement of second has 5 states. [2020-06-22 10:31:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:31:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:31:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-06-22 10:31:04,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 6 letters. Loop has 10 letters. [2020-06-22 10:31:04,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:31:04,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 16 letters. Loop has 10 letters. [2020-06-22 10:31:04,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:31:04,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 6 letters. Loop has 20 letters. [2020-06-22 10:31:04,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:31:04,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 227 transitions. [2020-06-22 10:31:04,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2020-06-22 10:31:04,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 89 states and 200 transitions. [2020-06-22 10:31:04,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2020-06-22 10:31:04,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-06-22 10:31:04,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 200 transitions. [2020-06-22 10:31:04,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:31:04,869 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 200 transitions. [2020-06-22 10:31:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 200 transitions. [2020-06-22 10:31:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2020-06-22 10:31:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-06-22 10:31:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 160 transitions. [2020-06-22 10:31:04,872 INFO L729 BuchiCegarLoop]: Abstraction has 76 states and 160 transitions. [2020-06-22 10:31:04,872 INFO L609 BuchiCegarLoop]: Abstraction has 76 states and 160 transitions. [2020-06-22 10:31:04,872 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:31:04,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 160 transitions. [2020-06-22 10:31:04,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-06-22 10:31:04,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:04,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:04,874 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:04,874 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:31:04,875 INFO L794 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 731#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 732#L29-2 [131] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 768#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 762#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 759#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 755#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 743#L15-1 [168] L15-1-->L17: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 723#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 724#L18-8 [2020-06-22 10:31:04,876 INFO L796 eck$LassoCheckResult]: Loop: 724#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 736#L18-1 [183] L18-1-->L18-2: Formula: (and (not |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0)) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 728#L18-2 [87] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} AuxVars[] AssignedVars[] 744#L18-6 [104] L18-6-->L18-8: Formula: (and |v_ULTIMATE.start_cstrpbrk_#t~short5_9| (= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_11 1) v_ULTIMATE.start_cstrpbrk_~s~0.offset_10) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_14 v_ULTIMATE.start_cstrpbrk_~s~0.base_13)) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_14, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_8|, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_2|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_13, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~post6.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 724#L18-8 [2020-06-22 10:31:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1028102413, now seen corresponding path program 1 times [2020-06-22 10:31:04,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash 4081285, now seen corresponding path program 1 times [2020-06-22 10:31:04,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:04,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:04,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:31:04,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:31:04,901 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:31:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:31:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:31:04,902 INFO L87 Difference]: Start difference. First operand 76 states and 160 transitions. cyclomatic complexity: 88 Second operand 3 states. [2020-06-22 10:31:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:31:04,956 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2020-06-22 10:31:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:31:04,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 114 transitions. [2020-06-22 10:31:04,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 10:31:04,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 39 states and 72 transitions. [2020-06-22 10:31:04,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:31:04,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:31:04,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 72 transitions. [2020-06-22 10:31:04,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:31:04,963 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 72 transitions. [2020-06-22 10:31:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 72 transitions. [2020-06-22 10:31:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 10:31:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 10:31:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 72 transitions. [2020-06-22 10:31:04,965 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 72 transitions. [2020-06-22 10:31:04,965 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 72 transitions. [2020-06-22 10:31:04,965 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:31:04,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 72 transitions. [2020-06-22 10:31:04,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 10:31:04,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:31:04,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:31:04,967 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:31:04,967 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:31:04,967 INFO L794 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 877#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 868#L29-2 [131] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 869#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 893#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 892#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 891#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 886#L15-1 [168] L15-1-->L17: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 873#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 874#L18-8 [2020-06-22 10:31:04,968 INFO L796 eck$LassoCheckResult]: Loop: 874#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 870#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 871#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 895#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 894#L18-4 [194] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| (+ .cse0 (- 256))) (> |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) |v_ULTIMATE.start_cstrpbrk_#t~short5_4|)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 887#L18-6 [104] L18-6-->L18-8: Formula: (and |v_ULTIMATE.start_cstrpbrk_#t~short5_9| (= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_11 1) v_ULTIMATE.start_cstrpbrk_~s~0.offset_10) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_14 v_ULTIMATE.start_cstrpbrk_~s~0.base_13)) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_14, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_8|, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_2|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_13, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~post6.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 874#L18-8 [2020-06-22 10:31:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1028102413, now seen corresponding path program 2 times [2020-06-22 10:31:04,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash -374743307, now seen corresponding path program 1 times [2020-06-22 10:31:04,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:31:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash -370835711, now seen corresponding path program 1 times [2020-06-22 10:31:04,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:31:04,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:31:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:31:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:31:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:31:05,482 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2020-06-22 10:31:05,614 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-06-22 10:31:05,616 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:31:05,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:31:05,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:31:05,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:31:05,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:31:05,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:31:05,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:31:05,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:31:05,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 10:31:05,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:31:05,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:31:05,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:05,962 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-06-22 10:31:06,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:06,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:31:06,212 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-06-22 10:31:06,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:31:06,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:31:06,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:31:06,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:31:06,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:31:06,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:31:06,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:31:06,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:31:06,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:31:06,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:31:06,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:31:06,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:31:06,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:31:06,520 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:31:06,529 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:31:06,529 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:31:06,529 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:31:06,530 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:31:06,530 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:31:06,530 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 Supporting invariants [] [2020-06-22 10:31:06,572 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 10:31:06,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:31:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:06,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:31:06,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:06,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:31:06,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:31:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:31:06,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:31:06,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:31:06,762 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:31:06,762 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates [2020-06-22 10:31:06,763 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 72 transitions. cyclomatic complexity: 36 Second operand 6 states. [2020-06-22 10:31:06,921 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 72 transitions. cyclomatic complexity: 36. Second operand 6 states. Result 63 states and 120 transitions. Complement of second has 7 states. [2020-06-22 10:31:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:31:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:31:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-06-22 10:31:06,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 10:31:06,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:31:06,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 15 letters. Loop has 6 letters. [2020-06-22 10:31:06,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:31:06,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 9 letters. Loop has 12 letters. [2020-06-22 10:31:06,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:31:06,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 120 transitions. [2020-06-22 10:31:06,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:31:06,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2020-06-22 10:31:06,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:31:06,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:31:06,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:31:06,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:31:06,928 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:31:06,928 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:31:06,928 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:31:06,928 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:31:06,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:31:06,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:31:06,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:31:06,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:31:06 BasicIcfg [2020-06-22 10:31:06,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:31:06,936 INFO L168 Benchmark]: Toolchain (without parser) took 266938.28 ms. Allocated memory was 649.6 MB in the beginning and 832.6 MB in the end (delta: 183.0 MB). Free memory was 564.1 MB in the beginning and 484.8 MB in the end (delta: 79.3 MB). Peak memory consumption was 262.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,936 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:31:06,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.95 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 564.1 MB in the beginning and 640.1 MB in the end (delta: -76.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.05 ms. Allocated memory is still 677.9 MB. Free memory was 640.1 MB in the beginning and 638.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,937 INFO L168 Benchmark]: Boogie Preprocessor took 26.21 ms. Allocated memory is still 677.9 MB. Free memory was 638.8 MB in the beginning and 636.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,938 INFO L168 Benchmark]: RCFGBuilder took 348.40 ms. Allocated memory is still 677.9 MB. Free memory was 636.0 MB in the beginning and 612.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,938 INFO L168 Benchmark]: BlockEncodingV2 took 140.40 ms. Allocated memory is still 677.9 MB. Free memory was 612.0 MB in the beginning and 601.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,938 INFO L168 Benchmark]: TraceAbstraction took 260359.23 ms. Allocated memory was 677.9 MB in the beginning and 850.4 MB in the end (delta: 172.5 MB). Free memory was 601.2 MB in the beginning and 739.0 MB in the end (delta: -137.7 MB). Peak memory consumption was 439.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,939 INFO L168 Benchmark]: BuchiAutomizer took 5681.51 ms. Allocated memory was 850.4 MB in the beginning and 832.6 MB in the end (delta: -17.8 MB). Free memory was 739.0 MB in the beginning and 484.8 MB in the end (delta: 254.1 MB). Peak memory consumption was 236.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:31:06,943 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 47 edges - StatisticsResult: Encoded RCFG 30 locations, 64 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 334.95 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 564.1 MB in the beginning and 640.1 MB in the end (delta: -76.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.05 ms. Allocated memory is still 677.9 MB. Free memory was 640.1 MB in the beginning and 638.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.21 ms. Allocated memory is still 677.9 MB. Free memory was 638.8 MB in the beginning and 636.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 348.40 ms. Allocated memory is still 677.9 MB. Free memory was 636.0 MB in the beginning and 612.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.40 ms. Allocated memory is still 677.9 MB. Free memory was 612.0 MB in the beginning and 601.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 260359.23 ms. Allocated memory was 677.9 MB in the beginning and 850.4 MB in the end (delta: 172.5 MB). Free memory was 601.2 MB in the beginning and 739.0 MB in the end (delta: -137.7 MB). Peak memory consumption was 439.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5681.51 ms. Allocated memory was 850.4 MB in the beginning and 832.6 MB in the end (delta: -17.8 MB). Free memory was 739.0 MB in the beginning and 484.8 MB in the end (delta: 254.1 MB). Peak memory consumption was 236.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-06-22 10:31:06,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:06,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:06,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:06,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:06,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:06,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && (((((0 == sc1 && ((((((((((((((!(c == 0) && s2 == 0) && 1 <= s) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString2] == length2) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((1 <= ULTIMATE.start_main_~length1~0 && sc1 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[sc1])) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && !(s2 == sc1)) || ((((((((((((((((((((((((((!(c == 0) && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 0 == s) && (2 <= unknown-#length-unknown[s2] || 0 == unknown-#memory_int-unknown[s2][s2])) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s]) && nondetString1 == 0) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) && c == unknown-#memory_int-unknown[sc1][sc1]) && 0 == sc1) && !(nondetString1 == nondetString2)) && !(s2 == sc1)) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((1 <= ULTIMATE.start_main_~length1~0 && sc1 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[sc1])) && s == s2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0)) || ((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && nondetString2 == 0) && (((((((1 <= sc1 && !(nondetString1 == nondetString2)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && ((((((((((((((!(c == 0) && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 0 == s) && (2 <= unknown-#length-unknown[s2] || 0 == unknown-#memory_int-unknown[s2][s2])) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s]) && nondetString1 == 0) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) && sc1 + 1 <= unknown-#length-unknown[sc1]) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) || ((((((((((((((((((((s2 == 0 && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= sc1) && 1 <= unknown-#length-unknown[s2]) && nondetString1 == 0) && 1 == \valid[s2]) && sc1 + 1 <= unknown-#length-unknown[sc1]) && !(c == 0)) && \valid[nondetString2] == 1) && 1 <= s) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 == \valid[nondetString1]) && \valid[sc1] == 1) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && s + 1 <= unknown-#length-unknown[s]) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0))) && !(s2 == sc1)) - InvariantResult [Line: 15]: Loop Invariant [2020-06-22 10:31:07,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:07,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:07,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:07,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:07,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:07,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:31:07,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 10:31:07,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:31:07,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:31:07,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:31:07,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:31:07,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((!(nondetString1 == nondetString2) && !(s2 == sc1)) && s + 2 <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && nondetString1 == 0) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && nondetString2 == 0) && sc1 + 1 <= unknown-#length-unknown[sc1]) && (1 <= sc1 && ((((((((((((!(c == 0) && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 0 == s) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) || (((((((((((!(c == 0) && s2 == 0) && 1 <= s) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2])) && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) || ((((((((((((((((((s2 == 0 && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && nondetString1 == 0) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && \valid[nondetString2] == 1) && 0 == sc1) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && !(s2 == sc1)) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((1 <= ULTIMATE.start_main_~length1~0 && sc1 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[sc1])) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && nondetString2 == 0) && \valid[sc1] == 1) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 14 error locations. SAFE Result, 260.1s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 245.8s AutomataDifference, 0.0s DeadEndRemovalTime, 9.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 4212 SDslu, 996 SDs, 0 SdLazy, 2912 SolverSat, 455 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 198.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 164 SyntacticMatches, 7 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 48.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 206 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 30 NumberOfFragments, 1161 HoareAnnotationTreeSize, 2 FomulaSimplifications, 62473 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 2 FomulaSimplificationsInter, 38913 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 450 ConstructedInterpolants, 72 QuantifiedInterpolants, 175902 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 37/159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.7s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 76 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 97 SDtfs, 629 SDslu, 415 SDs, 0 SdLazy, 946 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital218 mio100 ax100 hnf100 lsp97 ukn78 mio100 lsp38 div111 bol100 ite100 ukn100 eq171 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:31:07.260 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check