./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU --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 ef4a52e45666a829b602608a46cff9c8137910dd58bdfaebe016ce17984d1ac8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:13:28,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:13:28,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:13:28,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:13:28,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:13:28,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:13:28,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:13:28,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:13:28,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:13:28,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:13:28,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:13:28,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:13:28,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:13:28,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:13:28,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:13:28,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:13:28,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:13:28,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:13:28,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:13:28,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:13:28,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:13:28,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:13:28,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:13:28,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:13:28,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:13:28,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:13:28,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:13:28,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:13:28,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:13:28,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:13:28,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:13:28,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:13:28,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:13:28,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:13:28,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:13:28,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:13:28,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:13:28,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:13:28,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:13:28,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:13:28,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:13:28,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-02 22:13:28,275 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:13:28,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:13:28,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:13:28,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:13:28,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:13:28,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:13:28,279 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:13:28,279 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-02 22:13:28,279 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-02 22:13:28,279 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-02 22:13:28,280 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-02 22:13:28,280 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-02 22:13:28,280 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-02 22:13:28,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:13:28,281 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:13:28,281 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:13:28,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:13:28,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:13:28,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:13:28,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-02 22:13:28,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-02 22:13:28,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-02 22:13:28,283 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:13:28,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:13:28,284 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-02 22:13:28,284 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:13:28,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-02 22:13:28,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:13:28,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:13:28,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:13:28,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:13:28,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:13:28,287 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-02 22:13:28,287 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU 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 -> ef4a52e45666a829b602608a46cff9c8137910dd58bdfaebe016ce17984d1ac8 [2021-11-02 22:13:28,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:13:28,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:13:28,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:13:28,597 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:13:28,598 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:13:28,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2021-11-02 22:13:28,686 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/data/9b41d8598/ddbf78f641ff442cb152691e900febb4/FLAG088ebe543 [2021-11-02 22:13:29,122 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:13:29,122 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2021-11-02 22:13:29,131 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/data/9b41d8598/ddbf78f641ff442cb152691e900febb4/FLAG088ebe543 [2021-11-02 22:13:29,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/data/9b41d8598/ddbf78f641ff442cb152691e900febb4 [2021-11-02 22:13:29,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:13:29,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:13:29,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:13:29,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:13:29,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:13:29,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382b370f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29, skipping insertion in model container [2021-11-02 22:13:29,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:13:29,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:13:29,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:13:29,751 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:13:29,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:13:29,785 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:13:29,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29 WrapperNode [2021-11-02 22:13:29,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:13:29,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:13:29,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:13:29,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:13:29,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:13:29,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:13:29,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:13:29,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:13:29,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:13:29,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:13:29,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:13:29,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:13:29,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (1/1) ... [2021-11-02 22:13:29,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:29,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:29,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:29,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-02 22:13:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:13:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:13:29,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:13:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:13:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:13:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:13:30,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:13:30,181 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-02 22:13:30,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:13:30 BoogieIcfgContainer [2021-11-02 22:13:30,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:13:30,185 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-02 22:13:30,185 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-02 22:13:30,189 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-02 22:13:30,190 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:13:30,190 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 10:13:29" (1/3) ... [2021-11-02 22:13:30,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2653a14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:13:30, skipping insertion in model container [2021-11-02 22:13:30,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:13:30,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:13:29" (2/3) ... [2021-11-02 22:13:30,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2653a14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:13:30, skipping insertion in model container [2021-11-02 22:13:30,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:13:30,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:13:30" (3/3) ... [2021-11-02 22:13:30,195 INFO L389 chiAutomizerObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration.c [2021-11-02 22:13:30,285 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-02 22:13:30,285 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-02 22:13:30,285 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-02 22:13:30,286 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-02 22:13:30,286 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-02 22:13:30,286 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-02 22:13:30,286 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-02 22:13:30,286 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-02 22:13:30,303 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) [2021-11-02 22:13:30,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-02 22:13:30,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:30,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:30,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:13:30,344 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-02 22:13:30,344 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-02 22:13:30,344 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) [2021-11-02 22:13:30,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-02 22:13:30,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:30,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:30,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:13:30,365 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-02 22:13:30,373 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 16#L26-3true [2021-11-02 22:13:30,374 INFO L793 eck$LassoCheckResult]: Loop: 16#L26-3true assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9#L17-3true assume !(foo_~i~0 <= foo_~size); 10#L17-4true foo_#res := foo_~i~0; 17#L20true main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15#L26-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16#L26-3true [2021-11-02 22:13:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-02 22:13:30,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:30,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512592970] [2021-11-02 22:13:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:30,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:30,572 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:30,621 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:30,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 38364915, now seen corresponding path program 1 times [2021-11-02 22:13:30,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:30,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576196874] [2021-11-02 22:13:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:30,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:30,661 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:30,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1809804401, now seen corresponding path program 1 times [2021-11-02 22:13:30,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:30,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702993560] [2021-11-02 22:13:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:30,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:30,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:30,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702993560] [2021-11-02 22:13:30,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702993560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:13:30,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:13:30,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:13:30,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899905203] [2021-11-02 22:13:31,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:13:31,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:13:31,142 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-02 22:13:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:31,223 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-11-02 22:13:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:13:31,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2021-11-02 22:13:31,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-02 22:13:31,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 26 transitions. [2021-11-02 22:13:31,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-11-02 22:13:31,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-11-02 22:13:31,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2021-11-02 22:13:31,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:13:31,244 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-11-02 22:13:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2021-11-02 22:13:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2021-11-02 22:13:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 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) [2021-11-02 22:13:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-02 22:13:31,281 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-02 22:13:31,281 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-02 22:13:31,281 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-02 22:13:31,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-11-02 22:13:31,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-02 22:13:31,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:31,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:31,283 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-02 22:13:31,283 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-02 22:13:31,283 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 69#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 74#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 73#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 63#L17-2 [2021-11-02 22:13:31,284 INFO L793 eck$LassoCheckResult]: Loop: 63#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 64#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 63#L17-2 [2021-11-02 22:13:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2021-11-02 22:13:31,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:31,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790307321] [2021-11-02 22:13:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,306 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,368 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1599, now seen corresponding path program 1 times [2021-11-02 22:13:31,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:31,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294191375] [2021-11-02 22:13:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,388 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash 889666569, now seen corresponding path program 1 times [2021-11-02 22:13:31,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:31,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051622391] [2021-11-02 22:13:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:31,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:31,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051622391] [2021-11-02 22:13:31,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051622391] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:31,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751927891] [2021-11-02 22:13:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:31,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:31,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:31,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 22:13:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:31,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:13:31,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:31,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751927891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:13:31,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 22:13:31,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-11-02 22:13:31,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255283816] [2021-11-02 22:13:31,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:31,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:13:31,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:13:31,706 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2021-11-02 22:13:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:31,775 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-11-02 22:13:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:13:31,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2021-11-02 22:13:31,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2021-11-02 22:13:31,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 33 transitions. [2021-11-02 22:13:31,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-11-02 22:13:31,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-11-02 22:13:31,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2021-11-02 22:13:31,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:13:31,781 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-11-02 22:13:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2021-11-02 22:13:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2021-11-02 22:13:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 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) [2021-11-02 22:13:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-11-02 22:13:31,784 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-11-02 22:13:31,784 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-11-02 22:13:31,784 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-02 22:13:31,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2021-11-02 22:13:31,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-02 22:13:31,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:31,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:31,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-02 22:13:31,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-02 22:13:31,787 INFO L791 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 145#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 149#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 152#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 154#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 150#L17-3 assume !(foo_~i~0 <= foo_~size); 151#L17-4 [2021-11-02 22:13:31,787 INFO L793 eck$LassoCheckResult]: Loop: 151#L17-4 foo_#res := foo_~i~0; 153#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 147#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 148#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 140#L17-3 assume !(foo_~i~0 <= foo_~size); 151#L17-4 [2021-11-02 22:13:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 889666567, now seen corresponding path program 1 times [2021-11-02 22:13:31,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:31,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164176157] [2021-11-02 22:13:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,806 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,838 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash 51595455, now seen corresponding path program 2 times [2021-11-02 22:13:31,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:31,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432463001] [2021-11-02 22:13:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,859 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:31,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1198432377, now seen corresponding path program 1 times [2021-11-02 22:13:31,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:31,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169629262] [2021-11-02 22:13:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:13:31,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:31,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169629262] [2021-11-02 22:13:31,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169629262] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:31,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401139580] [2021-11-02 22:13:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:31,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:31,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:32,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 22:13:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:32,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:13:32,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:13:32,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401139580] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:32,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:32,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-02 22:13:32,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924754111] [2021-11-02 22:13:32,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:13:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:13:32,284 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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) [2021-11-02 22:13:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:32,383 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-11-02 22:13:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:13:32,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2021-11-02 22:13:32,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-11-02 22:13:32,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2021-11-02 22:13:32,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-11-02 22:13:32,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-11-02 22:13:32,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-11-02 22:13:32,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:13:32,390 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-11-02 22:13:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-11-02 22:13:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2021-11-02 22:13:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 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) [2021-11-02 22:13:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-11-02 22:13:32,400 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-11-02 22:13:32,400 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-11-02 22:13:32,400 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-02 22:13:32,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-11-02 22:13:32,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:13:32,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:32,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:32,404 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-02 22:13:32,404 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:13:32,410 INFO L791 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 226#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 233#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 235#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 239#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 238#L17-3 assume !(foo_~i~0 <= foo_~size); 237#L17-4 [2021-11-02 22:13:32,410 INFO L793 eck$LassoCheckResult]: Loop: 237#L17-4 foo_#res := foo_~i~0; 236#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 230#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 231#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 234#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 223#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 224#L17-3 assume !(foo_~i~0 <= foo_~size); 237#L17-4 [2021-11-02 22:13:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 889666567, now seen corresponding path program 2 times [2021-11-02 22:13:32,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:32,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634781862] [2021-11-02 22:13:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:32,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:32,426 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:32,464 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1956372739, now seen corresponding path program 1 times [2021-11-02 22:13:32,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:32,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293946116] [2021-11-02 22:13:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:32,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:32,476 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:32,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 642281527, now seen corresponding path program 2 times [2021-11-02 22:13:32,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:32,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757149279] [2021-11-02 22:13:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:32,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:13:32,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:32,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757149279] [2021-11-02 22:13:32,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757149279] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:32,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434058459] [2021-11-02 22:13:32,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:13:32,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:32,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:32,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 22:13:32,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:13:32,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:13:32,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:13:32,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:13:32,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434058459] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:32,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:32,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-02 22:13:32,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849969027] [2021-11-02 22:13:33,077 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-02 22:13:33,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:33,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:13:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:13:33,177 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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) [2021-11-02 22:13:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:33,296 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2021-11-02 22:13:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:13:33,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2021-11-02 22:13:33,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-11-02 22:13:33,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2021-11-02 22:13:33,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-11-02 22:13:33,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-11-02 22:13:33,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2021-11-02 22:13:33,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:13:33,302 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-11-02 22:13:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2021-11-02 22:13:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2021-11-02 22:13:33,307 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) [2021-11-02 22:13:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-11-02 22:13:33,308 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-11-02 22:13:33,308 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-11-02 22:13:33,308 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-02 22:13:33,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-11-02 22:13:33,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-11-02 22:13:33,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:33,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:33,312 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-02 22:13:33,312 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1] [2021-11-02 22:13:33,312 INFO L791 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 327#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 334#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 337#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 342#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 340#L17-3 assume !(foo_~i~0 <= foo_~size); 338#L17-4 [2021-11-02 22:13:33,312 INFO L793 eck$LassoCheckResult]: Loop: 338#L17-4 foo_#res := foo_~i~0; 336#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 331#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 332#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 339#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 324#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 325#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 335#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 341#L17-3 assume !(foo_~i~0 <= foo_~size); 338#L17-4 [2021-11-02 22:13:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 889666567, now seen corresponding path program 3 times [2021-11-02 22:13:33,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:33,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683379513] [2021-11-02 22:13:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:33,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:33,339 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:33,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1121476027, now seen corresponding path program 2 times [2021-11-02 22:13:33,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:33,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719117699] [2021-11-02 22:13:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:33,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:33,360 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:33,372 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1242740619, now seen corresponding path program 3 times [2021-11-02 22:13:33,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:33,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190630615] [2021-11-02 22:13:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:33,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:33,394 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:33,438 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:33,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:33,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-11-02 22:13:34,002 INFO L388 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 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-02 22:13:34,154 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:13:34,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:13:34,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:13:34,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:13:34,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:13:34,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:34,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:13:34,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:13:34,159 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration5_Lasso [2021-11-02 22:13:34,159 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:13:34,159 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:13:34,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:34,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:35,122 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:13:35,128 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:13:35,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-02 22:13:35,140 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 [2021-11-02 22:13:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-02 22:13:35,197 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 [2021-11-02 22:13:35,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-11-02 22:13:35,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-02 22:13:35,241 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 [2021-11-02 22:13:35,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,344 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 [2021-11-02 22:13:35,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:35,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:35,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-02 22:13:35,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,429 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,435 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 [2021-11-02 22:13:35,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-02 22:13:35,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,514 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 [2021-11-02 22:13:35,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-02 22:13:35,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,551 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-02 22:13:35,553 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 [2021-11-02 22:13:35,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,591 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-02 22:13:35,594 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 [2021-11-02 22:13:35,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:35,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:35,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-11-02 22:13:35,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,644 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-02 22:13:35,646 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 [2021-11-02 22:13:35,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:35,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:35,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:35,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,731 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,740 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 [2021-11-02 22:13:35,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:35,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:35,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-02 22:13:35,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,838 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 [2021-11-02 22:13:35,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:35,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:35,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-02 22:13:35,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:35,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:35,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:35,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:35,937 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 [2021-11-02 22:13:35,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:35,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:35,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:35,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:35,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:35,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:35,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-02 22:13:35,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:36,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:36,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:36,011 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:36,018 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 [2021-11-02 22:13:36,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:36,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:36,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:36,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:36,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:36,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:36,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-02 22:13:36,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:36,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:36,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:36,087 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:36,092 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 [2021-11-02 22:13:36,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-02 22:13:36,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:36,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:36,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:36,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:36,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:36,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:36,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:36,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:36,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:36,178 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:36,189 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 [2021-11-02 22:13:36,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:36,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:36,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:36,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:36,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:36,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:36,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:36,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-02 22:13:36,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:36,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:36,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:36,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:36,257 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:36,259 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 [2021-11-02 22:13:36,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-02 22:13:36,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:36,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:36,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:36,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:36,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:36,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:36,319 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:13:36,392 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-11-02 22:13:36,392 INFO L444 ModelExtractionUtils]: 18 out of 37 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-11-02 22:13:36,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:36,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:36,431 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:36,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-02 22:13:36,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:13:36,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:13:36,536 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:13:36,537 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2021-11-02 22:13:36,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:36,625 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-11-02 22:13:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:36,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:13:36,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:36,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 22:13:36,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:37,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2021-11-02 22:13:37,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2021-11-02 22:13:37,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:37,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 4. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) Result 41 states and 47 transitions. Complement of second has 15 states. [2021-11-02 22:13:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-11-02 22:13:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2021-11-02 22:13:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2021-11-02 22:13:37,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 6 letters. Loop has 9 letters. [2021-11-02 22:13:37,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:37,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 15 letters. Loop has 9 letters. [2021-11-02 22:13:37,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:37,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 6 letters. Loop has 18 letters. [2021-11-02 22:13:37,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:37,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2021-11-02 22:13:37,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2021-11-02 22:13:37,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 46 transitions. [2021-11-02 22:13:37,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-11-02 22:13:37,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-02 22:13:37,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2021-11-02 22:13:37,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:37,202 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2021-11-02 22:13:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2021-11-02 22:13:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2021-11-02 22:13:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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) [2021-11-02 22:13:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-11-02 22:13:37,209 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-11-02 22:13:37,209 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-11-02 22:13:37,210 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-02 22:13:37,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-11-02 22:13:37,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:13:37,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:37,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:37,215 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:13:37,215 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1, 1] [2021-11-02 22:13:37,215 INFO L791 eck$LassoCheckResult]: Stem: 500#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 501#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 509#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 510#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 524#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 517#L17-3 assume !(foo_~i~0 <= foo_~size); 518#L17-4 foo_#res := foo_~i~0; 511#L20 [2021-11-02 22:13:37,216 INFO L793 eck$LassoCheckResult]: Loop: 511#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 502#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 503#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 515#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 526#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 525#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 493#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 494#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 507#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 523#L17-3 assume !(foo_~i~0 <= foo_~size); 513#L17-4 foo_#res := foo_~i~0; 511#L20 [2021-11-02 22:13:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1809859825, now seen corresponding path program 1 times [2021-11-02 22:13:37,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:37,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773729560] [2021-11-02 22:13:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:37,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:37,247 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:37,266 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 961271861, now seen corresponding path program 3 times [2021-11-02 22:13:37,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:37,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977066482] [2021-11-02 22:13:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:37,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:37,278 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:37,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash 132390213, now seen corresponding path program 4 times [2021-11-02 22:13:37,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:37,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139884523] [2021-11-02 22:13:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:37,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:13:37,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:37,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139884523] [2021-11-02 22:13:37,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139884523] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:37,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817005640] [2021-11-02 22:13:37,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-02 22:13:37,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:37,363 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:37,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-02 22:13:37,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-02 22:13:37,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:13:37,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:13:37,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:13:37,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817005640] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:37,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:37,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-11-02 22:13:37,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836356754] [2021-11-02 22:13:37,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:37,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:37,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:37,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-11-02 22:13:38,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:38,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:13:38,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:13:38,031 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2021-11-02 22:13:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:38,257 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-11-02 22:13:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 22:13:38,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 80 transitions. [2021-11-02 22:13:38,259 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2021-11-02 22:13:38,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 72 transitions. [2021-11-02 22:13:38,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-02 22:13:38,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-02 22:13:38,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 72 transitions. [2021-11-02 22:13:38,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:38,261 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2021-11-02 22:13:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 72 transitions. [2021-11-02 22:13:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2021-11-02 22:13:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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) [2021-11-02 22:13:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-11-02 22:13:38,265 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-11-02 22:13:38,265 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-11-02 22:13:38,265 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-02 22:13:38,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2021-11-02 22:13:38,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:13:38,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:38,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:38,266 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2021-11-02 22:13:38,267 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1, 1] [2021-11-02 22:13:38,267 INFO L791 eck$LassoCheckResult]: Stem: 692#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 693#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 701#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 704#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 710#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 709#L17-3 assume !(foo_~i~0 <= foo_~size); 706#L17-4 foo_#res := foo_~i~0; 707#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 725#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 705#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 700#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 687#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 688#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 726#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 724#L17-3 assume !(foo_~i~0 <= foo_~size); 711#L17-4 foo_#res := foo_~i~0; 702#L20 [2021-11-02 22:13:38,268 INFO L793 eck$LassoCheckResult]: Loop: 702#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 694#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 695#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 699#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 685#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 686#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 721#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 719#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 716#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 715#L17-3 assume !(foo_~i~0 <= foo_~size); 712#L17-4 foo_#res := foo_~i~0; 702#L20 [2021-11-02 22:13:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 129746499, now seen corresponding path program 5 times [2021-11-02 22:13:38,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:38,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074515798] [2021-11-02 22:13:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:38,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:38,283 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:38,310 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 961271861, now seen corresponding path program 4 times [2021-11-02 22:13:38,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:38,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077614708] [2021-11-02 22:13:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:38,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:38,325 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:38,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:38,348 INFO L85 PathProgramCache]: Analyzing trace with hash 6616243, now seen corresponding path program 6 times [2021-11-02 22:13:38,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:38,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966777443] [2021-11-02 22:13:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:38,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:38,412 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:38,467 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:38,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:38,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:38,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:38,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2021-11-02 22:13:39,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:39,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-11-02 22:13:39,590 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:13:39,590 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:13:39,590 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:13:39,590 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:13:39,590 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:13:39,590 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:39,590 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:13:39,591 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:13:39,591 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration7_Lasso [2021-11-02 22:13:39,591 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:13:39,591 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:13:39,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:39,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:39,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:39,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:39,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:39,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:39,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:40,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:40,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:40,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:40,544 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:13:40,545 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:13:40,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,546 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,562 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 [2021-11-02 22:13:40,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:40,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:40,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:40,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:40,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:40,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:40,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:40,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-02 22:13:40,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:40,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:40,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,637 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,639 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 [2021-11-02 22:13:40,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:40,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:40,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:40,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:40,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:40,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:40,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:40,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-02 22:13:40,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:40,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:40,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,712 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-02 22:13:40,714 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 [2021-11-02 22:13:40,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:40,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:40,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:40,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:40,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:40,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:40,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:40,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:40,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:40,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,783 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,795 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 [2021-11-02 22:13:40,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:40,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:40,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:40,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:40,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:40,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:40,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-02 22:13:40,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:40,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:40,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,881 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,885 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 [2021-11-02 22:13:40,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-02 22:13:40,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:40,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:40,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:40,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:40,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:40,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:40,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:40,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:40,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:40,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,931 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,933 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 [2021-11-02 22:13:40,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-02 22:13:40,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:40,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:40,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:40,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:40,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:40,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:40,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:40,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:40,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-11-02 22:13:40,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:40,974 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:40,993 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 [2021-11-02 22:13:41,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:41,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:41,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:41,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-02 22:13:41,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,069 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,071 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 [2021-11-02 22:13:41,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-02 22:13:41,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-11-02 22:13:41,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,127 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-02 22:13:41,129 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 [2021-11-02 22:13:41,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,199 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,202 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 [2021-11-02 22:13:41,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:41,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:41,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:41,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-02 22:13:41,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,271 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,280 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 [2021-11-02 22:13:41,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-02 22:13:41,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,358 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,364 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 [2021-11-02 22:13:41,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-02 22:13:41,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,434 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,437 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 [2021-11-02 22:13:41,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-02 22:13:41,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,519 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-11-02 22:13:41,523 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 [2021-11-02 22:13:41,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:41,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,577 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-11-02 22:13:41,580 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 [2021-11-02 22:13:41,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:41,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:41,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:41,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:41,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:41,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:41,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:13:41,706 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-11-02 22:13:41,706 INFO L444 ModelExtractionUtils]: 2 out of 40 variables were initially zero. Simplification set additionally 35 variables to zero. [2021-11-02 22:13:41,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:41,711 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:41,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-11-02 22:13:41,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:13:41,724 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:13:41,724 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:13:41,724 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 3 Supporting invariants [] [2021-11-02 22:13:41,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:41,777 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-11-02 22:13:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:41,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:13:41,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:41,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:13:41,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:42,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:42,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2021-11-02 22:13:42,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2021-11-02 22:13:42,307 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) Result 96 states and 109 transitions. Complement of second has 15 states. [2021-11-02 22:13:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-11-02 22:13:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2021-11-02 22:13:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2021-11-02 22:13:42,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 16 letters. Loop has 11 letters. [2021-11-02 22:13:42,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:42,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 27 letters. Loop has 11 letters. [2021-11-02 22:13:42,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:42,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 16 letters. Loop has 22 letters. [2021-11-02 22:13:42,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:42,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 109 transitions. [2021-11-02 22:13:42,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-11-02 22:13:42,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 72 states and 82 transitions. [2021-11-02 22:13:42,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-02 22:13:42,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-11-02 22:13:42,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 82 transitions. [2021-11-02 22:13:42,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:42,316 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-11-02 22:13:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 82 transitions. [2021-11-02 22:13:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2021-11-02 22:13:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.152542372881356) internal successors, (68), 58 states have internal predecessors, (68), 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) [2021-11-02 22:13:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2021-11-02 22:13:42,321 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. [2021-11-02 22:13:42,321 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. [2021-11-02 22:13:42,322 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-02 22:13:42,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 68 transitions. [2021-11-02 22:13:42,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-11-02 22:13:42,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:42,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:42,323 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2021-11-02 22:13:42,324 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-11-02 22:13:42,324 INFO L791 eck$LassoCheckResult]: Stem: 996#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 997#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 1005#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1010#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1042#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1015#L17-3 assume !(foo_~i~0 <= foo_~size); 1016#L17-4 foo_#res := foo_~i~0; 1041#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1000#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1001#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1027#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1028#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1023#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1024#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1020#L17-3 assume !(foo_~i~0 <= foo_~size); 1019#L17-4 foo_#res := foo_~i~0; 1013#L20 [2021-11-02 22:13:42,324 INFO L793 eck$LassoCheckResult]: Loop: 1013#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 998#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 999#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1003#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 989#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 990#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1046#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1045#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1044#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1043#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1017#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1018#L17-3 assume !(foo_~i~0 <= foo_~size); 1012#L17-4 foo_#res := foo_~i~0; 1013#L20 [2021-11-02 22:13:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 129746499, now seen corresponding path program 7 times [2021-11-02 22:13:42,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:42,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070683062] [2021-11-02 22:13:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:42,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:42,337 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:42,352 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 364346039, now seen corresponding path program 5 times [2021-11-02 22:13:42,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:42,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642528953] [2021-11-02 22:13:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:42,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:42,362 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:42,373 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2063298485, now seen corresponding path program 8 times [2021-11-02 22:13:42,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:42,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001727664] [2021-11-02 22:13:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:42,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 22:13:42,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:42,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001727664] [2021-11-02 22:13:42,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001727664] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:42,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616542070] [2021-11-02 22:13:42,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:13:42,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:42,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:42,459 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:42,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-02 22:13:42,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:13:42,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:13:42,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:13:42,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 22:13:42,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616542070] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:42,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:42,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-11-02 22:13:42,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010720428] [2021-11-02 22:13:43,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:43,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:43,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:43,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2021-11-02 22:13:43,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 22:13:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:13:43,281 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. cyclomatic complexity: 13 Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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) [2021-11-02 22:13:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:43,680 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2021-11-02 22:13:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 22:13:43,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 162 transitions. [2021-11-02 22:13:43,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2021-11-02 22:13:43,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 136 states and 152 transitions. [2021-11-02 22:13:43,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-11-02 22:13:43,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-11-02 22:13:43,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 152 transitions. [2021-11-02 22:13:43,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:43,686 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 152 transitions. [2021-11-02 22:13:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 152 transitions. [2021-11-02 22:13:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2021-11-02 22:13:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1375) internal successors, (91), 79 states have internal predecessors, (91), 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) [2021-11-02 22:13:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2021-11-02 22:13:43,694 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-11-02 22:13:43,694 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-11-02 22:13:43,694 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-02 22:13:43,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 91 transitions. [2021-11-02 22:13:43,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-11-02 22:13:43,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:43,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:43,697 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 2, 1, 1] [2021-11-02 22:13:43,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-11-02 22:13:43,697 INFO L791 eck$LassoCheckResult]: Stem: 1340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1341#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 1350#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1362#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1363#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1359#L17-3 assume !(foo_~i~0 <= foo_~size); 1356#L17-4 foo_#res := foo_~i~0; 1357#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1380#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1379#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1378#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1377#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1376#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1375#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1374#L17-3 assume !(foo_~i~0 <= foo_~size); 1369#L17-4 foo_#res := foo_~i~0; 1370#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1410#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1409#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1394#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1395#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1388#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1384#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1385#L17-3 assume !(foo_~i~0 <= foo_~size); 1372#L17-4 foo_#res := foo_~i~0; 1368#L20 [2021-11-02 22:13:43,697 INFO L793 eck$LassoCheckResult]: Loop: 1368#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1342#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1343#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1351#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1333#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1334#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1347#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1367#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1366#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1365#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1360#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1361#L17-3 assume !(foo_~i~0 <= foo_~size); 1364#L17-4 foo_#res := foo_~i~0; 1368#L20 [2021-11-02 22:13:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash -741891791, now seen corresponding path program 9 times [2021-11-02 22:13:43,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:43,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081059498] [2021-11-02 22:13:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:43,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 22:13:43,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:43,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081059498] [2021-11-02 22:13:43,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081059498] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:43,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161801317] [2021-11-02 22:13:43,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:13:43,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:43,812 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:43,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-02 22:13:43,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-02 22:13:43,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:13:43,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 22:13:43,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 22:13:44,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161801317] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:44,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:44,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-11-02 22:13:44,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543631129] [2021-11-02 22:13:44,087 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:13:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash 364346039, now seen corresponding path program 6 times [2021-11-02 22:13:44,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:44,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207331657] [2021-11-02 22:13:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:44,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,108 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,122 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:44,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:44,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:44,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:44,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:44,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:44,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:44,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 52 [2021-11-02 22:13:44,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 22:13:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:13:44,577 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. cyclomatic complexity: 15 Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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) [2021-11-02 22:13:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:44,758 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-11-02 22:13:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:13:44,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2021-11-02 22:13:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-11-02 22:13:44,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 63 states and 68 transitions. [2021-11-02 22:13:44,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-11-02 22:13:44,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-11-02 22:13:44,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 68 transitions. [2021-11-02 22:13:44,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:44,762 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2021-11-02 22:13:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 68 transitions. [2021-11-02 22:13:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2021-11-02 22:13:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.087719298245614) internal successors, (62), 56 states have internal predecessors, (62), 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) [2021-11-02 22:13:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-11-02 22:13:44,767 INFO L704 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-11-02 22:13:44,767 INFO L587 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-11-02 22:13:44,767 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-02 22:13:44,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 62 transitions. [2021-11-02 22:13:44,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-11-02 22:13:44,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:44,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:44,769 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 3, 3, 3, 2, 2, 1, 1] [2021-11-02 22:13:44,769 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-11-02 22:13:44,770 INFO L791 eck$LassoCheckResult]: Stem: 1606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1607#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 1615#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1641#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1637#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1635#L17-3 assume !(foo_~i~0 <= foo_~size); 1629#L17-4 foo_#res := foo_~i~0; 1626#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1608#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1609#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1619#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1644#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1640#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1636#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1634#L17-3 assume !(foo_~i~0 <= foo_~size); 1621#L17-4 foo_#res := foo_~i~0; 1616#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1610#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1611#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1620#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1601#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1602#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1614#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1655#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1654#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1653#L17-3 assume !(foo_~i~0 <= foo_~size); 1627#L17-4 foo_#res := foo_~i~0; 1625#L20 [2021-11-02 22:13:44,770 INFO L793 eck$LassoCheckResult]: Loop: 1625#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1624#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1623#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1613#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1599#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1600#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1648#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1646#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1643#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1639#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1633#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1632#L17-3 assume !(foo_~i~0 <= foo_~size); 1628#L17-4 foo_#res := foo_~i~0; 1625#L20 [2021-11-02 22:13:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:44,770 INFO L85 PathProgramCache]: Analyzing trace with hash 6616243, now seen corresponding path program 10 times [2021-11-02 22:13:44,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:44,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331511375] [2021-11-02 22:13:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:44,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,787 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 364346039, now seen corresponding path program 7 times [2021-11-02 22:13:44,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:44,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773026224] [2021-11-02 22:13:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:44,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,816 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,825 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1211447109, now seen corresponding path program 11 times [2021-11-02 22:13:44,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:44,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027656369] [2021-11-02 22:13:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:44,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,847 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:44,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:45,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:45,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:45,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:45,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:45,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:45,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2021-11-02 22:13:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:46,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:46,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:46,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2021-11-02 22:13:46,522 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:13:46,522 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:13:46,523 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:13:46,523 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:13:46,523 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:13:46,523 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:46,523 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:13:46,523 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:13:46,523 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration10_Lasso [2021-11-02 22:13:46,523 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:13:46,523 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:13:46,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:46,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:46,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:46,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:46,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:46,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:47,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:47,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:47,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:47,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:47,477 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:13:47,477 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:13:47,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,495 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-11-02 22:13:47,497 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 [2021-11-02 22:13:47,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:47,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:47,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:47,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,536 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-11-02 22:13:47,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 [2021-11-02 22:13:47,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:47,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:47,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:47,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-11-02 22:13:47,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,574 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-11-02 22:13:47,575 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 [2021-11-02 22:13:47,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:47,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:47,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:47,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-11-02 22:13:47,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,611 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,614 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 [2021-11-02 22:13:47,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:47,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:47,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:47,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-11-02 22:13:47,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-11-02 22:13:47,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,653 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-11-02 22:13:47,654 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 [2021-11-02 22:13:47,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:47,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:47,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:47,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,744 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-11-02 22:13:47,752 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 [2021-11-02 22:13:47,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:47,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:47,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:47,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:47,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,817 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,819 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 [2021-11-02 22:13:47,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:47,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:47,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-11-02 22:13:47,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:47,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,895 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,898 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 [2021-11-02 22:13:47,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:47,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:47,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-11-02 22:13:47,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:47,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:47,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:47,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:47,972 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:47,975 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 [2021-11-02 22:13:47,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:47,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:47,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:47,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:47,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-11-02 22:13:47,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:47,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:48,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:48,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:48,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:48,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:48,061 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:48,065 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 [2021-11-02 22:13:48,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:48,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:48,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:48,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:48,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:48,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:48,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-11-02 22:13:48,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:48,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:48,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:48,136 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:48,138 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 [2021-11-02 22:13:48,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-11-02 22:13:48,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:48,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:48,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:48,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:48,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:48,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:48,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:48,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:48,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:48,211 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:48,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-11-02 22:13:48,213 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 [2021-11-02 22:13:48,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:48,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:48,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:48,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:48,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:48,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:48,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:48,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-11-02 22:13:48,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:48,259 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:48,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-11-02 22:13:48,261 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 [2021-11-02 22:13:48,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:48,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:48,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:48,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:48,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:48,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:48,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:13:48,349 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-11-02 22:13:48,349 INFO L444 ModelExtractionUtils]: 2 out of 40 variables were initially zero. Simplification set additionally 35 variables to zero. [2021-11-02 22:13:48,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:48,360 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:48,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:13:48,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-11-02 22:13:48,385 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:13:48,385 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:13:48,386 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 5 Supporting invariants [] [2021-11-02 22:13:48,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-11-02 22:13:48,468 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2021-11-02 22:13:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:48,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:13:48,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:48,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:48,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 22:13:48,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:48,910 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2021-11-02 22:13:48,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 62 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) [2021-11-02 22:13:49,107 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 62 transitions. cyclomatic complexity: 8. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) Result 123 states and 136 transitions. Complement of second has 17 states. [2021-11-02 22:13:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2021-11-02 22:13:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) [2021-11-02 22:13:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2021-11-02 22:13:49,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 27 letters. Loop has 13 letters. [2021-11-02 22:13:49,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:49,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 40 letters. Loop has 13 letters. [2021-11-02 22:13:49,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:49,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 27 letters. Loop has 26 letters. [2021-11-02 22:13:49,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:49,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2021-11-02 22:13:49,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-11-02 22:13:49,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 87 states and 97 transitions. [2021-11-02 22:13:49,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-11-02 22:13:49,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-11-02 22:13:49,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 97 transitions. [2021-11-02 22:13:49,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:49,117 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 97 transitions. [2021-11-02 22:13:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 97 transitions. [2021-11-02 22:13:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2021-11-02 22:13:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.12) internal successors, (84), 74 states have internal predecessors, (84), 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) [2021-11-02 22:13:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-11-02 22:13:49,129 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-11-02 22:13:49,130 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-11-02 22:13:49,130 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-02 22:13:49,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 84 transitions. [2021-11-02 22:13:49,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-02 22:13:49,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:49,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:49,132 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 3, 3, 3, 2, 2, 1, 1] [2021-11-02 22:13:49,132 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 1, 1, 1, 1, 1] [2021-11-02 22:13:49,132 INFO L791 eck$LassoCheckResult]: Stem: 2023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2024#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 2033#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2037#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2049#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2048#L17-3 assume !(foo_~i~0 <= foo_~size); 2039#L17-4 foo_#res := foo_~i~0; 2034#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2027#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2028#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2038#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2081#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2031#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2032#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2079#L17-3 assume !(foo_~i~0 <= foo_~size); 2080#L17-4 foo_#res := foo_~i~0; 2090#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2069#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2065#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2062#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2061#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2060#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2059#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2058#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2057#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2050#L17-3 assume !(foo_~i~0 <= foo_~size); 2051#L17-4 foo_#res := foo_~i~0; 2045#L20 [2021-11-02 22:13:49,132 INFO L793 eck$LassoCheckResult]: Loop: 2045#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2025#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2026#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2041#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2016#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2017#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2030#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2056#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2055#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2054#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2053#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2052#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2044#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2042#L17-3 assume !(foo_~i~0 <= foo_~size); 2043#L17-4 foo_#res := foo_~i~0; 2045#L20 [2021-11-02 22:13:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash 6616243, now seen corresponding path program 12 times [2021-11-02 22:13:49,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:49,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549707542] [2021-11-02 22:13:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:49,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:49,166 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:49,206 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:49,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2050718535, now seen corresponding path program 8 times [2021-11-02 22:13:49,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:49,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646856861] [2021-11-02 22:13:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:49,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:49,221 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:49,233 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash 264590791, now seen corresponding path program 13 times [2021-11-02 22:13:49,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:49,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966084935] [2021-11-02 22:13:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:49,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 36 proven. 128 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-02 22:13:49,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:49,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966084935] [2021-11-02 22:13:49,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966084935] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:49,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771974106] [2021-11-02 22:13:49,383 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-02 22:13:49,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:49,384 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:49,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-02 22:13:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:49,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-02 22:13:49,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 43 proven. 121 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-02 22:13:49,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771974106] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:49,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:49,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-11-02 22:13:49,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078204344] [2021-11-02 22:13:50,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-02 22:13:50,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 22:13:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-02 22:13:50,347 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. cyclomatic complexity: 13 Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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) [2021-11-02 22:13:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:50,895 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2021-11-02 22:13:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-02 22:13:50,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 193 transitions. [2021-11-02 22:13:50,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2021-11-02 22:13:50,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 165 states and 181 transitions. [2021-11-02 22:13:50,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2021-11-02 22:13:50,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2021-11-02 22:13:50,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 181 transitions. [2021-11-02 22:13:50,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:50,901 INFO L681 BuchiCegarLoop]: Abstraction has 165 states and 181 transitions. [2021-11-02 22:13:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 181 transitions. [2021-11-02 22:13:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2021-11-02 22:13:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.11) internal successors, (111), 99 states have internal predecessors, (111), 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) [2021-11-02 22:13:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-11-02 22:13:50,909 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-11-02 22:13:50,909 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-11-02 22:13:50,909 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-02 22:13:50,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 111 transitions. [2021-11-02 22:13:50,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-02 22:13:50,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:50,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:50,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 4, 4, 4, 3, 3, 1, 1] [2021-11-02 22:13:50,912 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 1, 1, 1, 1, 1] [2021-11-02 22:13:50,913 INFO L791 eck$LassoCheckResult]: Stem: 2474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2475#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 2483#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2497#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2498#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2493#L17-3 assume !(foo_~i~0 <= foo_~size); 2494#L17-4 foo_#res := foo_~i~0; 2484#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2478#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2479#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2536#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2535#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2534#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2533#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2532#L17-3 assume !(foo_~i~0 <= foo_~size); 2531#L17-4 foo_#res := foo_~i~0; 2529#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2530#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2488#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2489#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2469#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2470#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2482#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2564#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2563#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2539#L17-3 assume !(foo_~i~0 <= foo_~size); 2540#L17-4 foo_#res := foo_~i~0; 2561#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2560#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2521#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2522#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2558#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2556#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2554#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2552#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2550#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2545#L17-3 assume !(foo_~i~0 <= foo_~size); 2546#L17-4 foo_#res := foo_~i~0; 2491#L20 [2021-11-02 22:13:50,913 INFO L793 eck$LassoCheckResult]: Loop: 2491#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2476#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2477#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2487#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2467#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2468#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2481#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2503#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2502#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2501#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2500#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2499#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2495#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2496#L17-3 assume !(foo_~i~0 <= foo_~size); 2490#L17-4 foo_#res := foo_~i~0; 2491#L20 [2021-11-02 22:13:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2106286147, now seen corresponding path program 14 times [2021-11-02 22:13:50,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:50,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624934793] [2021-11-02 22:13:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:50,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 91 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-02 22:13:51,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:51,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624934793] [2021-11-02 22:13:51,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624934793] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:51,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266702761] [2021-11-02 22:13:51,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:13:51,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:51,027 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:51,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-02 22:13:51,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:13:51,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:13:51,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 22:13:51,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 55 proven. 63 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-02 22:13:51,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266702761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:51,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:51,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-02 22:13:51,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15560350] [2021-11-02 22:13:51,505 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:13:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:51,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2050718535, now seen corresponding path program 9 times [2021-11-02 22:13:51,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:51,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865603637] [2021-11-02 22:13:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:51,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:51,515 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:51,524 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:51,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:51,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2021-11-02 22:13:52,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 22:13:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:13:52,083 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. cyclomatic complexity: 15 Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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) [2021-11-02 22:13:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:52,347 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2021-11-02 22:13:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 22:13:52,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 116 transitions. [2021-11-02 22:13:52,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-02 22:13:52,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 83 states and 88 transitions. [2021-11-02 22:13:52,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-11-02 22:13:52,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-11-02 22:13:52,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 88 transitions. [2021-11-02 22:13:52,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:52,351 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. [2021-11-02 22:13:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 88 transitions. [2021-11-02 22:13:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2021-11-02 22:13:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 73 states have internal predecessors, (79), 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) [2021-11-02 22:13:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2021-11-02 22:13:52,356 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 79 transitions. [2021-11-02 22:13:52,356 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 79 transitions. [2021-11-02 22:13:52,357 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-02 22:13:52,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 79 transitions. [2021-11-02 22:13:52,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-02 22:13:52,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:52,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:52,359 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 3, 1, 1] [2021-11-02 22:13:52,359 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 1, 1, 1, 1, 1] [2021-11-02 22:13:52,360 INFO L791 eck$LassoCheckResult]: Stem: 2833#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2834#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 2844#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2845#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2862#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2860#L17-3 assume !(foo_~i~0 <= foo_~size); 2856#L17-4 foo_#res := foo_~i~0; 2848#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2838#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2839#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2886#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2885#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2884#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2883#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2882#L17-3 assume !(foo_~i~0 <= foo_~size); 2881#L17-4 foo_#res := foo_~i~0; 2849#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2850#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2846#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2847#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2829#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2830#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2887#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2842#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2843#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2879#L17-3 assume !(foo_~i~0 <= foo_~size); 2880#L17-4 foo_#res := foo_~i~0; 2900#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2899#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2898#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2897#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2896#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2895#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2894#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2893#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2892#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2891#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2890#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2861#L17-3 assume !(foo_~i~0 <= foo_~size); 2857#L17-4 foo_#res := foo_~i~0; 2852#L20 [2021-11-02 22:13:52,360 INFO L793 eck$LassoCheckResult]: Loop: 2852#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2836#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2837#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2855#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2827#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2828#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2841#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2867#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2866#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2865#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2864#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2863#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2859#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2858#L17-3 assume !(foo_~i~0 <= foo_~size); 2851#L17-4 foo_#res := foo_~i~0; 2852#L20 [2021-11-02 22:13:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1211447109, now seen corresponding path program 15 times [2021-11-02 22:13:52,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:52,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399118369] [2021-11-02 22:13:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:52,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:52,381 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:52,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2050718535, now seen corresponding path program 10 times [2021-11-02 22:13:52,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:52,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365370140] [2021-11-02 22:13:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:52,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:52,432 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:52,441 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1851350261, now seen corresponding path program 16 times [2021-11-02 22:13:52,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:52,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456965886] [2021-11-02 22:13:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:52,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:52,470 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:52,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:52,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:52,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2021-11-02 22:13:55,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:55,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:55,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:55,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:55,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:55,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 52 [2021-11-02 22:13:55,582 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:13:55,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:13:55,583 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:13:55,583 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:13:55,583 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:13:55,583 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:55,583 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:13:55,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:13:55,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration13_Lasso [2021-11-02 22:13:55,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:13:55,584 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:13:55,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:55,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:56,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:56,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:13:56,476 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:13:56,477 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:13:56,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,483 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-11-02 22:13:56,485 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 [2021-11-02 22:13:56,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:56,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:56,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:56,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-11-02 22:13:56,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,516 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-11-02 22:13:56,517 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 [2021-11-02 22:13:56,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:56,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:56,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:56,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,551 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-11-02 22:13:56,553 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 [2021-11-02 22:13:56,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:56,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:56,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-11-02 22:13:56,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,588 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-11-02 22:13:56,589 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 [2021-11-02 22:13:56,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:56,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:56,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:56,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-11-02 22:13:56,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,625 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-11-02 22:13:56,627 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 [2021-11-02 22:13:56,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:56,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:56,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:56,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-11-02 22:13:56,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,659 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-11-02 22:13:56,660 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 [2021-11-02 22:13:56,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:56,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:56,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:56,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-11-02 22:13:56,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,694 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-11-02 22:13:56,696 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 [2021-11-02 22:13:56,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:13:56,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:13:56,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:13:56,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-11-02 22:13:56,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,730 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-11-02 22:13:56,731 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 [2021-11-02 22:13:56,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:56,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:56,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:56,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,769 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-11-02 22:13:56,771 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 [2021-11-02 22:13:56,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:56,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:56,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:13:56,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-11-02 22:13:56,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,812 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-11-02 22:13:56,813 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 [2021-11-02 22:13:56,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:13:56,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:13:56,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:13:56,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:13:56,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:13:56,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:13:56,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:13:56,928 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-11-02 22:13:56,928 INFO L444 ModelExtractionUtils]: 2 out of 40 variables were initially zero. Simplification set additionally 35 variables to zero. [2021-11-02 22:13:56,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:13:56,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:56,929 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:13:56,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-11-02 22:13:56,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:13:56,938 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:13:56,938 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:13:56,939 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0.base)_4, ULTIMATE.start_main_~i~1) = 7*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_4 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2021-11-02 22:13:56,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:57,036 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2021-11-02 22:13:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:57,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:13:57,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:57,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 22:13:57,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:57,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:13:57,642 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2021-11-02 22:13:57,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 79 transitions. cyclomatic complexity: 8 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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) [2021-11-02 22:13:57,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 79 transitions. cyclomatic complexity: 8. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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 156 states and 169 transitions. Complement of second has 21 states. [2021-11-02 22:13:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2021-11-02 22:13:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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) [2021-11-02 22:13:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2021-11-02 22:13:57,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 40 letters. Loop has 15 letters. [2021-11-02 22:13:57,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:57,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 55 letters. Loop has 15 letters. [2021-11-02 22:13:57,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:57,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 40 letters. Loop has 30 letters. [2021-11-02 22:13:57,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:13:57,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 169 transitions. [2021-11-02 22:13:57,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-02 22:13:57,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 106 states and 116 transitions. [2021-11-02 22:13:57,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-11-02 22:13:57,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-11-02 22:13:57,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 116 transitions. [2021-11-02 22:13:57,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:13:57,844 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-02 22:13:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 116 transitions. [2021-11-02 22:13:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2021-11-02 22:13:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 93 states have internal predecessors, (103), 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) [2021-11-02 22:13:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-02 22:13:57,850 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-02 22:13:57,850 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-02 22:13:57,850 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-02 22:13:57,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 103 transitions. [2021-11-02 22:13:57,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-02 22:13:57,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:13:57,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:13:57,853 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 3, 1, 1] [2021-11-02 22:13:57,853 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1, 1] [2021-11-02 22:13:57,854 INFO L791 eck$LassoCheckResult]: Stem: 3367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3368#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 3380#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3385#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3397#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3396#L17-3 assume !(foo_~i~0 <= foo_~size); 3387#L17-4 foo_#res := foo_~i~0; 3381#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3382#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3429#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3428#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3427#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3426#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3425#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3424#L17-3 assume !(foo_~i~0 <= foo_~size); 3423#L17-4 foo_#res := foo_~i~0; 3422#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3374#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3375#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3386#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3443#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3444#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3445#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3378#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3379#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3441#L17-3 assume !(foo_~i~0 <= foo_~size); 3442#L17-4 foo_#res := foo_~i~0; 3456#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3421#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3417#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3414#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3413#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3412#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3411#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3410#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3409#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3408#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3407#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3398#L17-3 assume !(foo_~i~0 <= foo_~size); 3399#L17-4 foo_#res := foo_~i~0; 3393#L20 [2021-11-02 22:13:57,854 INFO L793 eck$LassoCheckResult]: Loop: 3393#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3372#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3373#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3389#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3363#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3364#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3377#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3406#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3405#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3404#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3403#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3402#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3401#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3400#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3392#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3390#L17-3 assume !(foo_~i~0 <= foo_~size); 3391#L17-4 foo_#res := foo_~i~0; 3393#L20 [2021-11-02 22:13:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1211447109, now seen corresponding path program 17 times [2021-11-02 22:13:57,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:57,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036789682] [2021-11-02 22:13:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:57,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:57,877 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:57,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 649532987, now seen corresponding path program 11 times [2021-11-02 22:13:57,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:57,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850587961] [2021-11-02 22:13:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:57,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:57,913 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:13:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:13:57,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:13:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1031196535, now seen corresponding path program 18 times [2021-11-02 22:13:57,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:13:57,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488110825] [2021-11-02 22:13:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:13:57,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:13:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:13:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 55 proven. 277 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-02 22:13:58,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:13:58,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488110825] [2021-11-02 22:13:58,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488110825] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:58,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689474883] [2021-11-02 22:13:58,068 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-02 22:13:58,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:13:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:13:58,070 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:13:58,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-11-02 22:13:58,303 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-11-02 22:13:58,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:13:58,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 22:13:58,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 64 proven. 268 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-02 22:13:58,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689474883] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:13:58,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:13:58,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2021-11-02 22:13:58,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657274871] [2021-11-02 22:13:59,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:59,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:59,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:59,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:13:59,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 68 [2021-11-02 22:13:59,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:13:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-02 22:13:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-11-02 22:13:59,278 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. cyclomatic complexity: 13 Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2021-11-02 22:14:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:14:00,010 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2021-11-02 22:14:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-02 22:14:00,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 227 transitions. [2021-11-02 22:14:00,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2021-11-02 22:14:00,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 197 states and 213 transitions. [2021-11-02 22:14:00,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2021-11-02 22:14:00,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2021-11-02 22:14:00,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 213 transitions. [2021-11-02 22:14:00,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:00,017 INFO L681 BuchiCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-11-02 22:14:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 213 transitions. [2021-11-02 22:14:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2021-11-02 22:14:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.089430894308943) internal successors, (134), 122 states have internal predecessors, (134), 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) [2021-11-02 22:14:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2021-11-02 22:14:00,024 INFO L704 BuchiCegarLoop]: Abstraction has 123 states and 134 transitions. [2021-11-02 22:14:00,025 INFO L587 BuchiCegarLoop]: Abstraction has 123 states and 134 transitions. [2021-11-02 22:14:00,025 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-02 22:14:00,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 134 transitions. [2021-11-02 22:14:00,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-02 22:14:00,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:00,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:00,029 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 5, 5, 5, 4, 4, 1, 1] [2021-11-02 22:14:00,029 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1, 1] [2021-11-02 22:14:00,029 INFO L791 eck$LassoCheckResult]: Stem: 3939#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3940#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 3949#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3965#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3966#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3961#L17-3 assume !(foo_~i~0 <= foo_~size); 3962#L17-4 foo_#res := foo_~i~0; 3954#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3955#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4016#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4017#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4011#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4012#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4007#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4008#L17-3 assume !(foo_~i~0 <= foo_~size); 4003#L17-4 foo_#res := foo_~i~0; 4004#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3946#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3947#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4018#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4015#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4013#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4014#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4009#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4010#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4005#L17-3 assume !(foo_~i~0 <= foo_~size); 4006#L17-4 foo_#res := foo_~i~0; 4001#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4002#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3953#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3951#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3952#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4043#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4042#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4041#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4040#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4039#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4038#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4037#L17-3 assume !(foo_~i~0 <= foo_~size); 4035#L17-4 foo_#res := foo_~i~0; 4036#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4057#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4056#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3988#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3989#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3984#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3985#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3980#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3981#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4048#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4049#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4044#L17-3 assume !(foo_~i~0 <= foo_~size); 4021#L17-4 foo_#res := foo_~i~0; 3959#L20 [2021-11-02 22:14:00,030 INFO L793 eck$LassoCheckResult]: Loop: 3959#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3944#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3945#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3950#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3935#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3936#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3974#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3973#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3972#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3971#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3970#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3969#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3968#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3967#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3963#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3964#L17-3 assume !(foo_~i~0 <= foo_~size); 3958#L17-4 foo_#res := foo_~i~0; 3959#L20 [2021-11-02 22:14:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 819802611, now seen corresponding path program 19 times [2021-11-02 22:14:00,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:00,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201237431] [2021-11-02 22:14:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:00,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 92 proven. 172 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-02 22:14:00,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:14:00,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201237431] [2021-11-02 22:14:00,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201237431] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:00,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959272166] [2021-11-02 22:14:00,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-02 22:14:00,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:14:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:00,192 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:14:00,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-11-02 22:14:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:00,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-02 22:14:00,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 138 proven. 126 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-02 22:14:00,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959272166] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:00,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:14:00,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2021-11-02 22:14:00,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651514721] [2021-11-02 22:14:00,818 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:14:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 649532987, now seen corresponding path program 12 times [2021-11-02 22:14:00,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:00,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642613752] [2021-11-02 22:14:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:00,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:00,828 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:00,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:01,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:01,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2021-11-02 22:14:01,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:14:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 22:14:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-02 22:14:01,518 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. cyclomatic complexity: 15 Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 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) [2021-11-02 22:14:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:14:01,888 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2021-11-02 22:14:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 22:14:01,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 142 transitions. [2021-11-02 22:14:01,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-02 22:14:01,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 105 states and 110 transitions. [2021-11-02 22:14:01,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-02 22:14:01,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-02 22:14:01,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 110 transitions. [2021-11-02 22:14:01,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:01,894 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-11-02 22:14:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 110 transitions. [2021-11-02 22:14:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2021-11-02 22:14:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.053763440860215) internal successors, (98), 92 states have internal predecessors, (98), 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) [2021-11-02 22:14:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-11-02 22:14:01,899 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-11-02 22:14:01,899 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-11-02 22:14:01,899 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-02 22:14:01,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 98 transitions. [2021-11-02 22:14:01,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-02 22:14:01,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:01,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:01,903 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 5, 5, 5, 4, 4, 1, 1] [2021-11-02 22:14:01,904 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1, 1] [2021-11-02 22:14:01,904 INFO L791 eck$LassoCheckResult]: Stem: 4409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4410#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 4418#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4419#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4435#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4433#L17-3 assume !(foo_~i~0 <= foo_~size); 4428#L17-4 foo_#res := foo_~i~0; 4420#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4421#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4494#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4493#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4492#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4490#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4488#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4462#L17-3 assume !(foo_~i~0 <= foo_~size); 4463#L17-4 foo_#res := foo_~i~0; 4422#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4413#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4414#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4417#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4404#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4405#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4491#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4489#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4466#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4467#L17-3 assume !(foo_~i~0 <= foo_~size); 4459#L17-4 foo_#res := foo_~i~0; 4460#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4482#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4481#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4479#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4477#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4476#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4475#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4474#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4473#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4468#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4469#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4461#L17-3 assume !(foo_~i~0 <= foo_~size); 4425#L17-4 foo_#res := foo_~i~0; 4426#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4458#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4457#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4456#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4455#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4453#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4454#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4450#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4449#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4447#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4448#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4472#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4471#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4434#L17-3 assume !(foo_~i~0 <= foo_~size); 4429#L17-4 foo_#res := foo_~i~0; 4424#L20 [2021-11-02 22:14:01,905 INFO L793 eck$LassoCheckResult]: Loop: 4424#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4411#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4412#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4427#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4402#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4403#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4416#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4442#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4441#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4440#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4439#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4438#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4437#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4436#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4432#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4431#L17-3 assume !(foo_~i~0 <= foo_~size); 4423#L17-4 foo_#res := foo_~i~0; 4424#L20 [2021-11-02 22:14:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1851350261, now seen corresponding path program 20 times [2021-11-02 22:14:01,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:01,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295206174] [2021-11-02 22:14:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:01,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:01,940 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:01,978 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 649532987, now seen corresponding path program 13 times [2021-11-02 22:14:01,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:01,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613125513] [2021-11-02 22:14:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:01,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:01,990 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:02,001 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash -573784121, now seen corresponding path program 21 times [2021-11-02 22:14:02,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:02,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827826135] [2021-11-02 22:14:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:02,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:02,038 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:02,082 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:02,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:02,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 85 [2021-11-02 22:14:07,987 WARN L207 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 437 DAG size of output: 296 [2021-11-02 22:14:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:08,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2021-11-02 22:14:08,443 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:14:08,443 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:14:08,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:14:08,443 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:14:08,443 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:14:08,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:08,444 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:14:08,444 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:14:08,444 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration16_Lasso [2021-11-02 22:14:08,444 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:14:08,444 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:14:08,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:08,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:08,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:08,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:08,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:09,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:09,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:09,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:09,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:09,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:09,546 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:14:09,546 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:14:09,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,548 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-11-02 22:14:09,549 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 [2021-11-02 22:14:09,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:14:09,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:14:09,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:14:09,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:09,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-11-02 22:14:09,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,583 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-11-02 22:14:09,584 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 [2021-11-02 22:14:09,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:09,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:09,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:09,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-11-02 22:14:09,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,643 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-11-02 22:14:09,655 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 [2021-11-02 22:14:09,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:14:09,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:14:09,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:14:09,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:09,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-11-02 22:14:09,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,688 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-11-02 22:14:09,689 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 [2021-11-02 22:14:09,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:14:09,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:14:09,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:14:09,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:09,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-11-02 22:14:09,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,723 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-11-02 22:14:09,724 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 [2021-11-02 22:14:09,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:09,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:09,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:09,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-11-02 22:14:09,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,765 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-11-02 22:14:09,766 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 [2021-11-02 22:14:09,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:09,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:09,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:09,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-11-02 22:14:09,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,806 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-11-02 22:14:09,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 [2021-11-02 22:14:09,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:09,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:09,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:09,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:09,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:09,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:09,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:14:09,934 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-11-02 22:14:09,934 INFO L444 ModelExtractionUtils]: 2 out of 40 variables were initially zero. Simplification set additionally 35 variables to zero. [2021-11-02 22:14:09,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:09,940 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:09,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:14:09,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-11-02 22:14:09,972 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:14:09,972 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:14:09,972 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 9 Supporting invariants [] [2021-11-02 22:14:10,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-11-02 22:14:10,158 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2021-11-02 22:14:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:10,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:14:10,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:10,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-02 22:14:10,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:14:10,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2021-11-02 22:14:10,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 98 transitions. cyclomatic complexity: 8 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-11-02 22:14:10,960 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 98 transitions. cyclomatic complexity: 8. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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 193 states and 206 transitions. Complement of second has 21 states. [2021-11-02 22:14:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2021-11-02 22:14:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-11-02 22:14:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2021-11-02 22:14:10,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 55 letters. Loop has 17 letters. [2021-11-02 22:14:10,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:14:10,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 72 letters. Loop has 17 letters. [2021-11-02 22:14:10,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:14:10,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 55 letters. Loop has 34 letters. [2021-11-02 22:14:10,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:14:10,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 206 transitions. [2021-11-02 22:14:10,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-11-02 22:14:10,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 127 states and 137 transitions. [2021-11-02 22:14:10,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-02 22:14:10,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-11-02 22:14:10,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 137 transitions. [2021-11-02 22:14:10,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:10,966 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-11-02 22:14:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 137 transitions. [2021-11-02 22:14:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2021-11-02 22:14:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.0782608695652174) internal successors, (124), 114 states have internal predecessors, (124), 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) [2021-11-02 22:14:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2021-11-02 22:14:10,971 INFO L704 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-11-02 22:14:10,971 INFO L587 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-11-02 22:14:10,971 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-02 22:14:10,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 124 transitions. [2021-11-02 22:14:10,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-11-02 22:14:10,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:10,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:10,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 5, 5, 5, 4, 4, 1, 1] [2021-11-02 22:14:10,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 1, 1, 1, 1, 1] [2021-11-02 22:14:10,974 INFO L791 eck$LassoCheckResult]: Stem: 5097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5098#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 5107#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5110#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5124#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5120#L17-3 assume !(foo_~i~0 <= foo_~size); 5121#L17-4 foo_#res := foo_~i~0; 5112#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5113#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5178#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5175#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5174#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5173#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5172#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5171#L17-3 assume !(foo_~i~0 <= foo_~size); 5170#L17-4 foo_#res := foo_~i~0; 5168#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5169#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5180#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5179#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5176#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5177#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5186#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5185#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5184#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5183#L17-3 assume !(foo_~i~0 <= foo_~size); 5182#L17-4 foo_#res := foo_~i~0; 5181#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5104#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5105#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5111#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5193#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5191#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5192#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5194#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5095#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5096#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5109#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5187#L17-3 assume !(foo_~i~0 <= foo_~size); 5188#L17-4 foo_#res := foo_~i~0; 5207#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5154#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5150#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5147#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5146#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5145#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5144#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5143#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5142#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5141#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5140#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5139#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5138#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5136#L17-3 assume !(foo_~i~0 <= foo_~size); 5137#L17-4 foo_#res := foo_~i~0; 5117#L20 [2021-11-02 22:14:10,975 INFO L793 eck$LassoCheckResult]: Loop: 5117#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5102#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5103#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5119#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5093#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5094#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5108#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5135#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5134#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5133#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5132#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5131#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5130#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5129#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5128#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5127#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5122#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5123#L17-3 assume !(foo_~i~0 <= foo_~size); 5116#L17-4 foo_#res := foo_~i~0; 5117#L20 [2021-11-02 22:14:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1851350261, now seen corresponding path program 22 times [2021-11-02 22:14:10,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:10,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890448582] [2021-11-02 22:14:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:10,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:11,003 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:11,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1430998845, now seen corresponding path program 14 times [2021-11-02 22:14:11,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:11,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405217357] [2021-11-02 22:14:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:11,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:11,095 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:11,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1650670135, now seen corresponding path program 23 times [2021-11-02 22:14:11,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:11,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424361609] [2021-11-02 22:14:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:11,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:11,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-11-02 22:14:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 78 proven. 526 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-02 22:14:11,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:14:11,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424361609] [2021-11-02 22:14:11,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424361609] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:11,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020024774] [2021-11-02 22:14:11,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-02 22:14:11,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:14:11,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:11,331 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:14:11,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2021-11-02 22:14:11,713 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-11-02 22:14:11,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:14:11,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-02 22:14:11,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 89 proven. 515 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-02 22:14:12,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020024774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:12,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:14:12,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2021-11-02 22:14:12,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144884536] [2021-11-02 22:14:12,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:12,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 94 [2021-11-02 22:14:13,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:14:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-02 22:14:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2021-11-02 22:14:13,019 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. cyclomatic complexity: 13 Second operand has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 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) [2021-11-02 22:14:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:14:13,949 INFO L93 Difference]: Finished difference Result 247 states and 263 transitions. [2021-11-02 22:14:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-02 22:14:13,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 263 transitions. [2021-11-02 22:14:13,952 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2021-11-02 22:14:13,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 231 states and 247 transitions. [2021-11-02 22:14:13,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2021-11-02 22:14:13,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2021-11-02 22:14:13,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 247 transitions. [2021-11-02 22:14:13,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:13,956 INFO L681 BuchiCegarLoop]: Abstraction has 231 states and 247 transitions. [2021-11-02 22:14:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 247 transitions. [2021-11-02 22:14:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 148. [2021-11-02 22:14:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.0743243243243243) internal successors, (159), 147 states have internal predecessors, (159), 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) [2021-11-02 22:14:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2021-11-02 22:14:13,962 INFO L704 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2021-11-02 22:14:13,962 INFO L587 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2021-11-02 22:14:13,962 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-02 22:14:13,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 159 transitions. [2021-11-02 22:14:13,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-11-02 22:14:13,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:13,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:13,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 20, 6, 6, 6, 5, 5, 1, 1] [2021-11-02 22:14:13,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 1, 1, 1, 1, 1] [2021-11-02 22:14:13,966 INFO L791 eck$LassoCheckResult]: Stem: 5806#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5807#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 5815#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5830#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5831#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5826#L17-3 assume !(foo_~i~0 <= foo_~size); 5827#L17-4 foo_#res := foo_~i~0; 5816#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5817#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5820#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5821#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5801#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5802#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5814#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5899#L17-3 assume !(foo_~i~0 <= foo_~size); 5900#L17-4 foo_#res := foo_~i~0; 5818#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5810#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5811#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5946#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5945#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5944#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5943#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5942#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5941#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5940#L17-3 assume !(foo_~i~0 <= foo_~size); 5896#L17-4 foo_#res := foo_~i~0; 5897#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5939#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5938#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5937#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5936#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5935#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5934#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5933#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5932#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5931#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5929#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5925#L17-3 assume !(foo_~i~0 <= foo_~size); 5924#L17-4 foo_#res := foo_~i~0; 5923#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5922#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5921#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5920#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5919#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5918#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5917#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5916#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5915#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5914#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5913#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5901#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5902#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5912#L17-3 assume !(foo_~i~0 <= foo_~size); 5908#L17-4 foo_#res := foo_~i~0; 5907#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5906#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5905#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5863#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5864#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5859#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5860#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5855#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5856#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5851#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5852#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5847#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5848#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5842#L17-3 assume !(foo_~i~0 <= foo_~size); 5843#L17-4 foo_#res := foo_~i~0; 5823#L20 [2021-11-02 22:14:13,966 INFO L793 eck$LassoCheckResult]: Loop: 5823#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5808#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5809#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5819#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5799#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5800#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5813#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5840#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5839#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5838#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5837#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5836#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5835#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5834#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5833#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5832#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5828#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5829#L17-3 assume !(foo_~i~0 <= foo_~size); 5822#L17-4 foo_#res := foo_~i~0; 5823#L20 [2021-11-02 22:14:13,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -451993275, now seen corresponding path program 24 times [2021-11-02 22:14:13,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:13,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510329622] [2021-11-02 22:14:13,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:13,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 223 proven. 287 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-02 22:14:14,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:14:14,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510329622] [2021-11-02 22:14:14,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510329622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:14,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36820694] [2021-11-02 22:14:14,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-02 22:14:14,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:14:14,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:14,154 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:14:14,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-11-02 22:14:14,725 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2021-11-02 22:14:14,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:14:14,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-02 22:14:14,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 306 proven. 95 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-11-02 22:14:15,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36820694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:15,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:14:15,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2021-11-02 22:14:15,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929391273] [2021-11-02 22:14:15,192 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:14:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1430998845, now seen corresponding path program 15 times [2021-11-02 22:14:15,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:15,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069578881] [2021-11-02 22:14:15,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:15,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:15,209 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:15,220 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:16,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:16,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 85 [2021-11-02 22:14:16,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:14:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-02 22:14:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2021-11-02 22:14:16,216 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. cyclomatic complexity: 15 Second operand has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 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) [2021-11-02 22:14:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:14:17,181 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2021-11-02 22:14:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-02 22:14:17,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 170 transitions. [2021-11-02 22:14:17,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-11-02 22:14:17,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 129 states and 134 transitions. [2021-11-02 22:14:17,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-11-02 22:14:17,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2021-11-02 22:14:17,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 134 transitions. [2021-11-02 22:14:17,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:17,185 INFO L681 BuchiCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-11-02 22:14:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 134 transitions. [2021-11-02 22:14:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2021-11-02 22:14:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.043859649122807) internal successors, (119), 113 states have internal predecessors, (119), 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) [2021-11-02 22:14:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2021-11-02 22:14:17,189 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-11-02 22:14:17,190 INFO L587 BuchiCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-11-02 22:14:17,190 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-02 22:14:17,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 119 transitions. [2021-11-02 22:14:17,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-11-02 22:14:17,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:17,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:17,192 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 6, 6, 6, 5, 5, 1, 1] [2021-11-02 22:14:17,193 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 1, 1, 1, 1, 1] [2021-11-02 22:14:17,193 INFO L791 eck$LassoCheckResult]: Stem: 6415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6416#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 6424#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6425#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6442#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6440#L17-3 assume !(foo_~i~0 <= foo_~size); 6435#L17-4 foo_#res := foo_~i~0; 6427#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6419#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6420#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6517#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6516#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6515#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6514#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6513#L17-3 assume !(foo_~i~0 <= foo_~size); 6512#L17-4 foo_#res := foo_~i~0; 6428#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6429#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6426#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6423#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6410#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6411#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6521#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6520#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6519#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6518#L17-3 assume !(foo_~i~0 <= foo_~size); 6432#L17-4 foo_#res := foo_~i~0; 6433#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6511#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6510#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6509#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6508#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6507#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6506#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6505#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6504#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6503#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6502#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6501#L17-3 assume !(foo_~i~0 <= foo_~size); 6500#L17-4 foo_#res := foo_~i~0; 6499#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6498#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6497#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6496#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6495#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6494#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6493#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6492#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6491#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6490#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6489#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6472#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6473#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6468#L17-3 assume !(foo_~i~0 <= foo_~size); 6469#L17-4 foo_#res := foo_~i~0; 6488#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6487#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6486#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6485#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6484#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6483#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6482#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6481#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6480#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6479#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6478#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6477#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6476#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6475#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6474#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6441#L17-3 assume !(foo_~i~0 <= foo_~size); 6436#L17-4 foo_#res := foo_~i~0; 6431#L20 [2021-11-02 22:14:17,193 INFO L793 eck$LassoCheckResult]: Loop: 6431#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6417#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6418#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6434#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6408#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6409#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6422#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6451#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6450#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6449#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6448#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6447#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6446#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6445#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6444#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6443#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6439#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6438#L17-3 assume !(foo_~i~0 <= foo_~size); 6430#L17-4 foo_#res := foo_~i~0; 6431#L20 [2021-11-02 22:14:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash -573784121, now seen corresponding path program 25 times [2021-11-02 22:14:17,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:17,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140173305] [2021-11-02 22:14:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:17,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:17,231 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:17,276 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1430998845, now seen corresponding path program 16 times [2021-11-02 22:14:17,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:17,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312102507] [2021-11-02 22:14:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:17,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:17,288 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:17,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash 303824311, now seen corresponding path program 26 times [2021-11-02 22:14:17,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:17,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222927954] [2021-11-02 22:14:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:17,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:17,345 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:17,407 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:18,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:18,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 94 [2021-11-02 22:14:32,233 WARN L207 SmtUtils]: Spent 13.81 s on a formula simplification. DAG size of input: 560 DAG size of output: 373 [2021-11-02 22:14:32,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:32,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 77 [2021-11-02 22:14:32,750 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:14:32,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:14:32,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:14:32,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:14:32,750 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:14:32,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:32,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:14:32,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:14:32,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration19_Lasso [2021-11-02 22:14:32,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:14:32,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:14:32,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:32,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:32,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:32,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:33,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:33,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:33,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:33,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:33,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:33,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:14:34,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:14:34,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:14:34,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,308 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,309 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 [2021-11-02 22:14:34,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-11-02 22:14:34,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:14:34,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:14:34,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:14:34,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-11-02 22:14:34,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,345 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-11-02 22:14:34,347 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 [2021-11-02 22:14:34,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-11-02 22:14:34,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,396 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-11-02 22:14:34,397 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 [2021-11-02 22:14:34,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:14:34,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:14:34,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:14:34,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-11-02 22:14:34,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,433 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-11-02 22:14:34,435 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 [2021-11-02 22:14:34,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-11-02 22:14:34,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,472 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-11-02 22:14:34,473 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 [2021-11-02 22:14:34,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-11-02 22:14:34,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,511 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-11-02 22:14:34,512 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 [2021-11-02 22:14:34,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-11-02 22:14:34,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,551 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-11-02 22:14:34,553 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 [2021-11-02 22:14:34,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2021-11-02 22:14:34,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,591 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-11-02 22:14:34,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 [2021-11-02 22:14:34,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-11-02 22:14:34,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,645 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-11-02 22:14:34,648 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 [2021-11-02 22:14:34,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-11-02 22:14:34,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,698 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-11-02 22:14:34,700 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 [2021-11-02 22:14:34,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:14:34,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:14:34,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:14:34,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:14:34,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-11-02 22:14:34,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,759 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,766 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 [2021-11-02 22:14:34,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-11-02 22:14:34,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:14:34,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:14:34,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:14:34,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:14:34,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:14:34,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:14:34,810 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:14:34,843 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-11-02 22:14:34,843 INFO L444 ModelExtractionUtils]: 18 out of 40 variables were initially zero. Simplification set additionally 19 variables to zero. [2021-11-02 22:14:34,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:14:34,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:34,844 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:14:34,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-11-02 22:14:34,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:14:34,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:14:34,855 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:14:34,855 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 11 Supporting invariants [] [2021-11-02 22:14:34,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-11-02 22:14:35,148 INFO L297 tatePredicateManager]: 54 out of 54 supporting invariants were superfluous and have been removed [2021-11-02 22:14:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:35,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:14:35,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:35,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 22:14:35,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:14:35,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2021-11-02 22:14:35,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 119 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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) [2021-11-02 22:14:36,099 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 119 transitions. cyclomatic complexity: 8. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 234 states and 247 transitions. Complement of second has 23 states. [2021-11-02 22:14:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2021-11-02 22:14:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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) [2021-11-02 22:14:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2021-11-02 22:14:36,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 72 letters. Loop has 19 letters. [2021-11-02 22:14:36,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:14:36,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 91 letters. Loop has 19 letters. [2021-11-02 22:14:36,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:14:36,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 72 letters. Loop has 38 letters. [2021-11-02 22:14:36,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:14:36,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 247 transitions. [2021-11-02 22:14:36,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2021-11-02 22:14:36,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 150 states and 160 transitions. [2021-11-02 22:14:36,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-02 22:14:36,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-11-02 22:14:36,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 160 transitions. [2021-11-02 22:14:36,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:36,119 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2021-11-02 22:14:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 160 transitions. [2021-11-02 22:14:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2021-11-02 22:14:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.065217391304348) internal successors, (147), 137 states have internal predecessors, (147), 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) [2021-11-02 22:14:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2021-11-02 22:14:36,123 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 147 transitions. [2021-11-02 22:14:36,124 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 147 transitions. [2021-11-02 22:14:36,124 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-11-02 22:14:36,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 147 transitions. [2021-11-02 22:14:36,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-11-02 22:14:36,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:36,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:36,126 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 6, 6, 6, 5, 5, 1, 1] [2021-11-02 22:14:36,126 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 1, 1, 1, 1, 1] [2021-11-02 22:14:36,126 INFO L791 eck$LassoCheckResult]: Stem: 7309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7310#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 7319#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7323#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7335#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7328#L17-3 assume !(foo_~i~0 <= foo_~size); 7325#L17-4 foo_#res := foo_~i~0; 7320#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7321#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7398#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7399#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7417#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7415#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7413#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7411#L17-3 assume !(foo_~i~0 <= foo_~size); 7409#L17-4 foo_#res := foo_~i~0; 7407#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7405#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7402#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7403#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7421#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7420#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7419#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7418#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7416#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7414#L17-3 assume !(foo_~i~0 <= foo_~size); 7412#L17-4 foo_#res := foo_~i~0; 7410#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7408#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7406#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7404#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7401#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7400#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7397#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7396#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7395#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7394#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7393#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7388#L17-3 assume !(foo_~i~0 <= foo_~size); 7326#L17-4 foo_#res := foo_~i~0; 7322#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7313#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7314#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7324#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7304#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7305#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7429#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7428#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7426#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7425#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7423#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7317#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7318#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7389#L17-3 assume !(foo_~i~0 <= foo_~size); 7390#L17-4 foo_#res := foo_~i~0; 7439#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7438#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7437#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7436#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7435#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7434#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7433#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7432#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7431#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7430#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7354#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7355#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7427#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7350#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7349#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7336#L17-3 assume !(foo_~i~0 <= foo_~size); 7337#L17-4 foo_#res := foo_~i~0; 7329#L20 [2021-11-02 22:14:36,127 INFO L793 eck$LassoCheckResult]: Loop: 7329#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7311#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7312#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7327#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7302#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7303#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7316#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7348#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7347#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7346#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7345#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7344#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7343#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7342#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7341#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7340#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7339#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7338#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7333#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7334#L17-3 assume !(foo_~i~0 <= foo_~size); 7332#L17-4 foo_#res := foo_~i~0; 7329#L20 [2021-11-02 22:14:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash -573784121, now seen corresponding path program 27 times [2021-11-02 22:14:36,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:36,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307990725] [2021-11-02 22:14:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:36,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:36,216 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:36,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-11-02 22:14:36,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 800411583, now seen corresponding path program 17 times [2021-11-02 22:14:36,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:36,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229593261] [2021-11-02 22:14:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:36,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:36,294 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:36,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash -82556999, now seen corresponding path program 28 times [2021-11-02 22:14:36,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:36,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560028560] [2021-11-02 22:14:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:36,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 105 proven. 912 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-02 22:14:36,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:14:36,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560028560] [2021-11-02 22:14:36,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560028560] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:36,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325066627] [2021-11-02 22:14:36,631 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-02 22:14:36,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:14:36,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:36,662 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:14:36,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2021-11-02 22:14:37,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-02 22:14:37,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:14:37,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-02 22:14:37,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 118 proven. 899 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-02 22:14:37,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325066627] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:37,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:14:37,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2021-11-02 22:14:37,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542010374] [2021-11-02 22:14:39,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:39,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 108 [2021-11-02 22:14:39,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:14:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-02 22:14:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-11-02 22:14:39,250 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. cyclomatic complexity: 13 Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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) [2021-11-02 22:14:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:14:40,674 INFO L93 Difference]: Finished difference Result 285 states and 301 transitions. [2021-11-02 22:14:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-02 22:14:40,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 301 transitions. [2021-11-02 22:14:40,677 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2021-11-02 22:14:40,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 267 states and 283 transitions. [2021-11-02 22:14:40,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2021-11-02 22:14:40,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2021-11-02 22:14:40,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 283 transitions. [2021-11-02 22:14:40,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:40,681 INFO L681 BuchiCegarLoop]: Abstraction has 267 states and 283 transitions. [2021-11-02 22:14:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 283 transitions. [2021-11-02 22:14:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 175. [2021-11-02 22:14:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.062857142857143) internal successors, (186), 174 states have internal predecessors, (186), 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) [2021-11-02 22:14:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-11-02 22:14:40,688 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-11-02 22:14:40,688 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-11-02 22:14:40,688 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-11-02 22:14:40,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 186 transitions. [2021-11-02 22:14:40,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-11-02 22:14:40,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:40,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:40,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [27, 27, 7, 7, 7, 6, 6, 1, 1] [2021-11-02 22:14:40,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 1, 1, 1, 1, 1] [2021-11-02 22:14:40,692 INFO L791 eck$LassoCheckResult]: Stem: 8156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8157#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 8166#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8181#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8182#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8177#L17-3 assume !(foo_~i~0 <= foo_~size); 8178#L17-4 foo_#res := foo_~i~0; 8171#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8163#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8164#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8322#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8320#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8318#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8316#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8314#L17-3 assume !(foo_~i~0 <= foo_~size); 8312#L17-4 foo_#res := foo_~i~0; 8172#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8173#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8169#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8170#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8324#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8323#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8321#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8319#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8317#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8315#L17-3 assume !(foo_~i~0 <= foo_~size); 8313#L17-4 foo_#res := foo_~i~0; 8311#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8310#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8309#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8308#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8307#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8306#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8305#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8304#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8303#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8302#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8301#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8300#L17-3 assume !(foo_~i~0 <= foo_~size); 8299#L17-4 foo_#res := foo_~i~0; 8298#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8297#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8296#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8295#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8294#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8293#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8292#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8291#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8290#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8289#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8287#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8284#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8282#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8280#L17-3 assume !(foo_~i~0 <= foo_~size); 8278#L17-4 foo_#res := foo_~i~0; 8277#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8276#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8275#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8274#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8273#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8272#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8271#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8270#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8269#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8268#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8265#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8264#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8263#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8259#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8260#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8288#L17-3 assume !(foo_~i~0 <= foo_~size); 8285#L17-4 foo_#res := foo_~i~0; 8283#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8281#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8279#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8221#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8222#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8217#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8218#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8213#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8214#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8209#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8210#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8205#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8206#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8267#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8266#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8196#L17-3 assume !(foo_~i~0 <= foo_~size); 8197#L17-4 foo_#res := foo_~i~0; 8175#L20 [2021-11-02 22:14:40,693 INFO L793 eck$LassoCheckResult]: Loop: 8175#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8161#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8162#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8167#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8152#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8153#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8194#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8193#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8192#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8191#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8190#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8189#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8188#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8187#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8186#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8185#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8184#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8183#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8179#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8180#L17-3 assume !(foo_~i~0 <= foo_~size); 8174#L17-4 foo_#res := foo_~i~0; 8175#L20 [2021-11-02 22:14:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash -84600011, now seen corresponding path program 29 times [2021-11-02 22:14:40,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:40,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636282929] [2021-11-02 22:14:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:40,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:14:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 451 proven. 442 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-02 22:14:40,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:14:40,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636282929] [2021-11-02 22:14:40,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636282929] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:40,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968233818] [2021-11-02 22:14:40,955 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-02 22:14:40,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:14:40,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:14:40,959 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:14:40,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2021-11-02 22:14:41,508 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-11-02 22:14:41,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:14:41,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-02 22:14:41,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:14:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 500 proven. 396 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-11-02 22:14:42,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968233818] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:14:42,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:14:42,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 26 [2021-11-02 22:14:42,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266810908] [2021-11-02 22:14:42,071 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:14:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 800411583, now seen corresponding path program 18 times [2021-11-02 22:14:42,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:42,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72078485] [2021-11-02 22:14:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:42,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:42,092 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:42,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:43,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:43,217 INFO L244 Elim1Store]: Index analysis took 110 ms [2021-11-02 22:14:43,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 105 [2021-11-02 22:14:43,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:14:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-02 22:14:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-02 22:14:43,415 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. cyclomatic complexity: 15 Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 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) [2021-11-02 22:14:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:14:44,652 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2021-11-02 22:14:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-02 22:14:44,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 200 transitions. [2021-11-02 22:14:44,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-11-02 22:14:44,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 155 states and 160 transitions. [2021-11-02 22:14:44,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-11-02 22:14:44,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-11-02 22:14:44,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 160 transitions. [2021-11-02 22:14:44,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:14:44,679 INFO L681 BuchiCegarLoop]: Abstraction has 155 states and 160 transitions. [2021-11-02 22:14:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 160 transitions. [2021-11-02 22:14:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2021-11-02 22:14:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 136 states have internal predecessors, (142), 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) [2021-11-02 22:14:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2021-11-02 22:14:44,689 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 142 transitions. [2021-11-02 22:14:44,689 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 142 transitions. [2021-11-02 22:14:44,689 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-11-02 22:14:44,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 142 transitions. [2021-11-02 22:14:44,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-11-02 22:14:44,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:14:44,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:14:44,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [28, 28, 7, 7, 7, 6, 6, 1, 1] [2021-11-02 22:14:44,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 1, 1, 1, 1, 1] [2021-11-02 22:14:44,693 INFO L791 eck$LassoCheckResult]: Stem: 8893#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8894#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 8902#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8906#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8920#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8918#L17-3 assume !(foo_~i~0 <= foo_~size); 8913#L17-4 foo_#res := foo_~i~0; 8903#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8897#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8898#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9018#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9017#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9016#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9015#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9014#L17-3 assume !(foo_~i~0 <= foo_~size); 9013#L17-4 foo_#res := foo_~i~0; 8904#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8905#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8907#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8901#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8888#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8889#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9022#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9021#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9020#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9019#L17-3 assume !(foo_~i~0 <= foo_~size); 8910#L17-4 foo_#res := foo_~i~0; 8911#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9012#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9011#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9010#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9009#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9008#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9007#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9006#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9005#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9004#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9003#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9002#L17-3 assume !(foo_~i~0 <= foo_~size); 9001#L17-4 foo_#res := foo_~i~0; 9000#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8999#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8998#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8997#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8996#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8995#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8994#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8993#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8992#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8991#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8990#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8989#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8988#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8987#L17-3 assume !(foo_~i~0 <= foo_~size); 8986#L17-4 foo_#res := foo_~i~0; 8985#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8984#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8983#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8982#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8981#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8980#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8979#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8978#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8977#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8976#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8975#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8974#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8973#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8954#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8955#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8950#L17-3 assume !(foo_~i~0 <= foo_~size); 8951#L17-4 foo_#res := foo_~i~0; 8972#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8971#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8970#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8969#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8968#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8967#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8966#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8965#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8964#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8963#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8962#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8961#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8960#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8959#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8958#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8957#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8956#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8919#L17-3 assume !(foo_~i~0 <= foo_~size); 8914#L17-4 foo_#res := foo_~i~0; 8909#L20 [2021-11-02 22:14:44,693 INFO L793 eck$LassoCheckResult]: Loop: 8909#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8895#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8896#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8912#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8886#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8887#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8900#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8931#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8930#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8929#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8928#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8927#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8926#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8925#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8924#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8923#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8922#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8921#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8917#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8916#L17-3 assume !(foo_~i~0 <= foo_~size); 8908#L17-4 foo_#res := foo_~i~0; 8909#L20 [2021-11-02 22:14:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 303824311, now seen corresponding path program 30 times [2021-11-02 22:14:44,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:44,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883083994] [2021-11-02 22:14:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:44,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:44,747 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:44,821 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash 800411583, now seen corresponding path program 19 times [2021-11-02 22:14:44,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:44,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749220809] [2021-11-02 22:14:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:44,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:44,835 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:44,848 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:14:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -654565431, now seen corresponding path program 31 times [2021-11-02 22:14:44,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:14:44,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991937738] [2021-11-02 22:14:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:14:44,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:14:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:44,912 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:14:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:14:45,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:14:46,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:46,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 90 [2021-11-02 22:15:09,091 WARN L207 SmtUtils]: Spent 22.46 s on a formula simplification. DAG size of input: 697 DAG size of output: 459 [2021-11-02 22:15:09,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:09,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2021-11-02 22:15:10,225 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:15:10,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:15:10,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:15:10,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:15:10,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:15:10,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:10,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:15:10,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:15:10,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration22_Lasso [2021-11-02 22:15:10,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:15:10,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:15:10,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:10,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:10,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:10,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:10,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:12,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:12,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:12,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:12,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:12,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:15:13,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:15:13,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:15:13,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,306 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-11-02 22:15:13,307 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 [2021-11-02 22:15:13,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:15:13,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:15:13,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:15:13,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,344 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-11-02 22:15:13,345 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 [2021-11-02 22:15:13,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,384 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-11-02 22:15:13,386 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 [2021-11-02 22:15:13,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:15:13,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:15:13,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:15:13,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-11-02 22:15:13,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,423 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-11-02 22:15:13,424 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 [2021-11-02 22:15:13,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2021-11-02 22:15:13,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,462 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-11-02 22:15:13,465 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 [2021-11-02 22:15:13,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,506 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-11-02 22:15:13,508 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 [2021-11-02 22:15:13,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,593 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,596 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 [2021-11-02 22:15:13,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-11-02 22:15:13,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,666 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,671 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 [2021-11-02 22:15:13,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:15:13,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:15:13,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:15:13,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-11-02 22:15:13,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,739 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,743 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 [2021-11-02 22:15:13,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-11-02 22:15:13,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,859 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,864 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 [2021-11-02 22:15:13,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:13,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-11-02 22:15:13,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:15:13,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:13,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:13,939 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:13,942 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 [2021-11-02 22:15:13,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:15:13,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:15:13,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:15:13,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:15:13,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-11-02 22:15:13,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:15:13,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:15:14,004 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:15:14,147 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2021-11-02 22:15:14,147 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-11-02 22:15:14,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:15:14,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:14,155 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:15:14,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:15:14,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-11-02 22:15:14,183 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2021-11-02 22:15:14,183 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:15:14,183 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0.base)_7, ULTIMATE.start_foo_#in~size) = 15*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_7 - 8*ULTIMATE.start_foo_#in~size Supporting invariants [-1*ULTIMATE.start_foo_#in~size + 1*ULTIMATE.start_main_~i~1 >= 0, -1*ULTIMATE.start_foo_#in~size + 7 >= 0] [2021-11-02 22:15:14,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:14,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-11-02 22:15:14,881 INFO L297 tatePredicateManager]: 99 out of 100 supporting invariants were superfluous and have been removed [2021-11-02 22:15:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:15:14,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 22:15:14,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:15:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:15:15,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 22:15:15,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:15:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:15:16,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2021-11-02 22:15:16,177 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 142 transitions. cyclomatic complexity: 8 Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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) [2021-11-02 22:15:16,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 142 transitions. cyclomatic complexity: 8. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 279 states and 292 transitions. Complement of second has 28 states. [2021-11-02 22:15:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2021-11-02 22:15:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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) [2021-11-02 22:15:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2021-11-02 22:15:16,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 44 transitions. Stem has 91 letters. Loop has 21 letters. [2021-11-02 22:15:16,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:15:16,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 44 transitions. Stem has 112 letters. Loop has 21 letters. [2021-11-02 22:15:16,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:15:16,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 44 transitions. Stem has 91 letters. Loop has 42 letters. [2021-11-02 22:15:16,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:15:16,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 292 transitions. [2021-11-02 22:15:16,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2021-11-02 22:15:16,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 175 states and 185 transitions. [2021-11-02 22:15:16,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-11-02 22:15:16,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-11-02 22:15:16,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 185 transitions. [2021-11-02 22:15:16,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:15:16,682 INFO L681 BuchiCegarLoop]: Abstraction has 175 states and 185 transitions. [2021-11-02 22:15:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 185 transitions. [2021-11-02 22:15:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2021-11-02 22:15:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.0552147239263803) internal successors, (172), 162 states have internal predecessors, (172), 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) [2021-11-02 22:15:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2021-11-02 22:15:16,687 INFO L704 BuchiCegarLoop]: Abstraction has 163 states and 172 transitions. [2021-11-02 22:15:16,688 INFO L587 BuchiCegarLoop]: Abstraction has 163 states and 172 transitions. [2021-11-02 22:15:16,688 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-11-02 22:15:16,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 172 transitions. [2021-11-02 22:15:16,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-11-02 22:15:16,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:15:16,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:15:16,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [28, 28, 7, 7, 7, 6, 6, 1, 1] [2021-11-02 22:15:16,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 1, 1, 1, 1, 1] [2021-11-02 22:15:16,691 INFO L791 eck$LassoCheckResult]: Stem: 10119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10120#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 10128#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10132#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10143#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10142#L17-3 assume !(foo_~i~0 <= foo_~size); 10133#L17-4 foo_#res := foo_~i~0; 10129#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10123#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10124#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10127#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10114#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10115#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10274#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10273#L17-3 assume !(foo_~i~0 <= foo_~size); 10134#L17-4 foo_#res := foo_~i~0; 10130#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10131#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10272#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10271#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10270#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10269#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10268#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10267#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10266#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10265#L17-3 assume !(foo_~i~0 <= foo_~size); 10264#L17-4 foo_#res := foo_~i~0; 10263#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10262#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10261#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10260#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10259#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10258#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10257#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10256#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10255#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10254#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10253#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10252#L17-3 assume !(foo_~i~0 <= foo_~size); 10251#L17-4 foo_#res := foo_~i~0; 10250#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10249#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10248#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10247#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10246#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10245#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10244#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10243#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10242#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10241#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10240#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10238#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10236#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10235#L17-3 assume !(foo_~i~0 <= foo_~size); 10234#L17-4 foo_#res := foo_~i~0; 10233#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10232#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10231#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10230#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10228#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10226#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10224#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10223#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10222#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10220#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10218#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10217#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10216#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10214#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10215#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10210#L17-3 assume !(foo_~i~0 <= foo_~size); 10211#L17-4 foo_#res := foo_~i~0; 10239#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10237#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10184#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10185#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10178#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10179#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10174#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10175#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10229#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10227#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10225#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10168#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10167#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10165#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10166#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10161#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10162#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10144#L17-3 assume !(foo_~i~0 <= foo_~size); 10145#L17-4 foo_#res := foo_~i~0; 10139#L20 [2021-11-02 22:15:16,692 INFO L793 eck$LassoCheckResult]: Loop: 10139#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10121#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10122#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10135#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10112#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10113#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10126#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10158#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10157#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10156#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10155#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10154#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10153#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10152#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10151#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10150#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10149#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10148#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10147#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10146#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10138#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10136#L17-3 assume !(foo_~i~0 <= foo_~size); 10137#L17-4 foo_#res := foo_~i~0; 10139#L20 [2021-11-02 22:15:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 303824311, now seen corresponding path program 32 times [2021-11-02 22:15:16,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:15:16,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302436466] [2021-11-02 22:15:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:15:16,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:15:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:16,736 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:15:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:16,796 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:15:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash 396441537, now seen corresponding path program 20 times [2021-11-02 22:15:16,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:15:16,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316723956] [2021-11-02 22:15:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:15:16,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:15:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:16,811 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:15:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:16,823 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:15:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1972097717, now seen corresponding path program 33 times [2021-11-02 22:15:16,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:15:16,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619874174] [2021-11-02 22:15:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:15:16,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:15:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:15:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 136 proven. 1478 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-11-02 22:15:17,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:15:17,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619874174] [2021-11-02 22:15:17,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619874174] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:15:17,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879839645] [2021-11-02 22:15:17,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:15:17,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:15:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:15:17,180 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:15:17,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2021-11-02 22:15:18,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-02 22:15:18,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:15:18,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 22:15:18,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:15:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 950 proven. 177 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2021-11-02 22:15:18,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879839645] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:15:18,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:15:18,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2021-11-02 22:15:18,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623634557] [2021-11-02 22:15:20,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:20,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 104 [2021-11-02 22:15:20,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:15:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-02 22:15:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2021-11-02 22:15:20,604 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. cyclomatic complexity: 13 Second operand has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 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) [2021-11-02 22:15:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:15:22,684 INFO L93 Difference]: Finished difference Result 297 states and 310 transitions. [2021-11-02 22:15:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-11-02 22:15:22,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 310 transitions. [2021-11-02 22:15:22,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2021-11-02 22:15:22,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 274 states and 286 transitions. [2021-11-02 22:15:22,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-11-02 22:15:22,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-11-02 22:15:22,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 286 transitions. [2021-11-02 22:15:22,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:15:22,691 INFO L681 BuchiCegarLoop]: Abstraction has 274 states and 286 transitions. [2021-11-02 22:15:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 286 transitions. [2021-11-02 22:15:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 203. [2021-11-02 22:15:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 203 states have (on average 1.0443349753694582) internal successors, (212), 202 states have internal predecessors, (212), 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) [2021-11-02 22:15:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 212 transitions. [2021-11-02 22:15:22,698 INFO L704 BuchiCegarLoop]: Abstraction has 203 states and 212 transitions. [2021-11-02 22:15:22,699 INFO L587 BuchiCegarLoop]: Abstraction has 203 states and 212 transitions. [2021-11-02 22:15:22,699 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-11-02 22:15:22,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 212 transitions. [2021-11-02 22:15:22,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-11-02 22:15:22,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:15:22,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:15:22,702 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [36, 36, 8, 8, 8, 7, 7, 1, 1] [2021-11-02 22:15:22,703 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 1, 1, 1, 1, 1] [2021-11-02 22:15:22,703 INFO L791 eck$LassoCheckResult]: Stem: 11095#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11096#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 11105#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11109#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11118#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11113#L17-3 assume !(foo_~i~0 <= foo_~size); 11114#L17-4 foo_#res := foo_~i~0; 11106#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11099#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11100#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11103#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11104#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11280#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11090#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11091#L17-3 assume !(foo_~i~0 <= foo_~size); 11112#L17-4 foo_#res := foo_~i~0; 11107#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11108#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11279#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11278#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11277#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11276#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11275#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11274#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11273#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11272#L17-3 assume !(foo_~i~0 <= foo_~size); 11271#L17-4 foo_#res := foo_~i~0; 11270#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11269#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11268#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11267#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11266#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11265#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11264#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11263#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11262#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11261#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11260#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11259#L17-3 assume !(foo_~i~0 <= foo_~size); 11258#L17-4 foo_#res := foo_~i~0; 11257#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11256#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11255#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11254#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11253#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11252#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11251#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11250#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11249#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11247#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11245#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11243#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11241#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11239#L17-3 assume !(foo_~i~0 <= foo_~size); 11237#L17-4 foo_#res := foo_~i~0; 11235#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11233#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11231#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11229#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11227#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11225#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11223#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11221#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11219#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11217#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11215#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11213#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11211#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11207#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11208#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11248#L17-3 assume !(foo_~i~0 <= foo_~size); 11246#L17-4 foo_#res := foo_~i~0; 11244#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11242#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11240#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11238#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11236#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11234#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11232#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11230#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11228#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11226#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11224#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11222#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11220#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11218#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11216#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11214#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11212#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11157#L17-3 assume !(foo_~i~0 <= foo_~size); 11158#L17-4 foo_#res := foo_~i~0; 11154#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11155#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11180#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11179#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11178#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11177#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11176#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11175#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11174#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11173#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11172#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11171#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11170#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11169#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11168#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11167#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11166#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11165#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11164#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11134#L17-3 assume !(foo_~i~0 <= foo_~size); 11132#L17-4 foo_#res := foo_~i~0; 11111#L20 [2021-11-02 22:15:22,703 INFO L793 eck$LassoCheckResult]: Loop: 11111#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11097#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11098#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11115#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11088#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11089#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11102#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11131#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11130#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11129#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11128#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11127#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11126#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11125#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11124#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11123#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11122#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11121#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11120#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11119#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11116#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11117#L17-3 assume !(foo_~i~0 <= foo_~size); 11110#L17-4 foo_#res := foo_~i~0; 11111#L20 [2021-11-02 22:15:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -654565431, now seen corresponding path program 34 times [2021-11-02 22:15:22,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:15:22,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616560929] [2021-11-02 22:15:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:15:22,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:15:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:22,768 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:15:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:22,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:15:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 396441537, now seen corresponding path program 21 times [2021-11-02 22:15:22,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:15:22,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053887956] [2021-11-02 22:15:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:15:22,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:15:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:22,888 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:15:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:22,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:15:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:15:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash -190195975, now seen corresponding path program 35 times [2021-11-02 22:15:22,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:15:22,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186133778] [2021-11-02 22:15:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:15:22,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:15:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:23,037 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:15:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:15:23,127 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:15:24,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:15:24,466 INFO L244 Elim1Store]: Index analysis took 107 ms [2021-11-02 22:15:24,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 127 [2021-11-02 22:16:26,933 WARN L207 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 848 DAG size of output: 547 [2021-11-02 22:16:27,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:27,439 INFO L354 Elim1Store]: treesize reduction 324, result has 16.7 percent of original size [2021-11-02 22:16:27,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 93 [2021-11-02 22:16:28,968 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:16:28,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:16:28,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:16:28,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:16:28,968 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:16:28,968 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:28,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:16:28,968 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:16:28,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration24_Lasso [2021-11-02 22:16:28,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:16:28,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:16:28,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:28,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:28,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:28,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:28,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:28,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:33,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:33,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:33,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:33,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:16:34,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:16:34,268 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:16:34,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,271 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-11-02 22:16:34,273 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 [2021-11-02 22:16:34,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:16:34,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:16:34,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:16:34,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2021-11-02 22:16:34,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,309 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-11-02 22:16:34,310 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 [2021-11-02 22:16:34,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:34,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,348 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-11-02 22:16:34,350 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 [2021-11-02 22:16:34,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-11-02 22:16:34,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,389 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-11-02 22:16:34,390 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 [2021-11-02 22:16:34,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:16:34,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:16:34,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:16:34,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2021-11-02 22:16:34,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,427 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-11-02 22:16:34,428 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 [2021-11-02 22:16:34,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:16:34,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:16:34,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:16:34,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:34,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,465 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,467 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 [2021-11-02 22:16:34,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-11-02 22:16:34,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:16:34,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:16:34,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:16:34,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-11-02 22:16:34,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,504 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-11-02 22:16:34,506 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 [2021-11-02 22:16:34,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:34,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,548 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-11-02 22:16:34,550 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 [2021-11-02 22:16:34,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-11-02 22:16:34,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,602 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-11-02 22:16:34,604 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 [2021-11-02 22:16:34,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2021-11-02 22:16:34,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,672 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,674 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 [2021-11-02 22:16:34,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-11-02 22:16:34,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:34,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,806 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,815 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 [2021-11-02 22:16:34,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-11-02 22:16:34,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:34,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,891 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,893 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 [2021-11-02 22:16:34,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-11-02 22:16:34,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:34,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:34,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:34,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:34,979 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:34,982 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 [2021-11-02 22:16:34,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:34,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:34,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:34,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:34,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:34,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:34,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-11-02 22:16:35,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:16:35,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:35,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:35,057 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:35,060 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 [2021-11-02 22:16:35,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:16:35,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:16:35,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:16:35,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:16:35,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-11-02 22:16:35,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:16:35,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:16:35,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:16:35,180 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-11-02 22:16:35,180 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 34 variables to zero. [2021-11-02 22:16:35,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:16:35,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:35,183 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:16:35,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:16:35,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-11-02 22:16:35,208 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:16:35,208 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:16:35,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#mask~0.base)_8, ULTIMATE.start_main_~i~1) = 5*v_rep(select #length ULTIMATE.start_main_~#mask~0.base)_8 - 6*ULTIMATE.start_main_~i~1 Supporting invariants [] [2021-11-02 22:16:35,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:35,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2021-11-02 22:16:36,480 INFO L297 tatePredicateManager]: 176 out of 176 supporting invariants were superfluous and have been removed [2021-11-02 22:16:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:16:36,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:16:36,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:16:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:16:36,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 22:16:36,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:16:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:16:37,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2021-11-02 22:16:37,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 212 transitions. cyclomatic complexity: 13 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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) [2021-11-02 22:16:38,941 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 212 transitions. cyclomatic complexity: 13. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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) Result 425 states and 446 transitions. Complement of second has 45 states. [2021-11-02 22:16:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 21 non-accepting loop states 1 accepting loop states [2021-11-02 22:16:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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) [2021-11-02 22:16:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2021-11-02 22:16:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 47 transitions. Stem has 112 letters. Loop has 23 letters. [2021-11-02 22:16:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:16:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 47 transitions. Stem has 135 letters. Loop has 23 letters. [2021-11-02 22:16:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:16:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 47 transitions. Stem has 112 letters. Loop has 46 letters. [2021-11-02 22:16:38,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:16:38,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 425 states and 446 transitions. [2021-11-02 22:16:38,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2021-11-02 22:16:38,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 425 states to 251 states and 267 transitions. [2021-11-02 22:16:38,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-02 22:16:38,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-11-02 22:16:38,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 267 transitions. [2021-11-02 22:16:38,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:16:38,952 INFO L681 BuchiCegarLoop]: Abstraction has 251 states and 267 transitions. [2021-11-02 22:16:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 267 transitions. [2021-11-02 22:16:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2021-11-02 22:16:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 1.0562770562770563) internal successors, (244), 230 states have internal predecessors, (244), 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) [2021-11-02 22:16:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 244 transitions. [2021-11-02 22:16:38,960 INFO L704 BuchiCegarLoop]: Abstraction has 231 states and 244 transitions. [2021-11-02 22:16:38,960 INFO L587 BuchiCegarLoop]: Abstraction has 231 states and 244 transitions. [2021-11-02 22:16:38,960 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-11-02 22:16:38,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 244 transitions. [2021-11-02 22:16:38,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-02 22:16:38,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:16:38,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:16:38,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [36, 36, 8, 8, 8, 7, 7, 1, 1] [2021-11-02 22:16:38,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2021-11-02 22:16:38,965 INFO L791 eck$LassoCheckResult]: Stem: 12940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12941#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 12953#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12957#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12969#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12962#L17-3 assume !(foo_~i~0 <= foo_~size); 12959#L17-4 foo_#res := foo_~i~0; 12954#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12955#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13085#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13086#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13097#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13096#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13095#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13094#L17-3 assume !(foo_~i~0 <= foo_~size); 13093#L17-4 foo_#res := foo_~i~0; 13092#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13091#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13089#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13090#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13119#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13117#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13115#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13113#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13111#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13109#L17-3 assume !(foo_~i~0 <= foo_~size); 13107#L17-4 foo_#res := foo_~i~0; 13105#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13103#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13100#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13101#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13123#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13122#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13121#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13120#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13118#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13116#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13114#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13112#L17-3 assume !(foo_~i~0 <= foo_~size); 13110#L17-4 foo_#res := foo_~i~0; 13108#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13106#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13104#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13102#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13099#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13098#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13088#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13087#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13084#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13083#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13082#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13081#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13080#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13079#L17-3 assume !(foo_~i~0 <= foo_~size); 12960#L17-4 foo_#res := foo_~i~0; 12956#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12947#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12948#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12958#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12938#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12939#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13124#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13130#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13129#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13128#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13127#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13126#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13125#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12951#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12952#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13150#L17-3 assume !(foo_~i~0 <= foo_~size); 13149#L17-4 foo_#res := foo_~i~0; 13148#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13147#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13146#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13145#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13144#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13143#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13142#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13141#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13140#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13139#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13138#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13137#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13136#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13135#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13134#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13133#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13132#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13050#L17-3 assume !(foo_~i~0 <= foo_~size); 13051#L17-4 foo_#res := foo_~i~0; 13057#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13026#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13027#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13017#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13018#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13013#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13014#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13009#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13010#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13005#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13006#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13001#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13002#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12997#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12998#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12993#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12994#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12989#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12990#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12970#L17-3 assume !(foo_~i~0 <= foo_~size); 12971#L17-4 foo_#res := foo_~i~0; 12963#L20 [2021-11-02 22:16:38,965 INFO L793 eck$LassoCheckResult]: Loop: 12963#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12945#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12946#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12961#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12936#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12937#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12950#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12986#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12985#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12984#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12983#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12982#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12981#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12980#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12979#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12978#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12977#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12976#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12975#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12974#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12973#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12972#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12967#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12968#L17-3 assume !(foo_~i~0 <= foo_~size); 12966#L17-4 foo_#res := foo_~i~0; 12963#L20 [2021-11-02 22:16:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash -654565431, now seen corresponding path program 36 times [2021-11-02 22:16:38,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:38,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749293101] [2021-11-02 22:16:38,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:38,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:39,025 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:39,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:16:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1271716029, now seen corresponding path program 22 times [2021-11-02 22:16:39,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:39,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158124564] [2021-11-02 22:16:39,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:39,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:39,121 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:39,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:16:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1905318011, now seen corresponding path program 37 times [2021-11-02 22:16:39,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:39,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632701225] [2021-11-02 22:16:39,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:39,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:16:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2648 backedges. 171 proven. 2273 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-02 22:16:39,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:16:39,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632701225] [2021-11-02 22:16:39,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632701225] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:16:39,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010532276] [2021-11-02 22:16:39,536 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-02 22:16:39,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:16:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:39,538 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:16:39,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2021-11-02 22:16:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:16:40,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 22:16:40,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:16:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2648 backedges. 188 proven. 2256 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-02 22:16:41,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010532276] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:16:41,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:16:41,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2021-11-02 22:16:41,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529112523] [2021-11-02 22:16:43,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:43,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 141 [2021-11-02 22:16:43,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:16:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-02 22:16:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2021-11-02 22:16:43,443 INFO L87 Difference]: Start difference. First operand 231 states and 244 transitions. cyclomatic complexity: 18 Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 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) [2021-11-02 22:16:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:16:45,552 INFO L93 Difference]: Finished difference Result 528 states and 555 transitions. [2021-11-02 22:16:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-02 22:16:45,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 528 states and 555 transitions. [2021-11-02 22:16:45,557 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-11-02 22:16:45,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 528 states to 506 states and 533 transitions. [2021-11-02 22:16:45,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2021-11-02 22:16:45,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2021-11-02 22:16:45,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 533 transitions. [2021-11-02 22:16:45,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:16:45,562 INFO L681 BuchiCegarLoop]: Abstraction has 506 states and 533 transitions. [2021-11-02 22:16:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 533 transitions. [2021-11-02 22:16:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 338. [2021-11-02 22:16:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.0562130177514792) internal successors, (357), 337 states have internal predecessors, (357), 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) [2021-11-02 22:16:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 357 transitions. [2021-11-02 22:16:45,573 INFO L704 BuchiCegarLoop]: Abstraction has 338 states and 357 transitions. [2021-11-02 22:16:45,573 INFO L587 BuchiCegarLoop]: Abstraction has 338 states and 357 transitions. [2021-11-02 22:16:45,574 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-11-02 22:16:45,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 357 transitions. [2021-11-02 22:16:45,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-02 22:16:45,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:16:45,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:16:45,580 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [43, 43, 9, 9, 9, 8, 8, 1, 1] [2021-11-02 22:16:45,580 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2021-11-02 22:16:45,581 INFO L791 eck$LassoCheckResult]: Stem: 14322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14323#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 14332#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14346#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14347#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14342#L17-3 assume !(foo_~i~0 <= foo_~size); 14343#L17-4 foo_#res := foo_~i~0; 14335#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14336#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14519#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14518#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14517#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14516#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14515#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14514#L17-3 assume !(foo_~i~0 <= foo_~size); 14513#L17-4 foo_#res := foo_~i~0; 14512#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14511#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14510#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14509#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14508#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14507#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14506#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14505#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14504#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14503#L17-3 assume !(foo_~i~0 <= foo_~size); 14502#L17-4 foo_#res := foo_~i~0; 14501#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14500#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14499#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14498#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14497#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14496#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14495#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14494#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14493#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14492#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14491#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14490#L17-3 assume !(foo_~i~0 <= foo_~size); 14489#L17-4 foo_#res := foo_~i~0; 14488#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14487#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14486#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14485#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14484#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14483#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14482#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14481#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14480#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14479#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14478#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14477#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14476#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14475#L17-3 assume !(foo_~i~0 <= foo_~size); 14474#L17-4 foo_#res := foo_~i~0; 14473#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14472#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14471#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14470#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14469#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14468#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14467#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14466#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14465#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14464#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14463#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14462#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14461#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14460#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14459#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14458#L17-3 assume !(foo_~i~0 <= foo_~size); 14457#L17-4 foo_#res := foo_~i~0; 14456#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14455#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14454#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14453#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14452#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14451#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14450#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14449#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14448#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14447#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14446#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14445#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14444#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14443#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14442#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14441#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14440#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14438#L17-3 assume !(foo_~i~0 <= foo_~size); 14435#L17-4 foo_#res := foo_~i~0; 14436#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14641#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14640#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14639#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14638#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14637#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14636#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14635#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14634#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14633#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14632#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14631#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14630#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14629#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14628#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14627#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14626#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14625#L17-3 assume !(foo_~i~0 <= foo_~size); 14544#L17-4 foo_#res := foo_~i~0; 14655#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14654#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14386#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14383#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14382#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14381#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14380#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14379#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14378#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14377#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14376#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14375#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14374#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14373#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14372#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14371#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14370#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14369#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14368#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14366#L17-3 assume !(foo_~i~0 <= foo_~size); 14367#L17-4 foo_#res := foo_~i~0; 14339#L20 [2021-11-02 22:16:45,581 INFO L793 eck$LassoCheckResult]: Loop: 14339#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14327#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14328#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14333#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14318#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14319#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14363#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14362#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14361#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14360#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14359#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14358#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14357#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14356#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14355#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14354#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14353#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14352#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14351#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14350#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14349#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14348#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14344#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14345#L17-3 assume !(foo_~i~0 <= foo_~size); 14338#L17-4 foo_#res := foo_~i~0; 14339#L20 [2021-11-02 22:16:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1387441593, now seen corresponding path program 38 times [2021-11-02 22:16:45,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:45,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561349580] [2021-11-02 22:16:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:45,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:16:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 1569 proven. 583 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2021-11-02 22:16:45,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:16:45,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561349580] [2021-11-02 22:16:45,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561349580] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:16:45,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022437992] [2021-11-02 22:16:45,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:16:45,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:16:45,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:45,919 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:16:45,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2021-11-02 22:16:47,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:16:47,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:16:47,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 22:16:47,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:16:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 1627 proven. 525 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2021-11-02 22:16:47,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022437992] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:16:47,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:16:47,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2021-11-02 22:16:47,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811605883] [2021-11-02 22:16:47,755 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:16:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1271716029, now seen corresponding path program 23 times [2021-11-02 22:16:47,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:47,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209051439] [2021-11-02 22:16:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:47,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:47,771 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:47,784 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:16:50,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 109 [2021-11-02 22:16:50,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:16:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-02 22:16:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2021-11-02 22:16:50,339 INFO L87 Difference]: Start difference. First operand 338 states and 357 transitions. cyclomatic complexity: 24 Second operand has 27 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 27 states have internal predecessors, (98), 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) [2021-11-02 22:16:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:16:51,449 INFO L93 Difference]: Finished difference Result 321 states and 335 transitions. [2021-11-02 22:16:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-02 22:16:51,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 335 transitions. [2021-11-02 22:16:51,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-02 22:16:51,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 256 states and 267 transitions. [2021-11-02 22:16:51,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2021-11-02 22:16:51,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-11-02 22:16:51,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 267 transitions. [2021-11-02 22:16:51,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:16:51,455 INFO L681 BuchiCegarLoop]: Abstraction has 256 states and 267 transitions. [2021-11-02 22:16:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 267 transitions. [2021-11-02 22:16:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 235. [2021-11-02 22:16:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 235 states have (on average 1.0468085106382978) internal successors, (246), 234 states have internal predecessors, (246), 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) [2021-11-02 22:16:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 246 transitions. [2021-11-02 22:16:51,462 INFO L704 BuchiCegarLoop]: Abstraction has 235 states and 246 transitions. [2021-11-02 22:16:51,462 INFO L587 BuchiCegarLoop]: Abstraction has 235 states and 246 transitions. [2021-11-02 22:16:51,463 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-11-02 22:16:51,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 246 transitions. [2021-11-02 22:16:51,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-02 22:16:51,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:16:51,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:16:51,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [44, 44, 9, 9, 9, 8, 8, 1, 1] [2021-11-02 22:16:51,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2021-11-02 22:16:51,467 INFO L791 eck$LassoCheckResult]: Stem: 15474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 15475#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 15484#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15485#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15499#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15496#L17-3 assume !(foo_~i~0 <= foo_~size); 15489#L17-4 foo_#res := foo_~i~0; 15486#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15479#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15480#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15482#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15483#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15683#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15682#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15681#L17-3 assume !(foo_~i~0 <= foo_~size); 15490#L17-4 foo_#res := foo_~i~0; 15487#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15488#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15680#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15679#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15678#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15677#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15676#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15675#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15674#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15673#L17-3 assume !(foo_~i~0 <= foo_~size); 15672#L17-4 foo_#res := foo_~i~0; 15671#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15670#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15669#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15668#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15667#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15666#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15665#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15664#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15663#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15662#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15661#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15660#L17-3 assume !(foo_~i~0 <= foo_~size); 15659#L17-4 foo_#res := foo_~i~0; 15658#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15657#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15656#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15655#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15654#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15653#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15652#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15651#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15650#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15649#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15648#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15647#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15646#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15645#L17-3 assume !(foo_~i~0 <= foo_~size); 15644#L17-4 foo_#res := foo_~i~0; 15643#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15642#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15641#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15640#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15639#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15638#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15637#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15636#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15635#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15634#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15633#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15632#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15631#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15630#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15629#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15628#L17-3 assume !(foo_~i~0 <= foo_~size); 15627#L17-4 foo_#res := foo_~i~0; 15626#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15625#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15624#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15623#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15622#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15621#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15620#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15619#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15618#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15617#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15616#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15615#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15613#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15611#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15609#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15607#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15605#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15603#L17-3 assume !(foo_~i~0 <= foo_~size); 15602#L17-4 foo_#res := foo_~i~0; 15601#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15600#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15598#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15594#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15592#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15589#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15586#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15583#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15580#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15577#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15575#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15573#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15571#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15569#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15567#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15565#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15563#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15561#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15558#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15548#L17-3 assume !(foo_~i~0 <= foo_~size); 15549#L17-4 foo_#res := foo_~i~0; 15553#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15701#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15700#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15699#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15698#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15697#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15696#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15695#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15694#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15693#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15692#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15691#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15690#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15689#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15524#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15522#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15523#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15687#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15686#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15515#L17-3 assume !(foo_~i~0 <= foo_~size); 15516#L17-4 foo_#res := foo_~i~0; 15492#L20 [2021-11-02 22:16:51,468 INFO L793 eck$LassoCheckResult]: Loop: 15492#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15477#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 15478#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 15491#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15467#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15468#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15481#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15514#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15513#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15512#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15511#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15510#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15509#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15508#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15507#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15506#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15505#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15504#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15503#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15502#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15501#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15500#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 15498#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 15497#L17-3 assume !(foo_~i~0 <= foo_~size); 15493#L17-4 foo_#res := foo_~i~0; 15492#L20 [2021-11-02 22:16:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1447845111, now seen corresponding path program 39 times [2021-11-02 22:16:51,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:51,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379389949] [2021-11-02 22:16:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:51,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:16:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2452 backedges. 1352 proven. 896 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-02 22:16:51,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:16:51,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379389949] [2021-11-02 22:16:51,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379389949] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:16:51,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253850639] [2021-11-02 22:16:51,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:16:51,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:16:51,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:16:51,851 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:16:51,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2021-11-02 22:16:53,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-02 22:16:53,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:16:53,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 22:16:53,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:16:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2452 backedges. 1164 proven. 224 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2021-11-02 22:16:53,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253850639] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:16:53,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:16:53,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2021-11-02 22:16:53,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214024420] [2021-11-02 22:16:53,990 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:16:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1271716029, now seen corresponding path program 24 times [2021-11-02 22:16:53,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:53,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356852051] [2021-11-02 22:16:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:53,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:54,007 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:54,020 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:16:56,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:16:56,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 118 [2021-11-02 22:16:56,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:16:56,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-02 22:16:56,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2021-11-02 22:16:56,733 INFO L87 Difference]: Start difference. First operand 235 states and 246 transitions. cyclomatic complexity: 15 Second operand has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 37 states have internal predecessors, (119), 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) [2021-11-02 22:16:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:16:59,253 INFO L93 Difference]: Finished difference Result 259 states and 266 transitions. [2021-11-02 22:16:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-11-02 22:16:59,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 266 transitions. [2021-11-02 22:16:59,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-02 22:16:59,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 213 states and 218 transitions. [2021-11-02 22:16:59,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2021-11-02 22:16:59,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2021-11-02 22:16:59,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 218 transitions. [2021-11-02 22:16:59,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:16:59,259 INFO L681 BuchiCegarLoop]: Abstraction has 213 states and 218 transitions. [2021-11-02 22:16:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 218 transitions. [2021-11-02 22:16:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2021-11-02 22:16:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.0264550264550265) internal successors, (194), 188 states have internal predecessors, (194), 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) [2021-11-02 22:16:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2021-11-02 22:16:59,265 INFO L704 BuchiCegarLoop]: Abstraction has 189 states and 194 transitions. [2021-11-02 22:16:59,265 INFO L587 BuchiCegarLoop]: Abstraction has 189 states and 194 transitions. [2021-11-02 22:16:59,265 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-11-02 22:16:59,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 194 transitions. [2021-11-02 22:16:59,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-02 22:16:59,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:16:59,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:16:59,269 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [45, 45, 9, 9, 9, 8, 8, 1, 1] [2021-11-02 22:16:59,269 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2021-11-02 22:16:59,270 INFO L791 eck$LassoCheckResult]: Stem: 16527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 16528#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 16536#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16540#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16554#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16552#L17-3 assume !(foo_~i~0 <= foo_~size); 16547#L17-4 foo_#res := foo_~i~0; 16537#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16531#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16532#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16704#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16703#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16702#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16701#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16700#L17-3 assume !(foo_~i~0 <= foo_~size); 16699#L17-4 foo_#res := foo_~i~0; 16538#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16539#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16541#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16535#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16522#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16523#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16708#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16707#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16706#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16705#L17-3 assume !(foo_~i~0 <= foo_~size); 16544#L17-4 foo_#res := foo_~i~0; 16545#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16698#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16697#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16696#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16695#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16694#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16693#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16692#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16691#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16690#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16689#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16688#L17-3 assume !(foo_~i~0 <= foo_~size); 16687#L17-4 foo_#res := foo_~i~0; 16686#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16685#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16684#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16683#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16682#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16681#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16680#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16679#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16678#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16677#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16676#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16675#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16674#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16673#L17-3 assume !(foo_~i~0 <= foo_~size); 16672#L17-4 foo_#res := foo_~i~0; 16671#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16670#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16669#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16668#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16667#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16666#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16665#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16664#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16663#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16662#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16661#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16660#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16659#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16658#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16657#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16656#L17-3 assume !(foo_~i~0 <= foo_~size); 16655#L17-4 foo_#res := foo_~i~0; 16654#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16653#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16652#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16651#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16650#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16649#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16648#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16647#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16646#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16645#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16644#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16643#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16642#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16641#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16640#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16639#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16638#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16637#L17-3 assume !(foo_~i~0 <= foo_~size); 16636#L17-4 foo_#res := foo_~i~0; 16635#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16634#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16633#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16632#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16631#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16630#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16629#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16628#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16627#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16626#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16625#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16624#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16623#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16622#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16621#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16620#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16619#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16596#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16597#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16592#L17-3 assume !(foo_~i~0 <= foo_~size); 16593#L17-4 foo_#res := foo_~i~0; 16618#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16617#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16616#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16615#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16614#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16613#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16612#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16611#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16610#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16609#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16608#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16607#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16606#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16605#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16604#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16603#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16602#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16601#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16600#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16599#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16598#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16553#L17-3 assume !(foo_~i~0 <= foo_~size); 16548#L17-4 foo_#res := foo_~i~0; 16543#L20 [2021-11-02 22:16:59,270 INFO L793 eck$LassoCheckResult]: Loop: 16543#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 16529#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16530#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 16546#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16520#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16521#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16534#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16569#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16568#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16567#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16566#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16565#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16564#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16563#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16562#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16561#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16560#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16559#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16558#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16557#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16556#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16555#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 16551#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 16550#L17-3 assume !(foo_~i~0 <= foo_~size); 16542#L17-4 foo_#res := foo_~i~0; 16543#L20 [2021-11-02 22:16:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash -190195975, now seen corresponding path program 40 times [2021-11-02 22:16:59,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:59,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10914213] [2021-11-02 22:16:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:59,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:59,374 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:59,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:16:59,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1271716029, now seen corresponding path program 25 times [2021-11-02 22:16:59,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:59,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690170156] [2021-11-02 22:16:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:59,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:59,491 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:59,502 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:16:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:16:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1783720117, now seen corresponding path program 41 times [2021-11-02 22:16:59,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:16:59,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909508147] [2021-11-02 22:16:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:16:59,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:16:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:59,605 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:16:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:16:59,784 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:17:01,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:01,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:17:02,021 INFO L244 Elim1Store]: Index analysis took 115 ms [2021-11-02 22:17:02,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 130 [2021-11-02 22:18:39,315 WARN L207 SmtUtils]: Spent 1.62 m on a formula simplification. DAG size of input: 1013 DAG size of output: 652 [2021-11-02 22:18:40,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:40,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 127 [2021-11-02 22:18:41,336 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:18:41,336 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:18:41,336 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:18:41,336 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:18:41,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:18:41,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:41,337 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:18:41,337 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:18:41,337 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration28_Lasso [2021-11-02 22:18:41,337 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:18:41,337 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:18:41,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:41,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:44,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:18:44,858 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:18:44,859 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:18:44,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:44,861 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:44,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-11-02 22:18:44,863 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 [2021-11-02 22:18:44,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:44,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:18:44,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:44,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:44,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:44,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:18:44,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:18:44,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:44,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:44,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:44,901 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:44,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-11-02 22:18:44,902 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 [2021-11-02 22:18:44,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:44,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:18:44,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:44,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:44,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:44,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:18:44,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:18:44,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:44,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2021-11-02 22:18:44,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:44,939 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:44,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-11-02 22:18:44,941 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 [2021-11-02 22:18:44,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:44,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:44,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:44,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:44,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:18:44,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:18:44,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:44,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-11-02 22:18:44,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:44,980 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:44,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-11-02 22:18:44,983 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 [2021-11-02 22:18:44,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:44,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:18:44,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:44,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:44,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:44,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:18:44,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:18:44,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:45,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:45,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:45,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:45,019 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:45,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-11-02 22:18:45,021 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 [2021-11-02 22:18:45,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:45,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:18:45,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:45,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:45,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:45,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:18:45,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:18:45,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:45,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:45,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:45,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:45,057 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:45,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-11-02 22:18:45,059 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 [2021-11-02 22:18:45,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:45,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:18:45,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:45,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:45,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:45,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:18:45,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:18:45,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:45,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:45,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:45,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:45,095 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:45,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-11-02 22:18:45,099 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 [2021-11-02 22:18:45,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:45,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:45,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:45,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:45,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:18:45,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:18:45,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:45,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:45,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:45,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:45,141 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:45,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-11-02 22:18:45,142 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 [2021-11-02 22:18:45,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:45,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:18:45,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:45,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:45,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:45,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:18:45,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:18:45,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:18:45,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-11-02 22:18:45,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:45,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:45,178 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:45,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-11-02 22:18:45,181 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 [2021-11-02 22:18:45,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:18:45,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:18:45,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:18:45,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:18:45,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:18:45,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:18:45,224 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:18:45,254 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-11-02 22:18:45,254 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 34 variables to zero. [2021-11-02 22:18:45,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:18:45,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:45,256 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:18:45,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-11-02 22:18:45,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:18:45,266 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:18:45,267 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:18:45,267 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#mask~0.base)_9, ULTIMATE.start_main_~i~1) = 17*v_rep(select #length ULTIMATE.start_main_~#mask~0.base)_9 - 20*ULTIMATE.start_main_~i~1 Supporting invariants [] [2021-11-02 22:18:45,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:46,215 INFO L297 tatePredicateManager]: 124 out of 124 supporting invariants were superfluous and have been removed [2021-11-02 22:18:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:18:46,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2021-11-02 22:18:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:18:46,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:18:46,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:18:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:18:46,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-02 22:18:46,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:18:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:18:47,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 16 loop predicates [2021-11-02 22:18:47,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 194 transitions. cyclomatic complexity: 8 Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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) [2021-11-02 22:18:49,137 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 194 transitions. cyclomatic complexity: 8. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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 381 states and 394 transitions. Complement of second has 49 states. [2021-11-02 22:18:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 23 non-accepting loop states 1 accepting loop states [2021-11-02 22:18:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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) [2021-11-02 22:18:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 50 transitions. [2021-11-02 22:18:49,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 50 transitions. Stem has 135 letters. Loop has 25 letters. [2021-11-02 22:18:49,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:18:49,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 50 transitions. Stem has 160 letters. Loop has 25 letters. [2021-11-02 22:18:49,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:18:49,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 50 transitions. Stem has 135 letters. Loop has 50 letters. [2021-11-02 22:18:49,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:18:49,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 394 transitions. [2021-11-02 22:18:49,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2021-11-02 22:18:49,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 231 states and 241 transitions. [2021-11-02 22:18:49,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-02 22:18:49,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-11-02 22:18:49,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 241 transitions. [2021-11-02 22:18:49,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:18:49,145 INFO L681 BuchiCegarLoop]: Abstraction has 231 states and 241 transitions. [2021-11-02 22:18:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 241 transitions. [2021-11-02 22:18:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2021-11-02 22:18:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 219 states have (on average 1.0410958904109588) internal successors, (228), 218 states have internal predecessors, (228), 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) [2021-11-02 22:18:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 228 transitions. [2021-11-02 22:18:49,152 INFO L704 BuchiCegarLoop]: Abstraction has 219 states and 228 transitions. [2021-11-02 22:18:49,152 INFO L587 BuchiCegarLoop]: Abstraction has 219 states and 228 transitions. [2021-11-02 22:18:49,152 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-11-02 22:18:49,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 228 transitions. [2021-11-02 22:18:49,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2021-11-02 22:18:49,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:18:49,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:18:49,156 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [45, 45, 9, 9, 9, 8, 8, 1, 1] [2021-11-02 22:18:49,156 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 1, 1, 1, 1, 1] [2021-11-02 22:18:49,157 INFO L791 eck$LassoCheckResult]: Stem: 18193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 18194#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 18202#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18206#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18217#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18216#L17-3 assume !(foo_~i~0 <= foo_~size); 18207#L17-4 foo_#res := foo_~i~0; 18203#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18197#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18198#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18201#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18188#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18189#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18404#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18403#L17-3 assume !(foo_~i~0 <= foo_~size); 18208#L17-4 foo_#res := foo_~i~0; 18204#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18205#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18402#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18401#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18400#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18399#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18398#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18397#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18396#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18395#L17-3 assume !(foo_~i~0 <= foo_~size); 18394#L17-4 foo_#res := foo_~i~0; 18393#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18392#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18391#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18390#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18389#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18388#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18387#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18386#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18385#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18384#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18383#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18382#L17-3 assume !(foo_~i~0 <= foo_~size); 18381#L17-4 foo_#res := foo_~i~0; 18380#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18379#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18378#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18377#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18376#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18375#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18374#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18373#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18372#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18371#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18370#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18369#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18368#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18367#L17-3 assume !(foo_~i~0 <= foo_~size); 18366#L17-4 foo_#res := foo_~i~0; 18365#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18364#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18363#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18362#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18361#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18360#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18359#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18358#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18357#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18356#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18355#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18354#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18353#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18352#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18351#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18350#L17-3 assume !(foo_~i~0 <= foo_~size); 18349#L17-4 foo_#res := foo_~i~0; 18348#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18347#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18346#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18345#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18344#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18343#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18342#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18341#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18340#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18339#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18338#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18337#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18336#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18335#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18334#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18333#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18332#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18331#L17-3 assume !(foo_~i~0 <= foo_~size); 18330#L17-4 foo_#res := foo_~i~0; 18329#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18328#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18327#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18326#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18325#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18324#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18323#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18322#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18321#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18320#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18319#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18318#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18317#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18316#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18315#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18314#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18292#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18290#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18291#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18286#L17-3 assume !(foo_~i~0 <= foo_~size); 18287#L17-4 foo_#res := foo_~i~0; 18313#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18312#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18311#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18310#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18309#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18308#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18307#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18306#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18305#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18304#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18303#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18302#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18301#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18300#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18299#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18298#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18297#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18296#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18295#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18294#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18293#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18218#L17-3 assume !(foo_~i~0 <= foo_~size); 18219#L17-4 foo_#res := foo_~i~0; 18213#L20 [2021-11-02 22:18:49,157 INFO L793 eck$LassoCheckResult]: Loop: 18213#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 18195#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 18196#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 18209#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18186#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18187#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18200#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18236#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18235#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18234#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18233#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18232#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18231#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18230#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18229#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18228#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18227#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18226#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18225#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18224#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18223#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18222#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18221#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18220#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 18212#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 18210#L17-3 assume !(foo_~i~0 <= foo_~size); 18211#L17-4 foo_#res := foo_~i~0; 18213#L20 [2021-11-02 22:18:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:18:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -190195975, now seen corresponding path program 42 times [2021-11-02 22:18:49,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:18:49,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434456882] [2021-11-02 22:18:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:18:49,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:18:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:18:49,334 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:18:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:18:49,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:18:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:18:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1946631749, now seen corresponding path program 26 times [2021-11-02 22:18:49,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:18:49,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62701328] [2021-11-02 22:18:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:18:49,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:18:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:18:49,441 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:18:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:18:49,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:18:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:18:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -463025075, now seen corresponding path program 43 times [2021-11-02 22:18:49,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:18:49,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018793165] [2021-11-02 22:18:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:18:49,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:18:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:18:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 210 proven. 3352 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-02 22:18:49,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:18:49,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018793165] [2021-11-02 22:18:49,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018793165] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:18:49,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758758923] [2021-11-02 22:18:49,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-02 22:18:49,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:18:49,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:49,879 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:18:49,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2021-11-02 22:18:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:18:50,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 22:18:50,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:18:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 229 proven. 3333 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-02 22:18:52,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758758923] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:18:52,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:18:52,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2021-11-02 22:18:52,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505145717] [2021-11-02 22:18:55,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:18:55,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 135 [2021-11-02 22:18:55,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:18:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-02 22:18:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2021-11-02 22:18:55,665 INFO L87 Difference]: Start difference. First operand 219 states and 228 transitions. cyclomatic complexity: 13 Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 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) [2021-11-02 22:18:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:18:58,129 INFO L93 Difference]: Finished difference Result 411 states and 427 transitions. [2021-11-02 22:18:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-11-02 22:18:58,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 427 transitions. [2021-11-02 22:18:58,148 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2021-11-02 22:18:58,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 387 states and 403 transitions. [2021-11-02 22:18:58,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2021-11-02 22:18:58,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2021-11-02 22:18:58,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 403 transitions. [2021-11-02 22:18:58,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:18:58,153 INFO L681 BuchiCegarLoop]: Abstraction has 387 states and 403 transitions. [2021-11-02 22:18:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 403 transitions. [2021-11-02 22:18:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 268. [2021-11-02 22:18:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 268 states have (on average 1.041044776119403) internal successors, (279), 267 states have internal predecessors, (279), 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) [2021-11-02 22:18:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 279 transitions. [2021-11-02 22:18:58,162 INFO L704 BuchiCegarLoop]: Abstraction has 268 states and 279 transitions. [2021-11-02 22:18:58,162 INFO L587 BuchiCegarLoop]: Abstraction has 268 states and 279 transitions. [2021-11-02 22:18:58,163 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-11-02 22:18:58,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 279 transitions. [2021-11-02 22:18:58,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2021-11-02 22:18:58,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:18:58,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:18:58,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [54, 54, 10, 10, 10, 9, 9, 1, 1] [2021-11-02 22:18:58,167 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 1, 1, 1, 1, 1] [2021-11-02 22:18:58,167 INFO L791 eck$LassoCheckResult]: Stem: 19550#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 19551#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 19557#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19573#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19574#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19569#L17-3 assume !(foo_~i~0 <= foo_~size); 19570#L17-4 foo_#res := foo_~i~0; 19562#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19563#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19561#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19559#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19545#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19546#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19788#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19787#L17-3 assume !(foo_~i~0 <= foo_~size); 19786#L17-4 foo_#res := foo_~i~0; 19564#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19555#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19556#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19783#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19782#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19781#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19780#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19779#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19778#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19777#L17-3 assume !(foo_~i~0 <= foo_~size); 19776#L17-4 foo_#res := foo_~i~0; 19775#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19774#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19773#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19772#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19771#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19770#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19769#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19768#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19767#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19766#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19765#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19764#L17-3 assume !(foo_~i~0 <= foo_~size); 19763#L17-4 foo_#res := foo_~i~0; 19762#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19761#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19760#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19759#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19758#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19757#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19756#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19755#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19754#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19753#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19752#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19751#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19750#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19749#L17-3 assume !(foo_~i~0 <= foo_~size); 19748#L17-4 foo_#res := foo_~i~0; 19747#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19746#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19745#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19744#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19743#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19742#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19741#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19740#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19739#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19738#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19737#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19736#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19735#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19734#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19733#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19732#L17-3 assume !(foo_~i~0 <= foo_~size); 19731#L17-4 foo_#res := foo_~i~0; 19730#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19729#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19728#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19727#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19726#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19725#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19724#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19723#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19722#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19721#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19720#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19719#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19718#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19717#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19716#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19715#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19714#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19713#L17-3 assume !(foo_~i~0 <= foo_~size); 19712#L17-4 foo_#res := foo_~i~0; 19711#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19710#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19709#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19708#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19707#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19706#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19705#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19704#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19703#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19702#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19701#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19700#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19699#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19698#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19697#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19696#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19694#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19691#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19689#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19687#L17-3 assume !(foo_~i~0 <= foo_~size); 19685#L17-4 foo_#res := foo_~i~0; 19684#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19683#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19682#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19681#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19680#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19679#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19678#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19677#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19676#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19675#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19674#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19673#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19672#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19671#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19670#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19669#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19666#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19665#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19664#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19660#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19661#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19695#L17-3 assume !(foo_~i~0 <= foo_~size); 19692#L17-4 foo_#res := foo_~i~0; 19690#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19688#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19686#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19630#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19631#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19626#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19627#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19622#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19623#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19618#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19619#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19614#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19615#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19610#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19611#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19606#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19607#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19602#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19603#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19668#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19667#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19593#L17-3 assume !(foo_~i~0 <= foo_~size); 19594#L17-4 foo_#res := foo_~i~0; 19566#L20 [2021-11-02 22:18:58,168 INFO L793 eck$LassoCheckResult]: Loop: 19566#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 19553#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 19554#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 19560#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19543#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19544#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19558#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19591#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19590#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19589#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19588#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19587#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19586#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19585#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19584#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19583#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19582#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19581#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19580#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19579#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19578#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19577#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19576#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19575#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 19571#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 19572#L17-3 assume !(foo_~i~0 <= foo_~size); 19565#L17-4 foo_#res := foo_~i~0; 19566#L20 [2021-11-02 22:18:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:18:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1674119625, now seen corresponding path program 44 times [2021-11-02 22:18:58,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:18:58,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412234911] [2021-11-02 22:18:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:18:58,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:18:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:18:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 2117 proven. 1207 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-02 22:18:58,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:18:58,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412234911] [2021-11-02 22:18:58,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412234911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:18:58,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152896809] [2021-11-02 22:18:58,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:18:58,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:18:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:18:58,548 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:18:58,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2021-11-02 22:18:59,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:18:59,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:18:59,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-02 22:18:59,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:19:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 2298 proven. 1026 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-02 22:19:00,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152896809] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:19:00,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:19:00,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2021-11-02 22:19:00,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564049008] [2021-11-02 22:19:00,500 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:19:00,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:19:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1946631749, now seen corresponding path program 27 times [2021-11-02 22:19:00,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:19:00,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572202053] [2021-11-02 22:19:00,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:19:00,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:19:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:00,519 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:19:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:00,533 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:19:03,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:19:03,391 INFO L244 Elim1Store]: Index analysis took 109 ms [2021-11-02 22:19:03,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 147 [2021-11-02 22:19:03,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:19:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-02 22:19:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-11-02 22:19:03,607 INFO L87 Difference]: Start difference. First operand 268 states and 279 transitions. cyclomatic complexity: 15 Second operand has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 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) [2021-11-02 22:19:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:19:05,051 INFO L93 Difference]: Finished difference Result 295 states and 302 transitions. [2021-11-02 22:19:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-11-02 22:19:05,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 302 transitions. [2021-11-02 22:19:05,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2021-11-02 22:19:05,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 245 states and 250 transitions. [2021-11-02 22:19:05,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-11-02 22:19:05,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-11-02 22:19:05,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 250 transitions. [2021-11-02 22:19:05,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:19:05,056 INFO L681 BuchiCegarLoop]: Abstraction has 245 states and 250 transitions. [2021-11-02 22:19:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 250 transitions. [2021-11-02 22:19:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 218. [2021-11-02 22:19:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 218 states have (on average 1.0229357798165137) internal successors, (223), 217 states have internal predecessors, (223), 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) [2021-11-02 22:19:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2021-11-02 22:19:05,063 INFO L704 BuchiCegarLoop]: Abstraction has 218 states and 223 transitions. [2021-11-02 22:19:05,063 INFO L587 BuchiCegarLoop]: Abstraction has 218 states and 223 transitions. [2021-11-02 22:19:05,063 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-11-02 22:19:05,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 223 transitions. [2021-11-02 22:19:05,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2021-11-02 22:19:05,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:19:05,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:19:05,067 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [55, 55, 10, 10, 10, 9, 9, 1, 1] [2021-11-02 22:19:05,067 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 1, 1, 1, 1, 1] [2021-11-02 22:19:05,068 INFO L791 eck$LassoCheckResult]: Stem: 20732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 20733#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 20741#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20745#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20759#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20757#L17-3 assume !(foo_~i~0 <= foo_~size); 20752#L17-4 foo_#res := foo_~i~0; 20742#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20736#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20737#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20942#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20940#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20938#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20936#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20934#L17-3 assume !(foo_~i~0 <= foo_~size); 20933#L17-4 foo_#res := foo_~i~0; 20743#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20744#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20746#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20740#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20727#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20728#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20941#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20939#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20937#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20935#L17-3 assume !(foo_~i~0 <= foo_~size); 20749#L17-4 foo_#res := foo_~i~0; 20750#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20932#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20931#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20930#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20929#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20928#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20927#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20926#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20925#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20924#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20923#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20922#L17-3 assume !(foo_~i~0 <= foo_~size); 20921#L17-4 foo_#res := foo_~i~0; 20920#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20919#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20918#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20917#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20916#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20915#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20914#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20913#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20912#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20911#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20910#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20909#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20908#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20907#L17-3 assume !(foo_~i~0 <= foo_~size); 20906#L17-4 foo_#res := foo_~i~0; 20905#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20904#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20903#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20902#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20901#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20900#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20899#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20898#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20897#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20896#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20895#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20894#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20893#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20892#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20891#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20890#L17-3 assume !(foo_~i~0 <= foo_~size); 20889#L17-4 foo_#res := foo_~i~0; 20888#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20887#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20886#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20885#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20884#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20883#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20882#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20881#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20880#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20879#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20878#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20877#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20876#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20875#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20874#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20873#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20872#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20871#L17-3 assume !(foo_~i~0 <= foo_~size); 20870#L17-4 foo_#res := foo_~i~0; 20869#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20868#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20867#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20866#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20865#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20864#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20863#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20862#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20861#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20859#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20858#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20857#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20855#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20854#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20853#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20851#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20850#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20849#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20847#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20846#L17-3 assume !(foo_~i~0 <= foo_~size); 20845#L17-4 foo_#res := foo_~i~0; 20843#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20842#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20841#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20839#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20838#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20837#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20835#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20834#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20833#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20831#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20830#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20829#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20827#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20826#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20825#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20823#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20822#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20821#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20818#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20816#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20817#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20812#L17-3 assume !(foo_~i~0 <= foo_~size); 20810#L17-4 foo_#res := foo_~i~0; 20811#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20860#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20807#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20805#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20806#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20852#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20801#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20799#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20800#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20844#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20795#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20793#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20794#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20836#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20789#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20787#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20788#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20828#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20783#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20781#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20782#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20820#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20819#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20758#L17-3 assume !(foo_~i~0 <= foo_~size); 20753#L17-4 foo_#res := foo_~i~0; 20748#L20 [2021-11-02 22:19:05,068 INFO L793 eck$LassoCheckResult]: Loop: 20748#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 20734#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 20735#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 20751#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20725#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20726#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20739#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20776#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20775#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20774#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20773#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20772#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20771#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20770#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20769#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20768#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20767#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20766#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20765#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20764#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20763#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20762#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20761#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20760#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 20756#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 20755#L17-3 assume !(foo_~i~0 <= foo_~size); 20747#L17-4 foo_#res := foo_~i~0; 20748#L20 [2021-11-02 22:19:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:19:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1783720117, now seen corresponding path program 45 times [2021-11-02 22:19:05,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:19:05,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712345624] [2021-11-02 22:19:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:19:05,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:19:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:05,156 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:19:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:05,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:19:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:19:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1946631749, now seen corresponding path program 28 times [2021-11-02 22:19:05,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:19:05,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436718488] [2021-11-02 22:19:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:19:05,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:19:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:05,313 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:19:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:05,325 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:19:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:19:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1453430597, now seen corresponding path program 46 times [2021-11-02 22:19:05,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:19:05,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373464351] [2021-11-02 22:19:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:19:05,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:19:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:05,430 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:19:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:19:05,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:19:09,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 120 [2021-11-02 22:23:02,498 WARN L207 SmtUtils]: Spent 3.89 m on a formula simplification. DAG size of input: 1192 DAG size of output: 758 [2021-11-02 22:23:03,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:03,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 141 [2021-11-02 22:23:04,540 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:23:04,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:23:04,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:23:04,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:23:04,541 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:23:04,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:04,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:23:04,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:23:04,541 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration31_Lasso [2021-11-02 22:23:04,541 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:23:04,541 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:23:04,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:04,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:04,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:04,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:04,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:14,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:14,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:14,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:14,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:14,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:23:16,350 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:23:16,350 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:23:16,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:16,361 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:23:16,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-11-02 22:23:16,364 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 [2021-11-02 22:23:16,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:23:16,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:23:16,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:23:16,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:23:16,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:23:16,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:23:16,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:23:16,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2021-11-02 22:23:16,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:16,405 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:23:16,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2021-11-02 22:23:16,406 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 [2021-11-02 22:23:16,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:23:16,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:23:16,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:23:16,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:23:16,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:23:16,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:23:16,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:23:16,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2021-11-02 22:23:16,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:16,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:16,445 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:23:16,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-11-02 22:23:16,448 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 [2021-11-02 22:23:16,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:23:16,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:23:16,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:23:16,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:23:16,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:23:16,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:23:16,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:23:16,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:23:16,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2021-11-02 22:23:16,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:16,485 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:23:16,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2021-11-02 22:23:16,486 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 [2021-11-02 22:23:16,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:23:16,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:23:16,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:23:16,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:23:16,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:23:16,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:23:16,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:23:16,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:23:16,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2021-11-02 22:23:16,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:16,523 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:23:16,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-11-02 22:23:16,525 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 [2021-11-02 22:23:16,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:23:16,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:23:16,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:23:16,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:23:16,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:23:16,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:23:16,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:23:16,657 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2021-11-02 22:23:16,657 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 34 variables to zero. [2021-11-02 22:23:16,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:23:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:16,660 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:23:16,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:23:16,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-11-02 22:23:16,695 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:23:16,696 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:23:16,696 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#mask~0.base)_10) = -22*ULTIMATE.start_main_~i~1 + 19*v_rep(select #length ULTIMATE.start_main_~#mask~0.base)_10 Supporting invariants [] [2021-11-02 22:23:16,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2021-11-02 22:23:17,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2021-11-02 22:23:19,900 INFO L297 tatePredicateManager]: 330 out of 330 supporting invariants were superfluous and have been removed [2021-11-02 22:23:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:23:20,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:23:20,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:23:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:23:20,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 22:23:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:23:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:23:21,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2021-11-02 22:23:21,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 223 transitions. cyclomatic complexity: 8 Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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) [2021-11-02 22:23:23,083 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 223 transitions. cyclomatic complexity: 8. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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 438 states and 451 transitions. Complement of second has 53 states. [2021-11-02 22:23:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 27 states 1 stem states 25 non-accepting loop states 1 accepting loop states [2021-11-02 22:23:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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) [2021-11-02 22:23:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2021-11-02 22:23:23,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 53 transitions. Stem has 160 letters. Loop has 27 letters. [2021-11-02 22:23:23,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:23:23,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 53 transitions. Stem has 187 letters. Loop has 27 letters. [2021-11-02 22:23:23,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:23:23,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 53 transitions. Stem has 160 letters. Loop has 54 letters. [2021-11-02 22:23:23,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:23:23,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 451 transitions. [2021-11-02 22:23:23,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2021-11-02 22:23:23,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 262 states and 272 transitions. [2021-11-02 22:23:23,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-11-02 22:23:23,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-11-02 22:23:23,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 272 transitions. [2021-11-02 22:23:23,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:23:23,094 INFO L681 BuchiCegarLoop]: Abstraction has 262 states and 272 transitions. [2021-11-02 22:23:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 272 transitions. [2021-11-02 22:23:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2021-11-02 22:23:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 250 states have (on average 1.036) internal successors, (259), 249 states have internal predecessors, (259), 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) [2021-11-02 22:23:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 259 transitions. [2021-11-02 22:23:23,102 INFO L704 BuchiCegarLoop]: Abstraction has 250 states and 259 transitions. [2021-11-02 22:23:23,102 INFO L587 BuchiCegarLoop]: Abstraction has 250 states and 259 transitions. [2021-11-02 22:23:23,102 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-11-02 22:23:23,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 250 states and 259 transitions. [2021-11-02 22:23:23,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2021-11-02 22:23:23,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:23:23,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:23:23,107 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [55, 55, 10, 10, 10, 9, 9, 1, 1] [2021-11-02 22:23:23,107 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 1, 1, 1, 1, 1] [2021-11-02 22:23:23,107 INFO L791 eck$LassoCheckResult]: Stem: 23398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 23399#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 23407#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23411#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23422#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23421#L17-3 assume !(foo_~i~0 <= foo_~size); 23412#L17-4 foo_#res := foo_~i~0; 23408#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23402#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23403#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23406#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23393#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23394#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23640#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23639#L17-3 assume !(foo_~i~0 <= foo_~size); 23413#L17-4 foo_#res := foo_~i~0; 23409#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23410#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23638#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23637#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23636#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23635#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23634#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23633#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23632#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23631#L17-3 assume !(foo_~i~0 <= foo_~size); 23630#L17-4 foo_#res := foo_~i~0; 23629#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23628#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23627#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23626#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23625#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23624#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23623#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23622#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23621#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23620#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23619#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23618#L17-3 assume !(foo_~i~0 <= foo_~size); 23617#L17-4 foo_#res := foo_~i~0; 23616#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23615#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23614#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23613#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23612#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23611#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23610#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23609#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23608#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23607#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23606#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23605#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23604#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23603#L17-3 assume !(foo_~i~0 <= foo_~size); 23602#L17-4 foo_#res := foo_~i~0; 23601#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23600#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23599#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23598#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23597#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23596#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23595#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23594#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23593#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23592#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23591#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23590#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23589#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23588#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23587#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23586#L17-3 assume !(foo_~i~0 <= foo_~size); 23585#L17-4 foo_#res := foo_~i~0; 23584#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23583#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23582#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23581#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23580#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23579#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23578#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23577#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23576#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23575#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23574#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23573#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23572#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23571#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23570#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23569#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23568#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23567#L17-3 assume !(foo_~i~0 <= foo_~size); 23566#L17-4 foo_#res := foo_~i~0; 23565#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23564#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23563#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23562#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23561#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23560#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23559#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23558#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23557#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23556#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23555#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23554#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23553#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23552#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23551#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23550#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23549#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23548#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23547#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23546#L17-3 assume !(foo_~i~0 <= foo_~size); 23545#L17-4 foo_#res := foo_~i~0; 23544#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23543#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23542#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23541#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23540#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23539#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23538#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23537#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23536#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23535#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23534#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23533#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23532#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23531#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23530#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23529#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23528#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23527#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23503#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23501#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23502#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23497#L17-3 assume !(foo_~i~0 <= foo_~size); 23498#L17-4 foo_#res := foo_~i~0; 23526#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23525#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23524#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23523#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23522#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23521#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23520#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23519#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23518#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23517#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23516#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23515#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23514#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23513#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23512#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23511#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23510#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23509#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23508#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23507#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23506#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23505#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23504#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23423#L17-3 assume !(foo_~i~0 <= foo_~size); 23424#L17-4 foo_#res := foo_~i~0; 23418#L20 [2021-11-02 22:23:23,108 INFO L793 eck$LassoCheckResult]: Loop: 23418#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 23400#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 23401#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 23414#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23391#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23392#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23405#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23443#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23442#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23441#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23440#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23439#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23438#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23437#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23436#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23435#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23434#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23433#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23432#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23431#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23430#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23429#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23428#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23427#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23426#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23425#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 23417#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 23415#L17-3 assume !(foo_~i~0 <= foo_~size); 23416#L17-4 foo_#res := foo_~i~0; 23418#L20 [2021-11-02 22:23:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1783720117, now seen corresponding path program 47 times [2021-11-02 22:23:23,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:23,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937132136] [2021-11-02 22:23:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:23,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:23,232 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:23:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:23,346 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:23:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1892574009, now seen corresponding path program 29 times [2021-11-02 22:23:23,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:23,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681011650] [2021-11-02 22:23:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:23,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:23,393 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:23:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:23,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:23:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash -882376259, now seen corresponding path program 48 times [2021-11-02 22:23:23,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:23,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966110217] [2021-11-02 22:23:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:23,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:23:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5414 backedges. 253 proven. 4776 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2021-11-02 22:23:23,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:23:23,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966110217] [2021-11-02 22:23:23,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966110217] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:23:23,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132679081] [2021-11-02 22:23:23,978 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-02 22:23:23,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:23:23,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:23,983 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:23:23,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2021-11-02 22:23:25,785 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-11-02 22:23:25,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:23:25,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-02 22:23:25,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:23:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5414 backedges. 895 proven. 4129 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2021-11-02 22:23:26,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132679081] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:23:26,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:23:26,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 41 [2021-11-02 22:23:26,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936380785] [2021-11-02 22:23:31,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:31,610 INFO L244 Elim1Store]: Index analysis took 186 ms [2021-11-02 22:23:31,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 66 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 169 [2021-11-02 22:23:31,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:23:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-02 22:23:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1312, Unknown=0, NotChecked=0, Total=1640 [2021-11-02 22:23:31,915 INFO L87 Difference]: Start difference. First operand 250 states and 259 transitions. cyclomatic complexity: 13 Second operand has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 41 states have internal predecessors, (139), 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) [2021-11-02 22:23:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:23:35,263 INFO L93 Difference]: Finished difference Result 457 states and 473 transitions. [2021-11-02 22:23:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2021-11-02 22:23:35,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 473 transitions. [2021-11-02 22:23:35,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2021-11-02 22:23:35,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 431 states and 447 transitions. [2021-11-02 22:23:35,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2021-11-02 22:23:35,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2021-11-02 22:23:35,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 447 transitions. [2021-11-02 22:23:35,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:23:35,270 INFO L681 BuchiCegarLoop]: Abstraction has 431 states and 447 transitions. [2021-11-02 22:23:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 447 transitions. [2021-11-02 22:23:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 303. [2021-11-02 22:23:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 302 states have internal predecessors, (314), 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) [2021-11-02 22:23:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 314 transitions. [2021-11-02 22:23:35,279 INFO L704 BuchiCegarLoop]: Abstraction has 303 states and 314 transitions. [2021-11-02 22:23:35,279 INFO L587 BuchiCegarLoop]: Abstraction has 303 states and 314 transitions. [2021-11-02 22:23:35,279 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-11-02 22:23:35,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 314 transitions. [2021-11-02 22:23:35,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2021-11-02 22:23:35,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:23:35,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:23:35,284 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [65, 65, 11, 11, 11, 10, 10, 1, 1] [2021-11-02 22:23:35,284 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 1, 1, 1, 1, 1] [2021-11-02 22:23:35,284 INFO L791 eck$LassoCheckResult]: Stem: 24955#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 24956#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 24964#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 24977#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24978#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24973#L17-3 assume !(foo_~i~0 <= foo_~size); 24974#L17-4 foo_#res := foo_~i~0; 24965#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 24959#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 24960#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 24963#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24950#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24951#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25224#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25222#L17-3 assume !(foo_~i~0 <= foo_~size); 25223#L17-4 foo_#res := foo_~i~0; 24966#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 24967#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25221#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25220#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25219#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25218#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25217#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25216#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25215#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25214#L17-3 assume !(foo_~i~0 <= foo_~size); 25213#L17-4 foo_#res := foo_~i~0; 25212#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25211#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25210#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25209#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25208#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25207#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25206#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25205#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25204#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25203#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25202#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25201#L17-3 assume !(foo_~i~0 <= foo_~size); 25200#L17-4 foo_#res := foo_~i~0; 25199#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25198#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25197#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25196#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25195#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25194#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25193#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25192#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25191#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25190#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25189#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25188#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25187#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25186#L17-3 assume !(foo_~i~0 <= foo_~size); 25185#L17-4 foo_#res := foo_~i~0; 25184#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25183#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25182#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25181#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25180#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25179#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25178#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25177#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25176#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25175#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25174#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25173#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25172#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25171#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25170#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25169#L17-3 assume !(foo_~i~0 <= foo_~size); 25168#L17-4 foo_#res := foo_~i~0; 25167#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25166#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25165#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25164#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25163#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25162#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25161#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25160#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25159#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25158#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25157#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25156#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25155#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25154#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25153#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25152#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25151#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25150#L17-3 assume !(foo_~i~0 <= foo_~size); 25149#L17-4 foo_#res := foo_~i~0; 25148#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25147#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25146#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25145#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25144#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25143#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25142#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25141#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25140#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25139#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25138#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25137#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25136#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25135#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25134#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25133#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25132#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25131#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25130#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25129#L17-3 assume !(foo_~i~0 <= foo_~size); 25128#L17-4 foo_#res := foo_~i~0; 25127#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25126#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25125#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25124#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25123#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25122#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25121#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25120#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25119#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25118#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25117#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25116#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25115#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25114#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25113#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25112#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25111#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25110#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25108#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25105#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25103#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25101#L17-3 assume !(foo_~i~0 <= foo_~size); 25099#L17-4 foo_#res := foo_~i~0; 25098#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25097#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25096#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25095#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25094#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25093#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25092#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25091#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25090#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25089#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25088#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25087#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25086#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25085#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25084#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25083#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25082#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25081#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25078#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25077#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25076#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25072#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25073#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25109#L17-3 assume !(foo_~i~0 <= foo_~size); 25106#L17-4 foo_#res := foo_~i~0; 25104#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 25102#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 25100#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 25040#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25041#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25036#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25037#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25032#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25033#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25028#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25029#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25024#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25025#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25020#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25021#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25016#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25017#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25012#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25013#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25008#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25009#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 25080#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 25079#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24999#L17-3 assume !(foo_~i~0 <= foo_~size); 25000#L17-4 foo_#res := foo_~i~0; 24970#L20 [2021-11-02 22:23:35,285 INFO L793 eck$LassoCheckResult]: Loop: 24970#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 24957#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 24958#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 24968#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24948#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24949#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24962#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24997#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24996#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24995#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24994#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24993#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24992#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24991#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24990#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24989#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24988#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24987#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24986#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24985#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24984#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24983#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24982#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24981#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24980#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24979#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 24975#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 24976#L17-3 assume !(foo_~i~0 <= foo_~size); 24969#L17-4 foo_#res := foo_~i~0; 24970#L20 [2021-11-02 22:23:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -148998343, now seen corresponding path program 49 times [2021-11-02 22:23:35,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:35,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633073523] [2021-11-02 22:23:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:35,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:23:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 3163 proven. 1582 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2021-11-02 22:23:35,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:23:35,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633073523] [2021-11-02 22:23:35,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633073523] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:23:35,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318970282] [2021-11-02 22:23:35,790 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-02 22:23:35,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:23:35,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:23:35,792 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:23:35,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1ddfad7-2d41-405f-8a3d-2d38675fa4a4/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2021-11-02 22:23:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:23:37,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 22:23:37,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:23:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 3380 proven. 1365 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2021-11-02 22:23:38,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318970282] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:23:38,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:23:38,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2021-11-02 22:23:38,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30952085] [2021-11-02 22:23:38,254 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:23:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1892574009, now seen corresponding path program 30 times [2021-11-02 22:23:38,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:38,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810862594] [2021-11-02 22:23:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:38,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:38,285 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:23:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:38,300 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:23:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:42,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 66 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 134 [2021-11-02 22:23:42,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:23:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-02 22:23:42,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2021-11-02 22:23:42,784 INFO L87 Difference]: Start difference. First operand 303 states and 314 transitions. cyclomatic complexity: 15 Second operand has 36 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 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) [2021-11-02 22:23:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:23:44,696 INFO L93 Difference]: Finished difference Result 333 states and 340 transitions. [2021-11-02 22:23:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-11-02 22:23:44,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 340 transitions. [2021-11-02 22:23:44,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2021-11-02 22:23:44,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 279 states and 284 transitions. [2021-11-02 22:23:44,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-11-02 22:23:44,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-11-02 22:23:44,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 284 transitions. [2021-11-02 22:23:44,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:23:44,703 INFO L681 BuchiCegarLoop]: Abstraction has 279 states and 284 transitions. [2021-11-02 22:23:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 284 transitions. [2021-11-02 22:23:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 249. [2021-11-02 22:23:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 248 states have internal predecessors, (254), 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) [2021-11-02 22:23:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 254 transitions. [2021-11-02 22:23:44,710 INFO L704 BuchiCegarLoop]: Abstraction has 249 states and 254 transitions. [2021-11-02 22:23:44,710 INFO L587 BuchiCegarLoop]: Abstraction has 249 states and 254 transitions. [2021-11-02 22:23:44,710 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-11-02 22:23:44,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 254 transitions. [2021-11-02 22:23:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2021-11-02 22:23:44,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:23:44,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:23:44,715 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [66, 66, 11, 11, 11, 10, 10, 1, 1] [2021-11-02 22:23:44,715 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 1, 1, 1, 1, 1] [2021-11-02 22:23:44,716 INFO L791 eck$LassoCheckResult]: Stem: 26316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 26317#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 26325#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26329#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26343#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26341#L17-3 assume !(foo_~i~0 <= foo_~size); 26336#L17-4 foo_#res := foo_~i~0; 26326#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26320#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26321#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26553#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26552#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26551#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26550#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26549#L17-3 assume !(foo_~i~0 <= foo_~size); 26548#L17-4 foo_#res := foo_~i~0; 26327#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26328#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26330#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26324#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26311#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26312#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26557#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26556#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26555#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26554#L17-3 assume !(foo_~i~0 <= foo_~size); 26333#L17-4 foo_#res := foo_~i~0; 26334#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26547#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26546#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26545#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26544#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26543#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26542#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26541#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26540#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26539#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26538#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26537#L17-3 assume !(foo_~i~0 <= foo_~size); 26536#L17-4 foo_#res := foo_~i~0; 26535#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26534#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26533#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26532#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26531#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26530#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26529#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26528#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26527#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26526#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26525#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26524#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26523#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26522#L17-3 assume !(foo_~i~0 <= foo_~size); 26521#L17-4 foo_#res := foo_~i~0; 26520#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26519#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26518#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26517#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26516#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26515#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26514#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26513#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26512#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26511#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26510#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26509#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26508#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26507#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26506#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26505#L17-3 assume !(foo_~i~0 <= foo_~size); 26504#L17-4 foo_#res := foo_~i~0; 26503#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26502#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26501#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26500#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26499#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26498#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26497#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26496#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26495#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26494#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26493#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26492#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26491#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26490#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26489#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26488#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26487#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26486#L17-3 assume !(foo_~i~0 <= foo_~size); 26485#L17-4 foo_#res := foo_~i~0; 26484#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26483#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26482#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26481#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26480#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26479#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26478#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26477#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26476#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26475#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26474#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26473#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26472#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26471#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26470#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26469#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26468#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26467#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26466#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26465#L17-3 assume !(foo_~i~0 <= foo_~size); 26464#L17-4 foo_#res := foo_~i~0; 26463#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26462#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26461#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26460#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26459#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26458#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26457#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26456#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26455#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26454#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26453#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26452#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26451#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26450#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26449#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26448#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26447#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26446#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26445#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26444#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26443#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26442#L17-3 assume !(foo_~i~0 <= foo_~size); 26441#L17-4 foo_#res := foo_~i~0; 26440#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26439#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26438#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26437#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26436#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26435#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26434#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26433#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26432#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26431#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26430#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26429#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26428#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26427#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26426#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26425#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26424#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26423#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26422#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26421#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26420#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26393#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26394#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26389#L17-3 assume !(foo_~i~0 <= foo_~size); 26390#L17-4 foo_#res := foo_~i~0; 26419#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26418#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26417#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26416#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26415#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26414#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26413#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26412#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26411#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26410#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26409#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26408#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26407#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26406#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26405#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26404#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26403#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26402#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26401#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26400#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26399#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26398#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26397#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26396#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26395#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26342#L17-3 assume !(foo_~i~0 <= foo_~size); 26337#L17-4 foo_#res := foo_~i~0; 26332#L20 [2021-11-02 22:23:44,716 INFO L793 eck$LassoCheckResult]: Loop: 26332#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 26318#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26319#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 26335#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26309#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26310#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26323#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26362#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26361#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26360#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26359#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26358#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26357#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26356#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26355#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26354#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26353#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26352#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26351#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26350#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26349#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26348#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26347#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26346#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26345#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26344#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 26340#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 26339#L17-3 assume !(foo_~i~0 <= foo_~size); 26331#L17-4 foo_#res := foo_~i~0; 26332#L20 [2021-11-02 22:23:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1453430597, now seen corresponding path program 50 times [2021-11-02 22:23:44,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:44,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147258299] [2021-11-02 22:23:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:44,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:44,821 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:23:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:44,949 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:23:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1892574009, now seen corresponding path program 31 times [2021-11-02 22:23:44,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:44,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686413162] [2021-11-02 22:23:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:44,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:44,972 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:23:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:44,985 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:23:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:23:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash 767616589, now seen corresponding path program 51 times [2021-11-02 22:23:44,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:23:44,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334336618] [2021-11-02 22:23:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:23:44,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:23:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:45,208 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:23:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:23:45,374 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:23:48,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:48,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:23:49,009 INFO L244 Elim1Store]: Index analysis took 157 ms [2021-11-02 22:23:49,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 66 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 143