./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3d22aeda2fb15b9dd79854281ee0f5e475c0f7ee1551b76594f45703ddc81df --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:05:51,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:05:51,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:05:51,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:05:51,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:05:51,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:05:51,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:05:51,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:05:51,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:05:51,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:05:51,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:05:51,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:05:51,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:05:51,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:05:51,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:05:51,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:05:51,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:05:51,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:05:51,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:05:51,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:05:51,628 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:05:51,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:05:51,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:05:51,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:05:51,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:05:51,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:05:51,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:05:51,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:05:51,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:05:51,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:05:51,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:05:51,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:05:51,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:05:51,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:05:51,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:05:51,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:05:51,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:05:51,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:05:51,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:05:51,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:05:51,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:05:51,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:05:51,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:05:51,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:05:51,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:05:51,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:05:51,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:05:51,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:05:51,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:05:51,677 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:05:51,678 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:05:51,678 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:05:51,678 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:05:51,678 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:05:51,679 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:05:51,679 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:05:51,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:05:51,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:05:51,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:05:51,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:05:51,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:05:51,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:05:51,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:05:51,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:05:51,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:05:51,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:05:51,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:05:51,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:05:51,683 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:05:51,683 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3d22aeda2fb15b9dd79854281ee0f5e475c0f7ee1551b76594f45703ddc81df [2022-07-23 16:05:51,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:05:51,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:05:51,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:05:51,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:05:51,900 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:05:51,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2022-07-23 16:05:51,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f4602af/8d4f5c174b83474ab0b83d28896a24f4/FLAG7aa34b2c0 [2022-07-23 16:05:52,350 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:05:52,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2022-07-23 16:05:52,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f4602af/8d4f5c174b83474ab0b83d28896a24f4/FLAG7aa34b2c0 [2022-07-23 16:05:52,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f4602af/8d4f5c174b83474ab0b83d28896a24f4 [2022-07-23 16:05:52,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:05:52,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:05:52,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:05:52,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:05:52,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:05:52,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626b0685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52, skipping insertion in model container [2022-07-23 16:05:52,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:05:52,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:05:52,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:05:52,498 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:05:52,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:05:52,517 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:05:52,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52 WrapperNode [2022-07-23 16:05:52,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:05:52,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:05:52,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:05:52,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:05:52,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,549 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2022-07-23 16:05:52,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:05:52,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:05:52,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:05:52,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:05:52,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:05:52,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:05:52,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:05:52,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:05:52,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (1/1) ... [2022-07-23 16:05:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:05:52,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:05:52,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:05:52,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 16:05:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:05:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:05:52,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:05:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:05:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:05:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:05:52,689 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:05:52,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:05:52,789 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:05:52,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:05:52,793 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 16:05:52,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:05:52 BoogieIcfgContainer [2022-07-23 16:05:52,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:05:52,795 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:05:52,796 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:05:52,798 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:05:52,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:05:52,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:05:52" (1/3) ... [2022-07-23 16:05:52,799 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c23d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:05:52, skipping insertion in model container [2022-07-23 16:05:52,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:05:52,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:52" (2/3) ... [2022-07-23 16:05:52,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c23d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:05:52, skipping insertion in model container [2022-07-23 16:05:52,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:05:52,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:05:52" (3/3) ... [2022-07-23 16:05:52,801 INFO L354 chiAutomizerObserver]: Analyzing ICFG ArraysOfVariableLength4.c [2022-07-23 16:05:52,839 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:05:52,839 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:05:52,839 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:05:52,839 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:05:52,839 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:05:52,839 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:05:52,840 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:05:52,840 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:05:52,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:52,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-23 16:05:52,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:52,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:52,856 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:52,856 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-23 16:05:52,856 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:05:52,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:52,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-23 16:05:52,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:52,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:52,858 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:52,858 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-23 16:05:52,862 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 6#L25-3true [2022-07-23 16:05:52,863 INFO L754 eck$LassoCheckResult]: Loop: 6#L25-3true assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 5#L15-3true assume !(foo_~i~0#1 < foo_~size#1); 12#L15-4true foo_#res#1 := foo_~i~0#1; 13#L18true main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 14#L25-2true main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6#L25-3true [2022-07-23 16:05:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 16:05:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620181294] [2022-07-23 16:05:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 38364915, now seen corresponding path program 1 times [2022-07-23 16:05:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90902484] [2022-07-23 16:05:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:53,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90902484] [2022-07-23 16:05:53,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90902484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:05:53,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:05:53,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 16:05:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115817399] [2022-07-23 16:05:53,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:05:53,026 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:53,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:05:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:05:53,053 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:53,068 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-07-23 16:05:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:05:53,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2022-07-23 16:05:53,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-07-23 16:05:53,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2022-07-23 16:05:53,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-23 16:05:53,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-23 16:05:53,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-23 16:05:53,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:53,103 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-23 16:05:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-23 16:05:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-07-23 16:05:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-23 16:05:53,120 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-23 16:05:53,120 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-23 16:05:53,120 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:05:53,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-07-23 16:05:53,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-23 16:05:53,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:53,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:53,122 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:53,122 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:05:53,122 INFO L752 eck$LassoCheckResult]: Stem: 49#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 50#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 48#L25-3 [2022-07-23 16:05:53,122 INFO L754 eck$LassoCheckResult]: Loop: 48#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 51#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 52#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 57#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 45#L15-4 foo_#res#1 := foo_~i~0#1; 46#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 47#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 48#L25-3 [2022-07-23 16:05:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 16:05:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912967164] [2022-07-23 16:05:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1732759051, now seen corresponding path program 1 times [2022-07-23 16:05:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956616051] [2022-07-23 16:05:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956616051] [2022-07-23 16:05:53,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956616051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:05:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688858126] [2022-07-23 16:05:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:05:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:05:53,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:05:53,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 16:05:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:53,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 16:05:53,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:05:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:05:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688858126] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:05:53,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:05:53,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-07-23 16:05:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425781446] [2022-07-23 16:05:53,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:05:53,416 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 16:05:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-07-23 16:05:53,417 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:53,453 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-07-23 16:05:53,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 16:05:53,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-07-23 16:05:53,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-07-23 16:05:53,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2022-07-23 16:05:53,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-23 16:05:53,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-23 16:05:53,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2022-07-23 16:05:53,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:53,460 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-23 16:05:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2022-07-23 16:05:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-23 16:05:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-23 16:05:53,464 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-23 16:05:53,464 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-23 16:05:53,465 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:05:53,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-07-23 16:05:53,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-07-23 16:05:53,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:53,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:53,469 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:53,469 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2022-07-23 16:05:53,469 INFO L752 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 127#L25-3 [2022-07-23 16:05:53,469 INFO L754 eck$LassoCheckResult]: Loop: 127#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 130#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 131#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 136#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 142#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 141#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 140#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 139#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 138#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 137#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 124#L15-4 foo_#res#1 := foo_~i~0#1; 125#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 126#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 127#L25-3 [2022-07-23 16:05:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 16:05:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179174478] [2022-07-23 16:05:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1316700165, now seen corresponding path program 2 times [2022-07-23 16:05:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105237564] [2022-07-23 16:05:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105237564] [2022-07-23 16:05:53,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105237564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:05:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728971838] [2022-07-23 16:05:53,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 16:05:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:05:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:05:53,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:05:53,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 16:05:53,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 16:05:53,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:05:53,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 16:05:53,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:05:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:05:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:53,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728971838] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:05:53,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:05:53,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-23 16:05:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842617986] [2022-07-23 16:05:53,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:05:53,859 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 16:05:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2022-07-23 16:05:53,862 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:53,909 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-07-23 16:05:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 16:05:53,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2022-07-23 16:05:53,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-23 16:05:53,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2022-07-23 16:05:53,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-23 16:05:53,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-23 16:05:53,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2022-07-23 16:05:53,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:53,914 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-07-23 16:05:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2022-07-23 16:05:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-23 16:05:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-07-23 16:05:53,917 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-07-23 16:05:53,917 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-07-23 16:05:53,917 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:05:53,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2022-07-23 16:05:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-23 16:05:53,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:53,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:53,919 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:53,919 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2022-07-23 16:05:53,919 INFO L752 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 269#L25-3 [2022-07-23 16:05:53,920 INFO L754 eck$LassoCheckResult]: Loop: 269#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 275#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 279#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 272#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 273#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 296#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 295#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 294#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 293#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 292#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 291#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 290#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 289#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 288#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 287#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 286#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 285#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 284#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 283#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 282#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 281#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 280#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 266#L15-4 foo_#res#1 := foo_~i~0#1; 267#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 268#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 269#L25-3 [2022-07-23 16:05:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-23 16:05:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048663166] [2022-07-23 16:05:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2131617415, now seen corresponding path program 3 times [2022-07-23 16:05:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130365675] [2022-07-23 16:05:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:54,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130365675] [2022-07-23 16:05:54,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130365675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:05:54,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687923107] [2022-07-23 16:05:54,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 16:05:54,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:05:54,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:05:54,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:05:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 16:05:54,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-23 16:05:54,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:05:54,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 16:05:54,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:05:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:54,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:05:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:54,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687923107] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:05:54,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:05:54,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-07-23 16:05:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386609369] [2022-07-23 16:05:54,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:05:54,769 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 16:05:54,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 16:05:54,771 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:54,829 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-07-23 16:05:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 16:05:54,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2022-07-23 16:05:54,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-07-23 16:05:54,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 57 transitions. [2022-07-23 16:05:54,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-07-23 16:05:54,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-07-23 16:05:54,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2022-07-23 16:05:54,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:54,831 INFO L369 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-07-23 16:05:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2022-07-23 16:05:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-23 16:05:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-07-23 16:05:54,834 INFO L392 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-07-23 16:05:54,834 INFO L374 stractBuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-07-23 16:05:54,834 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 16:05:54,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2022-07-23 16:05:54,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-07-23 16:05:54,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:54,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:54,835 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:54,835 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 1, 1, 1, 1, 1] [2022-07-23 16:05:54,835 INFO L752 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 537#L25-3 [2022-07-23 16:05:54,835 INFO L754 eck$LassoCheckResult]: Loop: 537#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 543#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 547#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 540#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 541#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 588#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 587#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 586#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 585#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 584#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 583#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 582#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 581#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 580#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 579#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 578#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 577#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 576#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 575#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 574#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 573#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 572#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 571#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 570#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 569#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 568#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 567#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 566#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 565#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 564#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 563#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 562#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 561#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 560#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 559#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 558#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 557#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 556#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 555#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 554#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 553#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 552#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 551#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 550#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 549#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 548#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 534#L15-4 foo_#res#1 := foo_~i~0#1; 535#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 536#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 537#L25-3 [2022-07-23 16:05:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-23 16:05:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:54,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495770876] [2022-07-23 16:05:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:54,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:54,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1575559777, now seen corresponding path program 4 times [2022-07-23 16:05:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:54,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910273906] [2022-07-23 16:05:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910273906] [2022-07-23 16:05:55,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910273906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:05:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114430144] [2022-07-23 16:05:55,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 16:05:55,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:05:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:05:55,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:05:55,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 16:05:55,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 16:05:55,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:05:55,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 16:05:55,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:05:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:56,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:05:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:56,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114430144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:05:56,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:05:56,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2022-07-23 16:05:56,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986057387] [2022-07-23 16:05:56,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:05:56,663 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-07-23 16:05:56,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2050, Invalid=2920, Unknown=0, NotChecked=0, Total=4970 [2022-07-23 16:05:56,665 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 4 Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:56,763 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-07-23 16:05:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-23 16:05:56,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 77 transitions. [2022-07-23 16:05:56,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2022-07-23 16:05:56,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 77 transitions. [2022-07-23 16:05:56,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2022-07-23 16:05:56,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2022-07-23 16:05:56,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2022-07-23 16:05:56,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:56,766 INFO L369 hiAutomatonCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-23 16:05:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2022-07-23 16:05:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-23 16:05:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-07-23 16:05:56,770 INFO L392 hiAutomatonCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-23 16:05:56,770 INFO L374 stractBuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-23 16:05:56,770 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 16:05:56,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2022-07-23 16:05:56,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2022-07-23 16:05:56,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:56,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:56,772 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:56,772 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [32, 32, 1, 1, 1, 1, 1] [2022-07-23 16:05:56,772 INFO L752 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 1028#L25-3 [2022-07-23 16:05:56,772 INFO L754 eck$LassoCheckResult]: Loop: 1028#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 1035#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1039#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1032#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1033#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1100#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1099#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1098#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1097#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1096#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1095#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1094#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1093#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1092#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1091#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1090#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1089#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1088#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1087#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1086#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1085#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1084#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1083#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1082#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1081#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1080#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1079#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1078#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1077#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1076#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1075#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1074#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1073#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1072#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1071#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1070#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1069#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1068#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1067#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1066#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1065#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1064#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1063#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1062#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1061#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1060#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1059#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1058#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1057#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1056#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1055#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1054#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1053#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1052#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1051#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1050#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1049#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1048#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1047#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1046#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1045#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1044#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1043#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1042#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1041#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1040#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 1029#L15-4 foo_#res#1 := foo_~i~0#1; 1026#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 1027#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1028#L25-3 [2022-07-23 16:05:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-23 16:05:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509445196] [2022-07-23 16:05:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:56,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:56,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash 776556339, now seen corresponding path program 5 times [2022-07-23 16:05:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:56,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357486765] [2022-07-23 16:05:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:56,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:56,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -378248015, now seen corresponding path program 1 times [2022-07-23 16:05:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:56,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522252813] [2022-07-23 16:05:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:56,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:57,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:06:57,401 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 503 DAG size of output: 313 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-23 16:06:57,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 16:06:58,288 INFO L244 Elim1Store]: Index analysis took 774 ms [2022-07-23 16:06:58,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 496 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 429 [2022-07-23 16:06:58,876 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:06:58,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:06:58,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:06:58,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:06:58,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:06:58,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:06:58,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:06:58,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:06:58,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysOfVariableLength4.c_Iteration6_Lasso [2022-07-23 16:06:58,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:06:58,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:06:58,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:06:58,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:06:58,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:06:58,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:02,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:07:02,974 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:07:02,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:02,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:02,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 16:07:03,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-23 16:07:03,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 16:07:03,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 16:07:03,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 16:07:03,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,149 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 16:07:03,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-23 16:07:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,182 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 16:07:03,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-23 16:07:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 16:07:03,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 16:07:03,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 16:07:03,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,321 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 16:07:03,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,349 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 16:07:03,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:03,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:03,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:03,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:03,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,390 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 16:07:03,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:03,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:03,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:03,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:03,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:03,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:07:03,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:07:03,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:07:03,451 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-23 16:07:03,451 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-23 16:07:03,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:03,475 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:03,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:07:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 16:07:03,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:07:03,516 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:07:03,516 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#b~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = -1*ULTIMATE.start_main_~#b~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-23 16:07:03,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-23 16:07:03,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:10,404 INFO L293 tatePredicateManager]: 669 out of 669 supporting invariants were superfluous and have been removed [2022-07-23 16:07:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:07:10,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:07:10,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:07:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:07:10,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:07:10,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:07:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-07-23 16:07:10,855 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 16:07:10,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 77 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:10,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 77 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 145 states and 151 transitions. Complement of second has 7 states. [2022-07-23 16:07:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:07:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-23 16:07:10,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 69 letters. [2022-07-23 16:07:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:07:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 71 letters. Loop has 69 letters. [2022-07-23 16:07:10,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:07:10,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 138 letters. [2022-07-23 16:07:10,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:07:10,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 151 transitions. [2022-07-23 16:07:10,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:07:10,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 141 states and 146 transitions. [2022-07-23 16:07:10,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2022-07-23 16:07:10,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-23 16:07:10,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 146 transitions. [2022-07-23 16:07:10,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:07:10,905 INFO L369 hiAutomatonCegarLoop]: Abstraction has 141 states and 146 transitions. [2022-07-23 16:07:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 146 transitions. [2022-07-23 16:07:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 78. [2022-07-23 16:07:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.064102564102564) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-07-23 16:07:10,908 INFO L392 hiAutomatonCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-07-23 16:07:10,908 INFO L374 stractBuchiCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-07-23 16:07:10,908 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 16:07:10,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 83 transitions. [2022-07-23 16:07:10,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:07:10,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:07:10,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:07:10,909 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-23 16:07:10,909 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:07:10,909 INFO L752 eck$LassoCheckResult]: Stem: 4163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 4169#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 4165#L15-3 [2022-07-23 16:07:10,909 INFO L754 eck$LassoCheckResult]: Loop: 4165#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4166#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4165#L15-3 [2022-07-23 16:07:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2022-07-23 16:07:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:10,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174487708] [2022-07-23 16:07:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:10,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:10,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:07:10,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2022-07-23 16:07:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:10,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966983397] [2022-07-23 16:07:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:10,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:10,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:07:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-07-23 16:07:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:10,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192083468] [2022-07-23 16:07:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:10,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:10,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:07:11,104 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:07:11,104 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:07:11,104 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:07:11,104 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:07:11,104 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:07:11,104 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:07:11,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:07:11,105 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysOfVariableLength4.c_Iteration7_Lasso [2022-07-23 16:07:11,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:07:11,105 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:07:11,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:07:11,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:07:11,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:07:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,384 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 16:07:11,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:07:11,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:07:11,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:11,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:11,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,416 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 16:07:11,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:11,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:11,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:11,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:11,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,451 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 16:07:11,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:07:11,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:07:11,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:11,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:11,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,506 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 16:07:11,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:11,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:11,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:11,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:11,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-23 16:07:11,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,536 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 16:07:11,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:07:11,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:07:11,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:11,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:11,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,591 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 16:07:11,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:07:11,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:07:11,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:07:11,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:07:11,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:11,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,621 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 16:07:11,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:07:11,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:07:11,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:07:11,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:07:11,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:07:11,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:07:11,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:07:11,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:07:11,670 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-23 16:07:11,670 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-23 16:07:11,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:07:11,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:07:11,671 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:07:11,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 16:07:11,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:07:11,681 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:07:11,681 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:07:11,681 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_foo_~size#1, ULTIMATE.start_foo_~i~0#1) = 63*ULTIMATE.start_foo_~size#1 - 64*ULTIMATE.start_foo_~i~0#1 Supporting invariants [] [2022-07-23 16:07:11,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 16:07:11,723 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-23 16:07:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:07:11,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:07:11,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:07:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:07:11,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 16:07:11,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:07:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:07:11,781 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 16:07:11,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 83 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:11,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 83 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 199 states and 210 transitions. Complement of second has 7 states. [2022-07-23 16:07:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:07:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-07-23 16:07:11,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-23 16:07:11,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:07:11,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-23 16:07:11,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:07:11,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-23 16:07:11,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:07:11,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 210 transitions. [2022-07-23 16:07:11,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-23 16:07:11,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 155 states and 162 transitions. [2022-07-23 16:07:11,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:07:11,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:07:11,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 162 transitions. [2022-07-23 16:07:11,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:07:11,832 INFO L369 hiAutomatonCegarLoop]: Abstraction has 155 states and 162 transitions. [2022-07-23 16:07:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 162 transitions. [2022-07-23 16:07:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 78. [2022-07-23 16:07:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-23 16:07:11,836 INFO L392 hiAutomatonCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-23 16:07:11,836 INFO L374 stractBuchiCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-23 16:07:11,836 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 16:07:11,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 82 transitions. [2022-07-23 16:07:11,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:07:11,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:07:11,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:07:11,837 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 16:07:11,837 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:07:11,837 INFO L752 eck$LassoCheckResult]: Stem: 4503#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 4509#L25-3 assume !(main_~i~1#1 % 4294967296 < 32); 4510#L25-4 main_~i~1#1 := 0; 4511#L28-3 [2022-07-23 16:07:11,837 INFO L754 eck$LassoCheckResult]: Loop: 4511#L28-3 assume !!(main_~i~1#1 % 4294967296 < 32);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); 4512#L29 assume !(32 != main_#t~mem5#1);havoc main_#t~mem5#1; 4513#L28-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4511#L28-3 [2022-07-23 16:07:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:11,838 INFO L85 PathProgramCache]: Analyzing trace with hash 925723, now seen corresponding path program 1 times [2022-07-23 16:07:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:11,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423810148] [2022-07-23 16:07:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:07:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:07:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:07:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423810148] [2022-07-23 16:07:11,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423810148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:07:11,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:07:11,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 16:07:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022484998] [2022-07-23 16:07:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:07:11,860 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:07:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 69737, now seen corresponding path program 1 times [2022-07-23 16:07:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:11,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549567715] [2022-07-23 16:07:11,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:11,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:11,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:11,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:07:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:07:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:07:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:07:11,904 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:07:11,918 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2022-07-23 16:07:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:07:11,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 153 transitions. [2022-07-23 16:07:11,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:07:11,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 153 transitions. [2022-07-23 16:07:11,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-23 16:07:11,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 16:07:11,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 153 transitions. [2022-07-23 16:07:11,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:07:11,923 INFO L369 hiAutomatonCegarLoop]: Abstraction has 149 states and 153 transitions. [2022-07-23 16:07:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 153 transitions. [2022-07-23 16:07:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 78. [2022-07-23 16:07:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:07:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-07-23 16:07:11,931 INFO L392 hiAutomatonCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-07-23 16:07:11,931 INFO L374 stractBuchiCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-07-23 16:07:11,931 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 16:07:11,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 81 transitions. [2022-07-23 16:07:11,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:07:11,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:07:11,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:07:11,933 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 16:07:11,933 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:07:11,933 INFO L752 eck$LassoCheckResult]: Stem: 4736#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 4742#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 4743#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4748#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4740#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4741#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4809#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4808#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4807#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4806#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4805#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4804#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4803#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4802#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4801#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4800#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4799#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4798#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4797#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4796#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4795#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4794#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4793#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4792#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4791#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4790#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4789#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4788#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4787#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4786#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4785#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4784#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4783#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4782#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4781#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4780#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4779#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4778#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4777#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4776#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4775#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4774#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4773#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4772#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4771#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4770#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4769#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4768#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4767#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4766#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4765#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4764#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4763#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4762#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4761#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4760#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4759#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4758#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4757#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4756#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4755#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4754#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4753#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4752#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4751#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4750#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4749#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 4732#L15-4 foo_#res#1 := foo_~i~0#1; 4733#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 4734#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4735#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 4738#L15-3 [2022-07-23 16:07:11,933 INFO L754 eck$LassoCheckResult]: Loop: 4738#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 4739#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 4738#L15-3 [2022-07-23 16:07:11,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1159213433, now seen corresponding path program 2 times [2022-07-23 16:07:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:11,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810182677] [2022-07-23 16:07:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:12,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:12,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:07:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 2 times [2022-07-23 16:07:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089797269] [2022-07-23 16:07:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:12,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:12,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:07:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:07:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1607580027, now seen corresponding path program 3 times [2022-07-23 16:07:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:07:12,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554236496] [2022-07-23 16:07:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:07:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:07:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:12,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:07:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:07:12,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:08:15,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-23 16:09:34,261 WARN L233 SmtUtils]: Spent 2.37m on a formula simplification. DAG size of input: 549 DAG size of output: 340 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-23 16:09:34,379 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:09:34,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:09:34,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:09:34,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:09:34,380 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:09:34,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:09:34,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:09:34,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:09:34,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysOfVariableLength4.c_Iteration9_Lasso [2022-07-23 16:09:34,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:09:34,380 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:09:34,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:09:34,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:09:34,799 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:09:34,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:09:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:09:34,801 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:09:34,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 16:09:34,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:09:34,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:09:34,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:09:34,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:09:34,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:09:34,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:09:34,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:09:34,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:09:34,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-23 16:09:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:09:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:09:34,838 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:09:34,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 16:09:34,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:09:34,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:09:34,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:09:34,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:09:34,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:09:34,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:09:34,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:09:34,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:09:34,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:09:34,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-23 16:09:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:09:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:09:34,879 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:09:34,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-23 16:09:34,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:09:34,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:09:34,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:09:34,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:09:34,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:09:34,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:09:34,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:09:34,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:09:34,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-23 16:09:34,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:09:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:09:34,914 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:09:34,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-23 16:09:34,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:09:34,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:09:34,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:09:34,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:09:34,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:09:34,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:09:34,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:09:34,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:09:34,980 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-23 16:09:34,980 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-07-23 16:09:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:09:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:09:34,982 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:09:34,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-23 16:09:34,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:09:34,989 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 16:09:34,989 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:09:34,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~#b~0#1.base) (+ ULTIMATE.start_main_~#b~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_1, ULTIMATE.start_foo_~i~0#1) = 63*v_rep(select (select #memory_int ULTIMATE.start_main_~#b~0#1.base) (+ ULTIMATE.start_main_~#b~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_1 - 2*ULTIMATE.start_foo_~i~0#1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#mask~0#1.base)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~#b~0#1.base) (+ ULTIMATE.start_main_~#b~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_1 >= 0] [2022-07-23 16:09:35,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 16:09:35,017 INFO L293 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2022-07-23 16:09:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:09:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:09:35,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 16:09:35,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:09:35,152 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 16:09:35,153 INFO L390 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 15 [2022-07-23 16:09:35,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-23 16:09:36,452 INFO L390 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 [2022-07-23 16:09:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:09:36,498 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 16:09:36,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:09:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:09:36,530 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.38 stem predicates 2 loop predicates [2022-07-23 16:09:36,530 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 81 transitions. cyclomatic complexity: 6 Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:36,556 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 81 transitions. cyclomatic complexity: 6. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 82 transitions. Complement of second has 4 states. [2022-07-23 16:09:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-23 16:09:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2022-07-23 16:09:36,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 72 letters. Loop has 2 letters. [2022-07-23 16:09:36,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:09:36,559 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 16:09:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:09:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:09:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 16:09:36,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:09:36,625 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 16:09:36,625 INFO L390 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 15 [2022-07-23 16:09:37,525 INFO L390 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 [2022-07-23 16:09:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:09:37,592 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 16:09:37,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:09:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:09:37,632 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.38 stem predicates 2 loop predicates [2022-07-23 16:09:37,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 81 transitions. cyclomatic complexity: 6 Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:37,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 81 transitions. cyclomatic complexity: 6. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 82 transitions. Complement of second has 4 states. [2022-07-23 16:09:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-23 16:09:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2022-07-23 16:09:37,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 72 letters. Loop has 2 letters. [2022-07-23 16:09:37,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:09:37,662 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 16:09:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:09:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:09:37,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 16:09:37,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:09:37,751 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 16:09:37,752 INFO L390 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 15 [2022-07-23 16:09:38,978 INFO L390 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 [2022-07-23 16:09:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:09:39,050 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 16:09:39,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:09:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:09:39,093 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.38 stem predicates 2 loop predicates [2022-07-23 16:09:39,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 81 transitions. cyclomatic complexity: 6 Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:40,451 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 81 transitions. cyclomatic complexity: 6. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 332 states and 344 transitions. Complement of second has 46 states. [2022-07-23 16:09:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 43 states 38 stem states 2 non-accepting loop states 2 accepting loop states [2022-07-23 16:09:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 112 transitions. [2022-07-23 16:09:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 112 transitions. Stem has 72 letters. Loop has 2 letters. [2022-07-23 16:09:40,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:09:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 112 transitions. Stem has 74 letters. Loop has 2 letters. [2022-07-23 16:09:40,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:09:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 112 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-23 16:09:40,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:09:40,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 344 transitions. [2022-07-23 16:09:40,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:09:40,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 217 states and 221 transitions. [2022-07-23 16:09:40,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 16:09:40,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-23 16:09:40,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 221 transitions. [2022-07-23 16:09:40,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:09:40,460 INFO L369 hiAutomatonCegarLoop]: Abstraction has 217 states and 221 transitions. [2022-07-23 16:09:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 221 transitions. [2022-07-23 16:09:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 147. [2022-07-23 16:09:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.0204081632653061) internal successors, (150), 146 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:09:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2022-07-23 16:09:40,472 INFO L392 hiAutomatonCegarLoop]: Abstraction has 147 states and 150 transitions. [2022-07-23 16:09:40,472 INFO L374 stractBuchiCegarLoop]: Abstraction has 147 states and 150 transitions. [2022-07-23 16:09:40,472 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 16:09:40,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 150 transitions. [2022-07-23 16:09:40,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:09:40,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:09:40,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:09:40,477 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [64, 64, 3, 2, 2, 2, 2, 1, 1] [2022-07-23 16:09:40,477 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:09:40,480 INFO L752 eck$LassoCheckResult]: Stem: 6235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 6241#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 6242#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6315#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6314#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6313#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6312#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6311#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6310#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6309#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6308#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6307#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6306#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6305#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6304#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6303#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6302#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6301#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6300#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6299#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6298#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6297#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6296#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6295#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6294#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6293#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6292#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6291#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6290#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6289#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6288#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6287#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6286#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6285#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6284#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6283#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6282#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6281#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6280#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6279#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6278#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6277#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6276#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6275#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6274#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6273#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6272#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6271#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6270#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6269#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6268#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6267#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6266#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6265#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6264#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6263#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6262#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6261#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6260#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6259#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6258#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6257#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6256#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6255#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6254#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6253#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6252#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 6251#L15-4 foo_#res#1 := foo_~i~0#1; 6232#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 6233#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6234#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 6243#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6248#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6239#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6240#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6376#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6375#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6374#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6373#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6372#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6371#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6370#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6369#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6368#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6367#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6366#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6365#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6364#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6363#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6362#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6361#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6360#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6359#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6358#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6357#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6356#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6355#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6354#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6353#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6352#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6351#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6350#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6349#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6348#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6347#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6346#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6345#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6344#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6343#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6342#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6341#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6340#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6339#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6338#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6337#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6336#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6335#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6334#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6333#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6332#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6331#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6330#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6329#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6328#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6327#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6326#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6325#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6324#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6323#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6322#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6321#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6320#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6319#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6318#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6317#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6316#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 6230#L15-4 foo_#res#1 := foo_~i~0#1; 6231#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 6250#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6249#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 6237#L15-3 [2022-07-23 16:09:40,480 INFO L754 eck$LassoCheckResult]: Loop: 6237#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 6238#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 6237#L15-3 [2022-07-23 16:09:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:09:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1030043623, now seen corresponding path program 4 times [2022-07-23 16:09:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:09:40,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874462364] [2022-07-23 16:09:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:09:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:09:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:09:40,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:09:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:09:40,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:09:40,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:09:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 3 times [2022-07-23 16:09:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:09:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004521571] [2022-07-23 16:09:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:09:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:09:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:09:40,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:09:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:09:40,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:09:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:09:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2029444201, now seen corresponding path program 5 times [2022-07-23 16:09:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:09:40,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169128790] [2022-07-23 16:09:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:09:40,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:09:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:09:40,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:09:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:09:40,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace