./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF --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 64bit --witnessprinter.graph.data.programhash a7eac656f4f87b6afedc7c9123b2a00f0a77432e0932a24df49c305c8202e110 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:50:50,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:50:50,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:50:50,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:50:50,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:50:50,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:50:50,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:50:50,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:50:50,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:50:50,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:50:50,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:50:50,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:50:50,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:50:50,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:50:50,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:50:50,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:50:50,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:50:50,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:50:50,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:50:50,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:50:50,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:50:50,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:50:50,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:50:50,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:50:50,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:50:50,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:50:50,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:50:50,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:50:50,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:50:50,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:50:50,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:50:50,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:50:50,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:50:50,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:50:50,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:50:50,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:50:50,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:50:50,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:50:50,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:50:50,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:50:50,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:50:50,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-20 05:50:50,738 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:50:50,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:50:50,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:50:50,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:50:50,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:50:50,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:50:50,747 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:50:50,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-20 05:50:50,748 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-20 05:50:50,748 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-20 05:50:50,749 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-20 05:50:50,749 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-20 05:50:50,750 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-20 05:50:50,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:50:50,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 05:50:50,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:50:50,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:50:50,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-20 05:50:50,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-20 05:50:50,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-20 05:50:50,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:50:50,752 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-20 05:50:50,752 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:50:50,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-20 05:50:50,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:50:50,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:50:50,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:50:50,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:50:50,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:50:50,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-20 05:50:50,757 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_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/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_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eac656f4f87b6afedc7c9123b2a00f0a77432e0932a24df49c305c8202e110 [2021-11-20 05:50:51,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:50:51,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:50:51,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:50:51,123 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:50:51,123 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:50:51,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2021-11-20 05:50:51,222 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/data/540dc02fc/5d861cc836ad4a27a958bfd6d2d3c21a/FLAGf0f6e0efb [2021-11-20 05:50:51,909 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:50:51,912 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2021-11-20 05:50:51,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/data/540dc02fc/5d861cc836ad4a27a958bfd6d2d3c21a/FLAGf0f6e0efb [2021-11-20 05:50:52,227 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/data/540dc02fc/5d861cc836ad4a27a958bfd6d2d3c21a [2021-11-20 05:50:52,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:50:52,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:50:52,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:50:52,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:50:52,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:50:52,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a50521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52, skipping insertion in model container [2021-11-20 05:50:52,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:50:52,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:50:52,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:50:52,743 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:50:52,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:50:52,853 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:50:52,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52 WrapperNode [2021-11-20 05:50:52,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:50:52,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:50:52,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:50:52,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:50:52,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,904 INFO L137 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2021-11-20 05:50:52,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:50:52,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:50:52,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:50:52,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:50:52,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:50:52,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:50:52,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:50:52,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:50:52,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (1/1) ... [2021-11-20 05:50:52,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:52,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:52,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:52,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-20 05:50:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 05:50:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 05:50:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 05:50:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 05:50:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:50:53,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:50:53,171 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:50:53,173 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:50:53,416 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:50:53,423 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:50:53,423 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 05:50:53,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:50:53 BoogieIcfgContainer [2021-11-20 05:50:53,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:50:53,427 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-20 05:50:53,427 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-20 05:50:53,441 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-20 05:50:53,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 05:50:53,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 05:50:52" (1/3) ... [2021-11-20 05:50:53,445 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fe12180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 05:50:53, skipping insertion in model container [2021-11-20 05:50:53,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 05:50:53,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:50:52" (2/3) ... [2021-11-20 05:50:53,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fe12180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 05:50:53, skipping insertion in model container [2021-11-20 05:50:53,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 05:50:53,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:50:53" (3/3) ... [2021-11-20 05:50:53,448 INFO L388 chiAutomizerObserver]: Analyzing ICFG c.02-alloca.i [2021-11-20 05:50:53,515 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-20 05:50:53,516 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-20 05:50:53,516 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-20 05:50:53,516 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-20 05:50:53,516 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-20 05:50:53,517 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-20 05:50:53,517 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-20 05:50:53,517 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-20 05:50:53,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-20 05:50:53,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:53,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:50:53,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:50:53,560 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 05:50:53,560 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-20 05:50:53,560 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-20 05:50:53,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-20 05:50:53,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:53,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:50:53,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:50:53,563 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 05:50:53,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-20 05:50:53,570 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 9#L555-5true [2021-11-20 05:50:53,571 INFO L793 eck$LassoCheckResult]: Loop: 9#L555-5true call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 13#L555-1true assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 5#L555-3true assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 9#L555-5true [2021-11-20 05:50:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-20 05:50:53,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:53,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928804634] [2021-11-20 05:50:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:53,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:53,793 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:53,880 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 35409968, now seen corresponding path program 1 times [2021-11-20 05:50:53,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:53,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339767753] [2021-11-20 05:50:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:53,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:50:53,978 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-20 05:50:53,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:50:53,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339767753] [2021-11-20 05:50:53,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339767753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:50:53,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:50:53,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 05:50:53,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830418072] [2021-11-20 05:50:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:50:53,986 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 05:50:53,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:50:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 05:50:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 05:50:54,029 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:50:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:50:54,037 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-11-20 05:50:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 05:50:54,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2021-11-20 05:50:54,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:54,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2021-11-20 05:50:54,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-11-20 05:50:54,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-11-20 05:50:54,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2021-11-20 05:50:54,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:50:54,053 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-11-20 05:50:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2021-11-20 05:50:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-11-20 05:50:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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-20 05:50:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2021-11-20 05:50:54,089 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-11-20 05:50:54,089 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-11-20 05:50:54,089 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-20 05:50:54,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2021-11-20 05:50:54,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:54,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:50:54,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:50:54,091 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 05:50:54,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-20 05:50:54,091 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 40#L555-5 [2021-11-20 05:50:54,092 INFO L793 eck$LassoCheckResult]: Loop: 40#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 41#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 36#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 37#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 38#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 39#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 40#L555-5 [2021-11-20 05:50:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-11-20 05:50:54,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:54,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448627920] [2021-11-20 05:50:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:54,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:54,163 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:54,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1097702127, now seen corresponding path program 1 times [2021-11-20 05:50:54,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:54,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759757926] [2021-11-20 05:50:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:54,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:54,224 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:54,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash 177751345, now seen corresponding path program 1 times [2021-11-20 05:50:54,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:54,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912595978] [2021-11-20 05:50:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:54,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:54,277 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:54,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:55,504 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 05:50:55,504 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 05:50:55,504 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 05:50:55,505 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 05:50:55,505 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 05:50:55,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:55,506 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 05:50:55,506 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 05:50:55,506 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration2_Lasso [2021-11-20 05:50:55,506 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 05:50:55,506 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 05:50:55,538 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-20 05:50:55,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-20 05:50:55,548 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-20 05:50:55,551 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-20 05:50:55,556 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-20 05:50:55,559 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-20 05:50:55,561 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-20 05:50:55,566 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-20 05:50:55,570 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-20 05:50:55,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-20 05:50:55,579 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-20 05:50:55,583 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-20 05:50:55,586 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-20 05:50: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-20 05:50: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-20 05:50:55,597 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-20 05:50:56,129 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-20 05:50:56,133 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-20 05:50:56,137 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-20 05:50:56,140 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-20 05:50:56,700 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 05:50:56,706 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 05:50:56,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:56,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:56,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:56,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-20 05:50: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-20 05:50:56,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:56,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:56,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:56,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:56,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:56,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:56,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:56,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:56,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:56,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:56,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:56,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:56,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-20 05:50:56,831 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-20 05:50:56,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:56,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:56,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:56,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:56,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:56,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:56,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:56,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:56,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:56,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:56,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:56,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:56,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-20 05:50:56,911 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-20 05:50:56,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:56,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:56,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:56,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:56,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:56,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:56,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:56,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:56,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:56,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:56,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:56,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-20 05:50:56,988 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-20 05:50:56,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:56,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:56,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:56,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-11-20 05:50:57,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-20 05:50:57,039 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-20 05:50:57,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:57,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:57,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:57,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,128 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-20 05:50:57,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:57,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:57,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:57,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-20 05:50:57,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,211 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-20 05:50:57,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-20 05:50:57,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:57,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:57,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:57,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-20 05:50:57,274 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-20 05:50:57,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,351 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,353 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-20 05:50:57,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-20 05:50:57,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,441 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,452 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-20 05:50:57,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:57,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-20 05:50:57,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:57,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:57,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-20 05:50:57,503 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-20 05:50:57,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,574 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,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-20 05:50:57,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-20 05:50:57,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,658 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,665 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-20 05:50:57,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:57,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:57,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:57,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-20 05:50:57,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,721 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-20 05:50:57,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-20 05:50:57,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:50:57,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:50:57,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:50:57,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,780 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-20 05:50:57,782 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-20 05:50:57,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,846 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-20 05:50:57,851 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-20 05:50:57,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,926 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-20 05:50:57,932 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-20 05:50:57,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:57,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:57,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:57,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:57,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:57,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:57,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:57,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:57,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:57,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:57,993 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:57,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-20 05:50:57,996 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-20 05:50:58,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:58,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:58,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:58,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:58,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:58,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:58,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:58,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:58,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:58,078 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:58,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-20 05:50:58,085 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-20 05:50:58,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:58,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:58,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:58,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:58,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:58,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:58,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:58,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:58,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:58,125 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:58,146 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-20 05:50:58,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-20 05:50:58,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:58,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:58,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:58,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:58,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:58,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:58,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:58,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:58,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:58,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:58,230 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:58,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-20 05:50:58,232 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-20 05:50:58,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:58,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:58,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:58,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:58,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:58,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:58,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:58,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:58,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:58,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:58,301 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:58,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-20 05:50:58,303 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-20 05:50:58,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:58,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:58,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:58,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:58,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:58,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:58,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:50:58,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:58,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:58,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:58,385 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:58,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-20 05:50:58,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-20 05:50:58,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:50:58,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:50:58,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:50:58,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:50:58,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:50:58,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:50:58,419 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 05:50:58,471 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-11-20 05:50:58,471 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-11-20 05:50:58,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:50:58,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:50:58,502 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:50:58,547 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 05:50:58,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-20 05:50:58,572 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 05:50:58,572 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 05:50:58,573 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 + 1 Supporting invariants [] [2021-11-20 05:50:58,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:58,736 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2021-11-20 05:50:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:50:58,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:50:58,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:50:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:50:58,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 05:50:58,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:50:59,083 INFO L354 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2021-11-20 05:50:59,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 35 [2021-11-20 05:50:59,294 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-20 05:50:59,299 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-20 05:50:59,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-20 05:50:59,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 22 states and 28 transitions. Complement of second has 9 states. [2021-11-20 05:50:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 05:50:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-20 05:50:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2021-11-20 05:50:59,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2021-11-20 05:50:59,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:50:59,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2021-11-20 05:50:59,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:50:59,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 12 letters. [2021-11-20 05:50:59,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:50:59,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2021-11-20 05:50:59,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:59,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2021-11-20 05:50:59,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-11-20 05:50:59,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 05:50:59,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-11-20 05:50:59,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:50:59,410 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-20 05:50:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-11-20 05:50:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-20 05:50:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-20 05:50:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-11-20 05:50:59,414 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-20 05:50:59,415 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-20 05:50:59,415 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-20 05:50:59,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2021-11-20 05:50:59,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:59,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:50:59,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:50:59,420 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:50:59,420 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 05:50:59,420 INFO L791 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 209#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 211#L555-1 assume !test_fun_#t~short7#1; 201#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 202#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 205#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 207#L558-3 [2021-11-20 05:50:59,420 INFO L793 eck$LassoCheckResult]: Loop: 207#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 215#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 207#L558-3 [2021-11-20 05:50:59,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1806908815, now seen corresponding path program 1 times [2021-11-20 05:50:59,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:59,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216837338] [2021-11-20 05:50:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:59,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:50:59,501 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-20 05:50:59,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:50:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216837338] [2021-11-20 05:50:59,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216837338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:50:59,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:50:59,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 05:50:59,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960397862] [2021-11-20 05:50:59,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:50:59,502 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 05:50:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2021-11-20 05:50:59,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:59,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47610424] [2021-11-20 05:50:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:59,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,510 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,517 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:59,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:50:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:50:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 05:50:59,588 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-20 05:50:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:50:59,600 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-11-20 05:50:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:50:59,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2021-11-20 05:50:59,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:59,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 22 transitions. [2021-11-20 05:50:59,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-11-20 05:50:59,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-11-20 05:50:59,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2021-11-20 05:50:59,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:50:59,604 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-11-20 05:50:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2021-11-20 05:50:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-20 05:50:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-20 05:50:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-11-20 05:50:59,607 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-11-20 05:50:59,607 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-11-20 05:50:59,607 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-20 05:50:59,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2021-11-20 05:50:59,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:50:59,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:50:59,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:50:59,609 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:50:59,609 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 05:50:59,609 INFO L791 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 247#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 256#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 258#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 248#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 249#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 252#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 254#L558-3 [2021-11-20 05:50:59,609 INFO L793 eck$LassoCheckResult]: Loop: 254#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 262#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 254#L558-3 [2021-11-20 05:50:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2021-11-20 05:50:59,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:59,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515847249] [2021-11-20 05:50:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:59,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,632 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,673 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2021-11-20 05:50:59,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:59,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578126565] [2021-11-20 05:50:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:59,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,692 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,699 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:50:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:50:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326070, now seen corresponding path program 2 times [2021-11-20 05:50:59,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:50:59,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134102730] [2021-11-20 05:50:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:50:59,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:50:59,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-20 05:50:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,778 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:50:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:50:59,808 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:01,329 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 05:51:01,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 05:51:01,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 05:51:01,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 05:51:01,330 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 05:51:01,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:01,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 05:51:01,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 05:51:01,330 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration4_Lasso [2021-11-20 05:51:01,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 05:51:01,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 05:51:01,335 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-20 05:51:01,338 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-20 05:51:01,340 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-20 05:51:01,342 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-20 05:51:01,344 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-20 05:51:01,347 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-20 05:51:01,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-20 05:51:01,351 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-20 05:51:01,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-20 05:51:01,356 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-20 05:51:01,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-20 05:51:01,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-20 05:51:01,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-20 05:51:01,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-20 05:51:01,798 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-20 05:51:01,800 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-20 05:51:01,802 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-20 05:51:01,805 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-20 05:51:01,807 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-20 05:51:02,223 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 05:51:02,224 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 05:51:02,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,227 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-20 05:51:02,232 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-20 05:51:02,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-20 05:51:02,271 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-20 05:51:02,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,321 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-20 05:51:02,326 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-20 05:51:02,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,378 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-20 05:51:02,381 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-20 05:51:02,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:02,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:02,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-11-20 05:51:02,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,418 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-20 05:51:02,420 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-20 05:51:02,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:02,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:02,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,488 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,495 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-20 05:51:02,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-20 05:51:02,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,534 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-20 05:51:02,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-20 05:51:02,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-11-20 05:51:02,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,597 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-20 05:51:02,603 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-20 05:51:02,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-11-20 05:51:02,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,639 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-20 05:51:02,640 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-20 05:51:02,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:02,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:02,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,719 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,721 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-20 05:51:02,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-20 05:51:02,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,790 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,792 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-20 05:51:02,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-11-20 05:51:02,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,823 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-11-20 05:51:02,825 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-20 05:51:02,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:02,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:02,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:02,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-11-20 05:51:02,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,854 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,856 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-20 05:51:02,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-11-20 05:51:02,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:02,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:02,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:02,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:02,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:02,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:02,943 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:02,945 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-20 05:51:02,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:02,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:02,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:02,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:02,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:02,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:02,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-11-20 05:51:02,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:03,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:03,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:03,019 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:03,027 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-20 05:51:03,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:03,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:03,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:03,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:03,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:03,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:03,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-11-20 05:51:03,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:03,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:03,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:03,095 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:03,097 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-20 05:51:03,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:03,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:03,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:03,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:03,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:03,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:03,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-11-20 05:51:03,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 05:51:03,152 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 05:51:03,153 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-11-20 05:51:03,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:03,169 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:03,178 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 05:51:03,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-11-20 05:51:03,208 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 05:51:03,208 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 05:51:03,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 Supporting invariants [] [2021-11-20 05:51:03,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:03,343 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-11-20 05:51:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:03,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:51:03,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:03,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 05:51:03,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:03,449 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-20 05:51:03,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-11-20 05:51:03,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:51:03,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 36 transitions. Complement of second has 7 states. [2021-11-20 05:51:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-20 05:51:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:51:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2021-11-20 05:51:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2021-11-20 05:51:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:03,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2021-11-20 05:51:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:03,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2021-11-20 05:51:03,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:03,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2021-11-20 05:51:03,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:51:03,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 32 transitions. [2021-11-20 05:51:03,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-20 05:51:03,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-20 05:51:03,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2021-11-20 05:51:03,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:03,518 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-11-20 05:51:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2021-11-20 05:51:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-11-20 05:51:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-20 05:51:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-11-20 05:51:03,526 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-20 05:51:03,526 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-20 05:51:03,526 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-20 05:51:03,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2021-11-20 05:51:03,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-20 05:51:03,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:03,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:03,528 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:51:03,528 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-20 05:51:03,528 INFO L791 eck$LassoCheckResult]: Stem: 439#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 452#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 457#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 441#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 442#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 461#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 460#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 448#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 449#L558-4 [2021-11-20 05:51:03,528 INFO L793 eck$LassoCheckResult]: Loop: 449#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 453#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 454#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 458#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 445#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 446#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 449#L558-4 [2021-11-20 05:51:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2021-11-20 05:51:03,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:03,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65336156] [2021-11-20 05:51:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:03,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:03,554 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:03,584 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1810417107, now seen corresponding path program 2 times [2021-11-20 05:51:03,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:03,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534098229] [2021-11-20 05:51:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:03,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:03,601 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:03,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash 94145286, now seen corresponding path program 1 times [2021-11-20 05:51:03,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:03,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402998672] [2021-11-20 05:51:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:03,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:03,691 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:03,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:03,751 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:05,944 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 05:51:05,944 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 05:51:05,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 05:51:05,944 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 05:51:05,944 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 05:51:05,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:05,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 05:51:05,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 05:51:05,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration5_Lasso [2021-11-20 05:51:05,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 05:51:05,945 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 05:51:05,952 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-20 05:51:05,955 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-20 05:51:05,959 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-20 05:51:05,961 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-20 05:51:05,964 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-20 05:51:05,966 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-20 05:51:05,968 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-20 05:51:05,970 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-20 05:51:05,972 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-20 05:51:06,456 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-20 05:51:06,458 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-20 05:51:06,460 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-20 05:51:06,462 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-20 05:51:06,465 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-20 05:51:06,468 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-20 05:51:06,470 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-20 05:51:06,481 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-20 05:51:06,483 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-20 05:51:06,485 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-20 05:51:06,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 05:51:06,963 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 05:51:06,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:06,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:06,977 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:06,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-11-20 05:51:06,981 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-20 05:51:06,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:06,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:06,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:06,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:06,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:06,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:06,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:06,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-11-20 05:51:07,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,017 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-11-20 05:51:07,019 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-20 05:51:07,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:07,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:07,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-11-20 05:51:07,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,057 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-11-20 05:51:07,058 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-20 05:51:07,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:07,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:07,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:07,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-11-20 05:51:07,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,096 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-11-20 05:51:07,097 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-20 05:51:07,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:07,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:07,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:07,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,144 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-11-20 05:51:07,146 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-20 05:51:07,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:07,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:07,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:07,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,182 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-11-20 05:51:07,183 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-20 05:51:07,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:07,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:07,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:07,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,219 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-11-20 05:51:07,221 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-20 05:51:07,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:51:07,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:51:07,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:51:07,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,267 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,269 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-20 05:51:07,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-11-20 05:51:07,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:07,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:07,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-11-20 05:51:07,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,307 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-11-20 05:51:07,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-20 05:51:07,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:07,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:07,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,384 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,391 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-20 05:51:07,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:07,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:07,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-11-20 05:51:07,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:51:07,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,459 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,461 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-20 05:51:07,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:51:07,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:51:07,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:51:07,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:51:07,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:51:07,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:51:07,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-11-20 05:51:07,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 05:51:07,537 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-11-20 05:51:07,537 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-11-20 05:51:07,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:51:07,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:07,540 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:51:07,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 05:51:07,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-11-20 05:51:07,575 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 05:51:07,575 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 05:51:07,575 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 Supporting invariants [] [2021-11-20 05:51:07,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:07,677 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-11-20 05:51:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:07,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:51:07,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:07,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 05:51:07,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:07,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:07,980 INFO L354 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2021-11-20 05:51:07,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 33 [2021-11-20 05:51:07,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-11-20 05:51:08,114 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-20 05:51:08,115 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-20 05:51:08,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-20 05:51:08,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 52 states and 60 transitions. Complement of second has 7 states. [2021-11-20 05:51:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-20 05:51:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-20 05:51:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2021-11-20 05:51:08,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 6 letters. [2021-11-20 05:51:08,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:08,162 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 05:51:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:08,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:51:08,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:08,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 05:51:08,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:08,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:08,387 INFO L354 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2021-11-20 05:51:08,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 33 [2021-11-20 05:51:08,523 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-20 05:51:08,525 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2021-11-20 05:51:08,525 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-20 05:51:08,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 68 states and 80 transitions. Complement of second has 13 states. [2021-11-20 05:51:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-11-20 05:51:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-20 05:51:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2021-11-20 05:51:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2021-11-20 05:51:08,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2021-11-20 05:51:08,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:08,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2021-11-20 05:51:08,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:51:08,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 80 transitions. [2021-11-20 05:51:08,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-20 05:51:08,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 63 states and 75 transitions. [2021-11-20 05:51:08,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-11-20 05:51:08,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-11-20 05:51:08,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 75 transitions. [2021-11-20 05:51:08,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:08,633 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 75 transitions. [2021-11-20 05:51:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 75 transitions. [2021-11-20 05:51:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2021-11-20 05:51:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 54 states have internal predecessors, (67), 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-20 05:51:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2021-11-20 05:51:08,644 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-11-20 05:51:08,644 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-11-20 05:51:08,644 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-20 05:51:08,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 67 transitions. [2021-11-20 05:51:08,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-20 05:51:08,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:08,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:08,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:51:08,652 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-11-20 05:51:08,652 INFO L791 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 815#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 830#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 844#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 843#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 842#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 841#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 838#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 837#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 836#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 834#L555-5 [2021-11-20 05:51:08,653 INFO L793 eck$LassoCheckResult]: Loop: 834#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 852#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 850#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 849#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 822#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 823#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 859#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 833#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 834#L555-5 [2021-11-20 05:51:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -979597524, now seen corresponding path program 2 times [2021-11-20 05:51:08,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:08,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311921842] [2021-11-20 05:51:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:08,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:08,673 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:08,693 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1670158998, now seen corresponding path program 1 times [2021-11-20 05:51:08,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:08,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93971546] [2021-11-20 05:51:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:08,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:08,703 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:08,714 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash 68653461, now seen corresponding path program 3 times [2021-11-20 05:51:08,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:08,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876610779] [2021-11-20 05:51:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:08,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:08,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876610779] [2021-11-20 05:51:08,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876610779] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961154177] [2021-11-20 05:51:08,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:51:08,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:08,919 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:08,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-20 05:51:09,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 05:51:09,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:09,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 05:51:09,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:09,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:51:09,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:09,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:09,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:09,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:51:09,238 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:51:09,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:51:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:09,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:09,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:09,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961154177] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:09,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:09,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2021-11-20 05:51:09,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274738854] [2021-11-20 05:51:09,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:09,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 05:51:09,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2021-11-20 05:51:09,850 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. cyclomatic complexity: 18 Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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-20 05:51:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:10,143 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2021-11-20 05:51:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 05:51:10,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 97 transitions. [2021-11-20 05:51:10,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-11-20 05:51:10,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 40 states and 44 transitions. [2021-11-20 05:51:10,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-11-20 05:51:10,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-11-20 05:51:10,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2021-11-20 05:51:10,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:10,152 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-11-20 05:51:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2021-11-20 05:51:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2021-11-20 05:51:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 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-20 05:51:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-11-20 05:51:10,156 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-11-20 05:51:10,156 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-11-20 05:51:10,156 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-20 05:51:10,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2021-11-20 05:51:10,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-11-20 05:51:10,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:10,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:10,158 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 1, 1, 1, 1] [2021-11-20 05:51:10,158 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 05:51:10,159 INFO L791 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1108#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1115#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1114#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1113#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1112#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1111#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1104#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1102#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1103#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1123#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1122#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1121#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1118#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1119#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1120#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1100#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1101#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1105#L558-3 [2021-11-20 05:51:10,159 INFO L793 eck$LassoCheckResult]: Loop: 1105#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1129#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1105#L558-3 [2021-11-20 05:51:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1545817006, now seen corresponding path program 4 times [2021-11-20 05:51:10,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:10,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931014825] [2021-11-20 05:51:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:10,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:10,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931014825] [2021-11-20 05:51:10,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931014825] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774038008] [2021-11-20 05:51:10,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 05:51:10,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:10,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:10,345 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:10,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-20 05:51:10,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 05:51:10,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:10,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 05:51:10,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:10,459 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:51:10,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:51:10,549 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:51:10,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:51:10,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:10,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:51:10,901 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:51:10,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 34 [2021-11-20 05:51:10,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:11,045 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 05:51:11,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2021-11-20 05:51:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:11,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:11,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:51:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:11,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774038008] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:11,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:11,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 33 [2021-11-20 05:51:11,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474342451] [2021-11-20 05:51:11,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:11,535 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 05:51:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2021-11-20 05:51:11,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748450763] [2021-11-20 05:51:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:11,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:11,539 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:11,543 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:11,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:11,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 05:51:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 05:51:11,603 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 7 Second operand has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 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-20 05:51:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:12,447 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-11-20 05:51:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 05:51:12,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2021-11-20 05:51:12,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-20 05:51:12,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 54 states and 60 transitions. [2021-11-20 05:51:12,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-11-20 05:51:12,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-11-20 05:51:12,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 60 transitions. [2021-11-20 05:51:12,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:12,451 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 60 transitions. [2021-11-20 05:51:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 60 transitions. [2021-11-20 05:51:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2021-11-20 05:51:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 44 states have internal predecessors, (51), 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-20 05:51:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-11-20 05:51:12,455 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-11-20 05:51:12,455 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-11-20 05:51:12,456 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-20 05:51:12,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2021-11-20 05:51:12,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-20 05:51:12,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:12,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:12,457 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 2, 2, 2, 1, 1, 1, 1] [2021-11-20 05:51:12,457 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1, 1] [2021-11-20 05:51:12,458 INFO L791 eck$LassoCheckResult]: Stem: 1370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1382#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1390#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1389#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1388#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1387#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1385#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1386#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1376#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1377#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1379#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1393#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1399#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1398#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1397#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1394#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1395#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1396#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1374#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1375#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1378#L558-3 [2021-11-20 05:51:12,458 INFO L793 eck$LassoCheckResult]: Loop: 1378#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1413#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1412#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1411#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1409#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1407#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1405#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1372#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1373#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1392#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1400#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1414#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1378#L558-3 [2021-11-20 05:51:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1149433719, now seen corresponding path program 5 times [2021-11-20 05:51:12,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:12,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017173517] [2021-11-20 05:51:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:12,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:12,482 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:12,509 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1788024706, now seen corresponding path program 2 times [2021-11-20 05:51:12,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138346795] [2021-11-20 05:51:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:12,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:12,519 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:12,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1472237048, now seen corresponding path program 6 times [2021-11-20 05:51:12,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:12,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475991678] [2021-11-20 05:51:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:12,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:12,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:12,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475991678] [2021-11-20 05:51:12,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475991678] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:12,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692530641] [2021-11-20 05:51:12,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 05:51:12,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:12,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:12,749 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:12,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-11-20 05:51:13,009 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-11-20 05:51:13,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:13,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 05:51:13,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:13,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:51:13,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:13,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:13,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:13,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:13,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:13,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2021-11-20 05:51:13,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:13,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:13,418 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:51:13,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:51:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 57 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:13,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:13,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 56 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:13,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692530641] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:13,909 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:13,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 35 [2021-11-20 05:51:13,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925294235] [2021-11-20 05:51:13,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:14,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-20 05:51:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 05:51:14,543 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:51:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:15,170 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2021-11-20 05:51:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 05:51:15,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 89 transitions. [2021-11-20 05:51:15,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-20 05:51:15,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 89 transitions. [2021-11-20 05:51:15,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2021-11-20 05:51:15,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2021-11-20 05:51:15,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 89 transitions. [2021-11-20 05:51:15,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:15,175 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-11-20 05:51:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 89 transitions. [2021-11-20 05:51:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2021-11-20 05:51:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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-20 05:51:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-11-20 05:51:15,182 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-11-20 05:51:15,182 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-11-20 05:51:15,183 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-20 05:51:15,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2021-11-20 05:51:15,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-11-20 05:51:15,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:15,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:15,185 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 2, 2, 2, 1, 1, 1, 1] [2021-11-20 05:51:15,185 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1, 1] [2021-11-20 05:51:15,185 INFO L791 eck$LassoCheckResult]: Stem: 1757#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1758#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1770#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1778#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1777#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1776#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1775#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1773#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1774#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1763#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1764#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1767#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1781#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1801#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1800#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1799#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1798#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1797#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1796#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1795#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1794#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1793#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1765#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1766#L558-3 [2021-11-20 05:51:15,185 INFO L793 eck$LassoCheckResult]: Loop: 1766#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1822#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1821#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1818#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1819#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1820#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1817#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1815#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1813#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1759#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1760#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1780#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1789#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1823#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1766#L558-3 [2021-11-20 05:51:15,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1420100956, now seen corresponding path program 7 times [2021-11-20 05:51:15,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:15,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108912482] [2021-11-20 05:51:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:15,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:15,209 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:15,237 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash 925716135, now seen corresponding path program 3 times [2021-11-20 05:51:15,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:15,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279547461] [2021-11-20 05:51:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:15,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:15,248 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:15,274 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1092901058, now seen corresponding path program 8 times [2021-11-20 05:51:15,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:15,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444886739] [2021-11-20 05:51:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:15,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 76 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:15,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444886739] [2021-11-20 05:51:15,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444886739] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834151730] [2021-11-20 05:51:15,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:51:15,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:15,543 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:15,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-11-20 05:51:15,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:51:15,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:15,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 05:51:15,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:15,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:51:15,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:15,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:15,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:15,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:15,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:15,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:15,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2021-11-20 05:51:15,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:15,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:16,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 65 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:16,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:16,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:16,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834151730] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:16,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:16,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 41 [2021-11-20 05:51:16,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322229279] [2021-11-20 05:51:16,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:17,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-20 05:51:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2021-11-20 05:51:17,746 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. cyclomatic complexity: 13 Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:51:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:18,820 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2021-11-20 05:51:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-20 05:51:18,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 125 transitions. [2021-11-20 05:51:18,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-11-20 05:51:18,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 125 transitions. [2021-11-20 05:51:18,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-11-20 05:51:18,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-11-20 05:51:18,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 125 transitions. [2021-11-20 05:51:18,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:18,825 INFO L681 BuchiCegarLoop]: Abstraction has 110 states and 125 transitions. [2021-11-20 05:51:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 125 transitions. [2021-11-20 05:51:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2021-11-20 05:51:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 92 states have internal predecessors, (108), 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-20 05:51:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-11-20 05:51:18,833 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-11-20 05:51:18,833 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-11-20 05:51:18,834 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-20 05:51:18,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 108 transitions. [2021-11-20 05:51:18,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-11-20 05:51:18,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:18,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:18,836 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 2, 2, 2, 1, 1, 1, 1] [2021-11-20 05:51:18,836 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1, 1] [2021-11-20 05:51:18,836 INFO L791 eck$LassoCheckResult]: Stem: 2244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2255#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2265#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2264#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2263#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2262#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2260#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2261#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2250#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2251#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2293#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2294#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2310#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2253#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2254#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2268#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 2276#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 2275#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2273#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2269#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2270#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2274#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2248#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2249#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2252#L558-3 [2021-11-20 05:51:18,837 INFO L793 eck$LassoCheckResult]: Loop: 2252#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2328#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2326#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2323#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2324#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2329#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2279#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2277#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 2278#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 2334#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2258#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2246#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2247#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2267#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2331#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2330#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2252#L558-3 [2021-11-20 05:51:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash -461689343, now seen corresponding path program 9 times [2021-11-20 05:51:18,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:18,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219984661] [2021-11-20 05:51:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:18,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:18,859 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:18,886 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1175867532, now seen corresponding path program 4 times [2021-11-20 05:51:18,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:18,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004819783] [2021-11-20 05:51:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:18,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:18,897 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:18,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1517649548, now seen corresponding path program 10 times [2021-11-20 05:51:18,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101599506] [2021-11-20 05:51:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:18,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 94 proven. 92 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:19,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:19,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101599506] [2021-11-20 05:51:19,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101599506] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:19,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434586214] [2021-11-20 05:51:19,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 05:51:19,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:19,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:19,229 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:19,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-11-20 05:51:19,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 05:51:19,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:19,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-20 05:51:19,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:19,365 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:51:19,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:51:19,434 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:51:19,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:51:19,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:19,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:19,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:19,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:19,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:51:19,965 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:51:19,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 34 [2021-11-20 05:51:20,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:20,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:20,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:20,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 109 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:20,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:21,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:51:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 94 proven. 92 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:21,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434586214] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:21,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:21,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 53 [2021-11-20 05:51:21,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156727486] [2021-11-20 05:51:21,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:22,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:22,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-20 05:51:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2260, Unknown=0, NotChecked=0, Total=2756 [2021-11-20 05:51:22,519 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. cyclomatic complexity: 18 Second operand has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 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-20 05:51:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:24,499 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2021-11-20 05:51:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-20 05:51:24,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 151 transitions. [2021-11-20 05:51:24,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-11-20 05:51:24,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 151 transitions. [2021-11-20 05:51:24,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-11-20 05:51:24,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-11-20 05:51:24,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 151 transitions. [2021-11-20 05:51:24,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:24,507 INFO L681 BuchiCegarLoop]: Abstraction has 130 states and 151 transitions. [2021-11-20 05:51:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 151 transitions. [2021-11-20 05:51:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2021-11-20 05:51:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.175) internal successors, (141), 119 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:51:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2021-11-20 05:51:24,532 INFO L704 BuchiCegarLoop]: Abstraction has 120 states and 141 transitions. [2021-11-20 05:51:24,533 INFO L587 BuchiCegarLoop]: Abstraction has 120 states and 141 transitions. [2021-11-20 05:51:24,533 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-20 05:51:24,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 141 transitions. [2021-11-20 05:51:24,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-11-20 05:51:24,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:24,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:24,535 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 2, 2, 2, 1, 1, 1, 1] [2021-11-20 05:51:24,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1, 1] [2021-11-20 05:51:24,536 INFO L791 eck$LassoCheckResult]: Stem: 2843#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2844#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2856#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2863#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2862#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2861#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2860#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2858#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2859#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2849#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2850#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2893#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2894#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2957#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2852#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2853#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2868#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2962#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2961#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 2960#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 2959#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2958#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2955#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2953#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2952#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2951#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2932#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2929#L558-3 [2021-11-20 05:51:24,536 INFO L793 eck$LassoCheckResult]: Loop: 2929#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2914#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2915#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2923#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2924#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2943#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2944#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2948#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2876#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2875#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 2857#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 2854#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2855#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2845#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2846#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2866#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2898#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2931#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2929#L558-3 [2021-11-20 05:51:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash -680935066, now seen corresponding path program 11 times [2021-11-20 05:51:24,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:24,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885136175] [2021-11-20 05:51:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:24,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:24,583 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:24,620 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1053191473, now seen corresponding path program 5 times [2021-11-20 05:51:24,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:24,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556325915] [2021-11-20 05:51:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:24,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:24,636 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:24,652 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash 98205526, now seen corresponding path program 12 times [2021-11-20 05:51:24,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:24,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918815792] [2021-11-20 05:51:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:24,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 114 proven. 130 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:25,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918815792] [2021-11-20 05:51:25,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918815792] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408697795] [2021-11-20 05:51:25,044 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 05:51:25,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:25,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:25,046 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:25,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-11-20 05:51:25,405 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-11-20 05:51:25,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:25,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 05:51:25,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:25,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:51:25,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:25,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:25,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:25,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:25,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:25,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:25,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:25,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:25,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2021-11-20 05:51:25,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:25,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:25,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:25,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:25,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:25,999 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:51:26,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:51:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 99 proven. 145 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:26,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:26,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 113 proven. 131 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:26,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408697795] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:26,832 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:26,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 55 [2021-11-20 05:51:26,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944253666] [2021-11-20 05:51:26,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:28,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-20 05:51:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2423, Unknown=0, NotChecked=0, Total=2970 [2021-11-20 05:51:28,543 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. cyclomatic complexity: 24 Second operand has 55 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 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-20 05:51:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:30,130 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2021-11-20 05:51:30,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-20 05:51:30,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 187 transitions. [2021-11-20 05:51:30,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-11-20 05:51:30,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 187 transitions. [2021-11-20 05:51:30,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 146 [2021-11-20 05:51:30,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2021-11-20 05:51:30,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 187 transitions. [2021-11-20 05:51:30,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:30,135 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 187 transitions. [2021-11-20 05:51:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 187 transitions. [2021-11-20 05:51:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2021-11-20 05:51:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.1879194630872483) internal successors, (177), 148 states have internal predecessors, (177), 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-20 05:51:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2021-11-20 05:51:30,142 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 177 transitions. [2021-11-20 05:51:30,142 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 177 transitions. [2021-11-20 05:51:30,142 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-20 05:51:30,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 177 transitions. [2021-11-20 05:51:30,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-11-20 05:51:30,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:30,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:30,144 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 5, 3, 3, 3, 3, 2, 1, 1] [2021-11-20 05:51:30,144 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-20 05:51:30,145 INFO L791 eck$LassoCheckResult]: Stem: 3520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3533#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3540#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3539#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3538#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3537#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3535#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3536#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3526#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3527#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3570#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3569#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3568#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3567#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3566#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3565#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3564#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3563#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3562#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3557#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3558#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3589#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3587#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3585#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3583#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3580#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3581#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3577#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3574#L558-4 [2021-11-20 05:51:30,145 INFO L793 eck$LassoCheckResult]: Loop: 3574#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3573#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3572#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3556#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3554#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3555#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3574#L558-4 [2021-11-20 05:51:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2129975380, now seen corresponding path program 13 times [2021-11-20 05:51:30,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531535148] [2021-11-20 05:51:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:30,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 05:51:30,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531535148] [2021-11-20 05:51:30,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531535148] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025022658] [2021-11-20 05:51:30,386 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 05:51:30,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:30,390 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:30,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-11-20 05:51:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:30,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 05:51:30,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:30,497 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:51:30,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:51:30,538 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 05:51:30,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-11-20 05:51:30,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:30,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:30,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:30,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 05:51:30,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:51:31,008 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 05:51:31,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-11-20 05:51:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 05:51:31,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:31,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 05:51:31,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025022658] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:31,327 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:31,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 33 [2021-11-20 05:51:31,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867056636] [2021-11-20 05:51:31,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:31,328 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 05:51:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1810417107, now seen corresponding path program 3 times [2021-11-20 05:51:31,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:31,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399734049] [2021-11-20 05:51:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:31,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:31,334 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:31,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:31,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 05:51:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 05:51:31,529 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. cyclomatic complexity: 31 Second operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 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-20 05:51:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:32,264 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2021-11-20 05:51:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 05:51:32,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 172 transitions. [2021-11-20 05:51:32,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-11-20 05:51:32,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 155 states and 172 transitions. [2021-11-20 05:51:32,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2021-11-20 05:51:32,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2021-11-20 05:51:32,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 172 transitions. [2021-11-20 05:51:32,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:32,269 INFO L681 BuchiCegarLoop]: Abstraction has 155 states and 172 transitions. [2021-11-20 05:51:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 172 transitions. [2021-11-20 05:51:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2021-11-20 05:51:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 105 states have internal predecessors, (123), 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-20 05:51:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2021-11-20 05:51:32,273 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 123 transitions. [2021-11-20 05:51:32,273 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 123 transitions. [2021-11-20 05:51:32,273 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-20 05:51:32,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 123 transitions. [2021-11-20 05:51:32,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-11-20 05:51:32,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:32,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:32,275 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1, 1, 1] [2021-11-20 05:51:32,275 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1, 1] [2021-11-20 05:51:32,275 INFO L791 eck$LassoCheckResult]: Stem: 4053#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4054#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 4063#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 4072#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 4071#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4070#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4069#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4067#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4068#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4058#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4059#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4107#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4108#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4125#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4126#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4149#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4150#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4076#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4061#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4062#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4158#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 4157#L558-4 [2021-11-20 05:51:32,276 INFO L793 eck$LassoCheckResult]: Loop: 4157#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 4156#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 4155#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 4154#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4153#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4152#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4151#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4080#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4081#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4092#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4093#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4104#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4105#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4123#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4142#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4139#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4140#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4079#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4074#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4075#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 4157#L558-4 [2021-11-20 05:51:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 868223250, now seen corresponding path program 2 times [2021-11-20 05:51:32,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:32,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417912255] [2021-11-20 05:51:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:32,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:32,292 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:32,315 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -557161706, now seen corresponding path program 6 times [2021-11-20 05:51:32,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25100211] [2021-11-20 05:51:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:32,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:32,333 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:32,350 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -380356185, now seen corresponding path program 14 times [2021-11-20 05:51:32,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:32,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201953468] [2021-11-20 05:51:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:32,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 68 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:32,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:32,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201953468] [2021-11-20 05:51:32,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201953468] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:32,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053805489] [2021-11-20 05:51:32,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:51:32,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:32,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:32,867 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:32,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-11-20 05:51:32,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:51:32,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:32,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-20 05:51:32,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:32,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:51:32,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:32,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:33,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:33,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:51:33,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:33,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:33,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:33,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:33,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:33,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:33,722 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:51:33,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:51:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 46 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:34,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 69 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:34,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053805489] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:34,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:34,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 61 [2021-11-20 05:51:34,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269168098] [2021-11-20 05:51:34,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:38,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-20 05:51:38,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=2992, Unknown=0, NotChecked=0, Total=3660 [2021-11-20 05:51:38,428 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. cyclomatic complexity: 20 Second operand has 61 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 61 states have internal predecessors, (112), 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-20 05:51:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:40,576 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2021-11-20 05:51:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-20 05:51:40,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 166 transitions. [2021-11-20 05:51:40,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-20 05:51:40,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 143 states and 166 transitions. [2021-11-20 05:51:40,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2021-11-20 05:51:40,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2021-11-20 05:51:40,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 166 transitions. [2021-11-20 05:51:40,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:40,581 INFO L681 BuchiCegarLoop]: Abstraction has 143 states and 166 transitions. [2021-11-20 05:51:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 166 transitions. [2021-11-20 05:51:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2021-11-20 05:51:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.1796875) internal successors, (151), 127 states have internal predecessors, (151), 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-20 05:51:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2021-11-20 05:51:40,585 INFO L704 BuchiCegarLoop]: Abstraction has 128 states and 151 transitions. [2021-11-20 05:51:40,586 INFO L587 BuchiCegarLoop]: Abstraction has 128 states and 151 transitions. [2021-11-20 05:51:40,586 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-20 05:51:40,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 151 transitions. [2021-11-20 05:51:40,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-11-20 05:51:40,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:40,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:40,588 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 1, 1, 1, 1, 1, 1] [2021-11-20 05:51:40,588 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1, 1] [2021-11-20 05:51:40,588 INFO L791 eck$LassoCheckResult]: Stem: 4707#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4708#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 4721#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 4729#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 4728#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4727#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4726#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4724#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4725#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4713#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4714#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4764#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4765#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4780#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4781#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4801#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4802#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4825#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4826#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4733#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4717#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4718#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4730#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 4723#L558-4 [2021-11-20 05:51:40,588 INFO L793 eck$LassoCheckResult]: Loop: 4723#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 4719#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 4720#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 4722#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4735#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4749#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4828#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4715#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4716#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4748#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4824#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4823#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4822#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4821#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4798#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4799#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4820#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4818#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4819#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4834#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4731#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4732#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 4723#L558-4 [2021-11-20 05:51:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1138890487, now seen corresponding path program 3 times [2021-11-20 05:51:40,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7858675] [2021-11-20 05:51:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:40,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:40,608 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:40,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1438515195, now seen corresponding path program 7 times [2021-11-20 05:51:40,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:40,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122648146] [2021-11-20 05:51:40,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:40,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:40,649 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:40,670 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash 854907505, now seen corresponding path program 15 times [2021-11-20 05:51:40,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:40,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167366010] [2021-11-20 05:51:40,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:40,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 83 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:41,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:41,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167366010] [2021-11-20 05:51:41,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167366010] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:41,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772958933] [2021-11-20 05:51:41,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:51:41,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:41,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:41,199 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:41,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-11-20 05:51:41,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-20 05:51:41,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:41,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-20 05:51:41,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:41,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:51:41,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:51:41,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:41,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:41,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:41,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:41,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:41,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:41,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:42,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:51:42,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:51:42,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:51:42,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 52 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:42,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:43,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:51:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 86 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:43,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772958933] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:43,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:43,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 23] total 67 [2021-11-20 05:51:43,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850209983] [2021-11-20 05:51:43,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:51:48,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:51:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-11-20 05:51:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=3618, Unknown=0, NotChecked=0, Total=4422 [2021-11-20 05:51:48,090 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. cyclomatic complexity: 26 Second operand has 67 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 67 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-20 05:51:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:51:50,944 INFO L93 Difference]: Finished difference Result 182 states and 214 transitions. [2021-11-20 05:51:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-11-20 05:51:50,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 214 transitions. [2021-11-20 05:51:50,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2021-11-20 05:51:50,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 214 transitions. [2021-11-20 05:51:50,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2021-11-20 05:51:50,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2021-11-20 05:51:50,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 214 transitions. [2021-11-20 05:51:50,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:51:50,949 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 214 transitions. [2021-11-20 05:51:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 214 transitions. [2021-11-20 05:51:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2021-11-20 05:51:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.1973684210526316) internal successors, (182), 151 states have internal predecessors, (182), 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-20 05:51:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2021-11-20 05:51:50,978 INFO L704 BuchiCegarLoop]: Abstraction has 152 states and 182 transitions. [2021-11-20 05:51:50,979 INFO L587 BuchiCegarLoop]: Abstraction has 152 states and 182 transitions. [2021-11-20 05:51:50,979 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-20 05:51:50,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 182 transitions. [2021-11-20 05:51:50,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2021-11-20 05:51:50,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:51:50,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:51:50,983 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1, 1, 1, 1, 1, 1] [2021-11-20 05:51:50,983 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1, 1] [2021-11-20 05:51:50,983 INFO L791 eck$LassoCheckResult]: Stem: 5484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 5497#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 5505#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 5504#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5503#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5502#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5500#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5501#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5490#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5491#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5540#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5541#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5557#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5558#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5574#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5575#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5594#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5595#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5509#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5510#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5635#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5493#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5494#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5506#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 5499#L558-4 [2021-11-20 05:51:50,983 INFO L793 eck$LassoCheckResult]: Loop: 5499#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 5495#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 5496#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 5498#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5511#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5512#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5488#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5489#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5492#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5524#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5527#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5537#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5538#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5619#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5618#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5571#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5572#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5593#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5616#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5614#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5615#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5634#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5526#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5525#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 5499#L558-4 [2021-11-20 05:51:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash -742899812, now seen corresponding path program 4 times [2021-11-20 05:51:50,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617352488] [2021-11-20 05:51:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:50,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:51,009 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:51,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -566364256, now seen corresponding path program 8 times [2021-11-20 05:51:51,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:51,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068331316] [2021-11-20 05:51:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:51,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:51,054 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:51:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:51:51,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:51:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:51:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash -165161413, now seen corresponding path program 16 times [2021-11-20 05:51:51,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:51:51,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104556537] [2021-11-20 05:51:51,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:51:51,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:51:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:51:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 109 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:51,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:51:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104556537] [2021-11-20 05:51:51,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104556537] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:51:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318968017] [2021-11-20 05:51:51,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 05:51:51,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:51:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:51:51,652 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:51:51,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-11-20 05:51:51,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 05:51:51,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:51:51,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-20 05:51:51,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:51:51,794 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:51:51,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:51:51,887 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:51:51,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:51:51,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 05:51:52,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 05:51:52,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 05:51:52,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 05:51:52,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:52,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:52,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:52,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:51:52,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:51:52,684 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:51:52,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2021-11-20 05:51:52,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:52,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:52,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:52,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:53,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:53,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:53,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:53,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:51:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 42 proven. 341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:53,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:51:54,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:51:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 107 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:51:54,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318968017] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:51:54,838 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:51:54,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 26] total 78 [2021-11-20 05:51:54,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810253672] [2021-11-20 05:51:54,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:52:00,155 WARN L227 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 196 DAG size of output: 175 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:52:00,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:52:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-20 05:52:00,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=4941, Unknown=0, NotChecked=0, Total=6006 [2021-11-20 05:52:00,225 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. cyclomatic complexity: 33 Second operand has 78 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 78 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:52:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:52:05,542 INFO L93 Difference]: Finished difference Result 239 states and 284 transitions. [2021-11-20 05:52:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-20 05:52:05,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 284 transitions. [2021-11-20 05:52:05,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2021-11-20 05:52:05,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 239 states and 284 transitions. [2021-11-20 05:52:05,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2021-11-20 05:52:05,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2021-11-20 05:52:05,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 239 states and 284 transitions. [2021-11-20 05:52:05,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:52:05,547 INFO L681 BuchiCegarLoop]: Abstraction has 239 states and 284 transitions. [2021-11-20 05:52:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states and 284 transitions. [2021-11-20 05:52:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 178. [2021-11-20 05:52:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 1.2134831460674158) internal successors, (216), 177 states have internal predecessors, (216), 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-20 05:52:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions. [2021-11-20 05:52:05,553 INFO L704 BuchiCegarLoop]: Abstraction has 178 states and 216 transitions. [2021-11-20 05:52:05,553 INFO L587 BuchiCegarLoop]: Abstraction has 178 states and 216 transitions. [2021-11-20 05:52:05,553 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-20 05:52:05,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 216 transitions. [2021-11-20 05:52:05,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2021-11-20 05:52:05,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:52:05,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:52:05,556 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1] [2021-11-20 05:52:05,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1, 1] [2021-11-20 05:52:05,556 INFO L791 eck$LassoCheckResult]: Stem: 6449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6450#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 6462#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 6470#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 6469#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6468#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6467#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6465#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6466#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6455#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6456#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6505#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6506#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6522#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6523#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6539#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6540#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6559#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6560#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6584#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6585#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6621#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6458#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6459#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6475#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6626#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6625#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 6464#L558-4 [2021-11-20 05:52:05,556 INFO L793 eck$LassoCheckResult]: Loop: 6464#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 6460#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 6461#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 6463#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6476#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6620#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6619#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6618#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6617#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6616#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6615#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6614#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6613#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6612#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6611#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6610#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6609#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6608#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6581#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6582#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6607#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6605#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6606#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6491#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 6473#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6474#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 6464#L558-4 [2021-11-20 05:52:05,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -962145535, now seen corresponding path program 5 times [2021-11-20 05:52:05,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:05,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281682346] [2021-11-20 05:52:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:05,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:05,577 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:05,603 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1184799237, now seen corresponding path program 9 times [2021-11-20 05:52:05,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:05,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973141181] [2021-11-20 05:52:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:05,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:05,622 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:05,664 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 982756613, now seen corresponding path program 17 times [2021-11-20 05:52:05,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:05,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87177633] [2021-11-20 05:52:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:05,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 128 proven. 337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:52:06,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:52:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87177633] [2021-11-20 05:52:06,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87177633] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:52:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841298271] [2021-11-20 05:52:06,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 05:52:06,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:52:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:06,247 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:52:06,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-11-20 05:52:06,693 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2021-11-20 05:52:06,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:52:06,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-20 05:52:06,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:06,746 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:52:06,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:52:06,841 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:52:06,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:52:06,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:06,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:06,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:07,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:52:07,611 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:52:07,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 34 [2021-11-20 05:52:07,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:07,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:07,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:07,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:08,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:08,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:08,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:08,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:08,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:52:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 46 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:52:08,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:52:10,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:52:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 128 proven. 337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:52:10,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841298271] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:52:10,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:52:10,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 83 [2021-11-20 05:52:10,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320374573] [2021-11-20 05:52:10,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:52:22,284 WARN L227 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 210 DAG size of output: 188 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:52:22,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:52:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-11-20 05:52:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=5605, Unknown=0, NotChecked=0, Total=6806 [2021-11-20 05:52:22,340 INFO L87 Difference]: Start difference. First operand 178 states and 216 transitions. cyclomatic complexity: 41 Second operand has 83 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 83 states have internal predecessors, (153), 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-20 05:52:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:52:28,765 INFO L93 Difference]: Finished difference Result 316 states and 379 transitions. [2021-11-20 05:52:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-20 05:52:28,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 379 transitions. [2021-11-20 05:52:28,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2021-11-20 05:52:28,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 379 transitions. [2021-11-20 05:52:28,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2021-11-20 05:52:28,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2021-11-20 05:52:28,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 379 transitions. [2021-11-20 05:52:28,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:52:28,772 INFO L681 BuchiCegarLoop]: Abstraction has 316 states and 379 transitions. [2021-11-20 05:52:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 379 transitions. [2021-11-20 05:52:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 206. [2021-11-20 05:52:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.2281553398058251) internal successors, (253), 205 states have internal predecessors, (253), 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-20 05:52:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 253 transitions. [2021-11-20 05:52:28,779 INFO L704 BuchiCegarLoop]: Abstraction has 206 states and 253 transitions. [2021-11-20 05:52:28,779 INFO L587 BuchiCegarLoop]: Abstraction has 206 states and 253 transitions. [2021-11-20 05:52:28,779 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-20 05:52:28,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 253 transitions. [2021-11-20 05:52:28,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2021-11-20 05:52:28,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:52:28,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:52:28,781 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 3, 3, 3, 2, 2, 1, 1] [2021-11-20 05:52:28,781 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-20 05:52:28,782 INFO L791 eck$LassoCheckResult]: Stem: 7594#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 7607#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 7615#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 7614#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7613#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7612#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 7610#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7611#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 7600#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7601#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 7649#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7648#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 7645#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 7644#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 7643#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 7642#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7641#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7640#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 7639#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7638#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 7637#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7633#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 7632#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 7631#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 7630#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 7629#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7628#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7627#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 7597#L558-3 [2021-11-20 05:52:28,782 INFO L793 eck$LassoCheckResult]: Loop: 7597#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7626#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 7625#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 7624#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 7623#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 7596#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7597#L558-3 [2021-11-20 05:52:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2129975378, now seen corresponding path program 18 times [2021-11-20 05:52:28,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824806241] [2021-11-20 05:52:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:28,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:28,802 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:28,826 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1570946067, now seen corresponding path program 4 times [2021-11-20 05:52:28,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:28,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106241478] [2021-11-20 05:52:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:28,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:28,832 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:28,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2097851904, now seen corresponding path program 19 times [2021-11-20 05:52:28,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305183421] [2021-11-20 05:52:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:28,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:28,859 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:28,887 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:44,775 WARN L227 SmtUtils]: Spent 15.68s on a formula simplification. DAG size of input: 300 DAG size of output: 235 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:52:46,339 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 05:52:46,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 05:52:46,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 05:52:46,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 05:52:46,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 05:52:46,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:46,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 05:52:46,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 05:52:46,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration17_Lasso [2021-11-20 05:52:46,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 05:52:46,343 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 05:52:46,351 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-20 05:52:46,361 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-20 05:52:46,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-20 05:52:46,366 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-20 05:52:46,368 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-20 05:52:46,371 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-20 05:52:46,378 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-20 05:52:46,380 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-20 05:52:46,383 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-20 05:52:46,386 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-20 05:52:46,901 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-20 05:52:46,903 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-20 05:52:46,905 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-20 05:52:46,906 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-20 05:52:46,908 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-20 05:52:46,910 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-20 05:52:46,911 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-20 05:52:46,913 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-20 05:52:47,278 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 05:52:47,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 05:52:47,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,281 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-11-20 05:52:47,282 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-20 05:52:47,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-11-20 05:52:47,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,313 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-11-20 05:52:47,315 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-20 05:52:47,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:52:47,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:52:47,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:52:47,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-11-20 05:52:47,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,345 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-11-20 05:52:47,346 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-20 05:52:47,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:52:47,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:52:47,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:52:47,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,378 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,379 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-20 05:52:47,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-11-20 05:52:47,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:52:47,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:52:47,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:52:47,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-11-20 05:52:47,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,410 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-11-20 05:52:47,411 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-20 05:52:47,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:52:47,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:52:47,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:52:47,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,442 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-11-20 05:52:47,443 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-20 05:52:47,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,477 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-11-20 05:52:47,478 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-20 05:52:47,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:52:47,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:52:47,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:52:47,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,509 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-11-20 05:52:47,510 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-20 05:52:47,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-11-20 05:52:47,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,543 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-11-20 05:52:47,544 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-20 05:52:47,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 05:52:47,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 05:52:47,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 05:52:47,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,575 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-11-20 05:52:47,576 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-20 05:52:47,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,616 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-11-20 05:52:47,617 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-20 05:52:47,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-11-20 05:52:47,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,651 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-11-20 05:52:47,652 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-20 05:52:47,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-11-20 05:52:47,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,699 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-11-20 05:52:47,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-20 05:52:47,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,734 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-11-20 05:52:47,735 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-20 05:52:47,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,768 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-11-20 05:52:47,769 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-20 05:52:47,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,801 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-11-20 05:52:47,802 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-20 05:52:47,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 05:52:47,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:47,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,835 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-11-20 05:52:47,836 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-20 05:52:47,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 05:52:47,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 05:52:47,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 05:52:47,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 05:52:47,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 05:52:47,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 05:52:47,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 05:52:47,898 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-11-20 05:52:47,899 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-11-20 05:52:47,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 05:52:47,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:47,902 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 05:52:47,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-11-20 05:52:47,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 05:52:47,910 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 05:52:47,910 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 05:52:47,911 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_4 Supporting invariants [] [2021-11-20 05:52:47,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-11-20 05:52:47,988 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-11-20 05:52:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:48,152 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-20 05:52:48,153 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-11-20 05:52:48,153 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,173 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 207 states and 254 transitions. Complement of second has 5 states. [2021-11-20 05:52:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-11-20 05:52:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-11-20 05:52:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 29 letters. Loop has 6 letters. [2021-11-20 05:52:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:52:48,178 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 05:52:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:48,379 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-20 05:52:48,379 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2021-11-20 05:52:48,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 207 states and 254 transitions. Complement of second has 5 states. [2021-11-20 05:52:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-11-20 05:52:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-11-20 05:52:48,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 29 letters. Loop has 6 letters. [2021-11-20 05:52:48,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:52:48,391 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 05:52:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:48,603 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-20 05:52:48,604 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-11-20 05:52:48,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 328 states and 421 transitions. Complement of second has 8 states. [2021-11-20 05:52:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 05:52:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-11-20 05:52:48,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 29 letters. Loop has 6 letters. [2021-11-20 05:52:48,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:52:48,639 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 05:52:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:48,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 05:52:48,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:48,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:48,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-11-20 05:52:48,856 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-20 05:52:48,856 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2021-11-20 05:52:48,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,895 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 206 states and 253 transitions. cyclomatic complexity: 50. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 343 states and 437 transitions. Complement of second has 10 states. [2021-11-20 05:52:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-11-20 05:52:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 05:52:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2021-11-20 05:52:48,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 29 letters. Loop has 6 letters. [2021-11-20 05:52:48,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:52:48,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 35 letters. Loop has 6 letters. [2021-11-20 05:52:48,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:52:48,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 29 letters. Loop has 12 letters. [2021-11-20 05:52:48,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 05:52:48,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343 states and 437 transitions. [2021-11-20 05:52:48,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-11-20 05:52:48,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343 states to 58 states and 60 transitions. [2021-11-20 05:52:48,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-11-20 05:52:48,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-11-20 05:52:48,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 60 transitions. [2021-11-20 05:52:48,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:52:48,905 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-11-20 05:52:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 60 transitions. [2021-11-20 05:52:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2021-11-20 05:52:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 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-20 05:52:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2021-11-20 05:52:48,907 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-11-20 05:52:48,908 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-11-20 05:52:48,908 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-20 05:52:48,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2021-11-20 05:52:48,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2021-11-20 05:52:48,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:52:48,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:52:48,909 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 1, 1, 1, 1, 1] [2021-11-20 05:52:48,909 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 1, 1, 1, 1, 1] [2021-11-20 05:52:48,910 INFO L791 eck$LassoCheckResult]: Stem: 9457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 9467#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 9468#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 9495#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9494#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9493#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9492#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9466#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9463#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9464#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9491#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9490#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9489#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9488#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9487#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9486#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9485#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9484#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9483#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9482#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9481#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9480#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9479#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9478#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9477#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9474#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9473#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9472#L558-1 [2021-11-20 05:52:48,910 INFO L793 eck$LassoCheckResult]: Loop: 9472#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 9470#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 9471#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 9469#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 9459#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9460#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9465#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9461#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9462#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9512#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9511#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9510#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9509#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9508#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9507#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9506#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9505#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9504#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9503#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9502#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9501#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9500#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9499#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9498#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9497#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9496#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9476#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 9475#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9472#L558-1 [2021-11-20 05:52:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 238259572, now seen corresponding path program 3 times [2021-11-20 05:52:48,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:48,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761049988] [2021-11-20 05:52:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:48,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:48,935 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:48,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash 988693432, now seen corresponding path program 10 times [2021-11-20 05:52:48,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:48,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111127043] [2021-11-20 05:52:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:48,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:48,982 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:52:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:52:49,005 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:52:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:52:49,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1583347371, now seen corresponding path program 20 times [2021-11-20 05:52:49,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:52:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671875368] [2021-11-20 05:52:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:52:49,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:52:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:52:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 128 proven. 404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:52:49,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:52:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671875368] [2021-11-20 05:52:49,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671875368] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:52:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799312025] [2021-11-20 05:52:49,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:52:49,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:52:49,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:52:49,676 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:52:49,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2021-11-20 05:52:49,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:52:49,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:52:49,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-20 05:52:49,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:52:49,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:52:49,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:52:49,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:49,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:49,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:49,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:49,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:49,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:50,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:50,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:50,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:50,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:50,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:52:50,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:52:50,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:52:50,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:52:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 47 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:52:50,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:52:52,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:52:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 126 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:52:52,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799312025] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:52:52,557 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:52:52,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 29] total 84 [2021-11-20 05:52:52,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970524483] [2021-11-20 05:52:52,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:53:06,851 WARN L227 SmtUtils]: Spent 14.29s on a formula simplification. DAG size of input: 226 DAG size of output: 205 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:53:06,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:53:06,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-11-20 05:53:06,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1284, Invalid=5688, Unknown=0, NotChecked=0, Total=6972 [2021-11-20 05:53:06,941 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. cyclomatic complexity: 4 Second operand has 84 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 84 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-20 05:53:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:53:08,140 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-11-20 05:53:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-20 05:53:08,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 92 transitions. [2021-11-20 05:53:08,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2021-11-20 05:53:08,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 62 states and 64 transitions. [2021-11-20 05:53:08,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-20 05:53:08,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-20 05:53:08,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 64 transitions. [2021-11-20 05:53:08,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:53:08,142 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-11-20 05:53:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 64 transitions. [2021-11-20 05:53:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2021-11-20 05:53:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 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-20 05:53:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-11-20 05:53:08,144 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-11-20 05:53:08,145 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-11-20 05:53:08,145 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-20 05:53:08,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 62 transitions. [2021-11-20 05:53:08,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2021-11-20 05:53:08,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:53:08,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:53:08,146 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 1, 1, 1, 1, 1] [2021-11-20 05:53:08,146 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 1, 1, 1, 1, 1] [2021-11-20 05:53:08,146 INFO L791 eck$LassoCheckResult]: Stem: 10067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10068#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 10079#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 10110#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 10069#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10070#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10075#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10071#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10072#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10073#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10074#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10076#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10126#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10125#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10124#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10123#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10122#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10121#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10120#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10119#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10118#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10117#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10116#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10115#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10114#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10113#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10112#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10111#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10086#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10085#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10082#L558-1 [2021-11-20 05:53:08,147 INFO L793 eck$LassoCheckResult]: Loop: 10082#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 10081#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 10077#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 10078#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 10080#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10109#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10108#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10107#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10106#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10105#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10104#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10103#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10102#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10101#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10100#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10099#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10098#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10097#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10096#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10095#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10094#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10093#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10092#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10091#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10090#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10089#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10088#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10087#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10084#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10083#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10082#L558-1 [2021-11-20 05:53:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:53:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1334182895, now seen corresponding path program 4 times [2021-11-20 05:53:08,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:53:08,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936224159] [2021-11-20 05:53:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:53:08,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:53:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:08,171 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:53:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:08,198 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:53:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:53:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash 946616627, now seen corresponding path program 11 times [2021-11-20 05:53:08,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:53:08,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659196549] [2021-11-20 05:53:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:53:08,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:53:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:08,215 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:53:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:08,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:53:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:53:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1144334497, now seen corresponding path program 21 times [2021-11-20 05:53:08,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:53:08,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124519040] [2021-11-20 05:53:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:53:08,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:53:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:53:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 151 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:53:08,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:53:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124519040] [2021-11-20 05:53:08,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124519040] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:53:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289766032] [2021-11-20 05:53:08,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:53:08,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:53:08,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:53:08,999 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:53:09,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2021-11-20 05:53:10,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2021-11-20 05:53:10,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:53:10,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-20 05:53:10,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:53:10,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:53:10,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:53:10,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:53:10,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:53:10,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:53:10,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:10,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:10,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:10,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:11,586 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:53:11,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:53:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 51 proven. 577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:53:11,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:53:13,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:53:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 149 proven. 479 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:53:13,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289766032] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:53:13,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:53:13,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 31] total 90 [2021-11-20 05:53:13,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442012386] [2021-11-20 05:53:13,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:53:30,249 WARN L227 SmtUtils]: Spent 16.67s on a formula simplification. DAG size of input: 240 DAG size of output: 218 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:53:30,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:53:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-11-20 05:53:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1470, Invalid=6540, Unknown=0, NotChecked=0, Total=8010 [2021-11-20 05:53:30,342 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 90 states, 90 states have (on average 1.9) internal successors, (171), 90 states have internal predecessors, (171), 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-20 05:53:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:53:31,730 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2021-11-20 05:53:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-20 05:53:31,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 98 transitions. [2021-11-20 05:53:31,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-11-20 05:53:31,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 66 states and 68 transitions. [2021-11-20 05:53:31,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-20 05:53:31,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-20 05:53:31,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 68 transitions. [2021-11-20 05:53:31,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:53:31,732 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2021-11-20 05:53:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 68 transitions. [2021-11-20 05:53:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-11-20 05:53:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.03125) internal successors, (66), 63 states have internal predecessors, (66), 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-20 05:53:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2021-11-20 05:53:31,734 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-11-20 05:53:31,734 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-11-20 05:53:31,734 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-11-20 05:53:31,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 66 transitions. [2021-11-20 05:53:31,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-11-20 05:53:31,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:53:31,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:53:31,736 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 1, 1, 1, 1, 1] [2021-11-20 05:53:31,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 1, 1, 1, 1, 1] [2021-11-20 05:53:31,736 INFO L791 eck$LassoCheckResult]: Stem: 10721#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 10731#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 10732#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 10733#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10762#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10761#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10760#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10730#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10727#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10728#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10759#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10758#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10757#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10756#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10755#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10754#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10753#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10752#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10751#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10750#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10749#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10748#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10747#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10746#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10745#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10744#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10743#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10742#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10741#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10738#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10737#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10736#L558-1 [2021-11-20 05:53:31,736 INFO L793 eck$LassoCheckResult]: Loop: 10736#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 10734#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 10735#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 10763#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 10723#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10724#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10729#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10725#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10726#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10784#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10783#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10782#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10781#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10780#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10779#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10778#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10777#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10776#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10775#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10774#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10773#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10772#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10771#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10770#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10769#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10768#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10767#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10766#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10765#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10764#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10740#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 10739#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10736#L558-1 [2021-11-20 05:53:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:53:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2045458518, now seen corresponding path program 5 times [2021-11-20 05:53:31,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:53:31,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774556801] [2021-11-20 05:53:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:53:31,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:53:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:31,762 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:53:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:31,791 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:53:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:53:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash -834487314, now seen corresponding path program 12 times [2021-11-20 05:53:31,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:53:31,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971083263] [2021-11-20 05:53:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:53:31,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:53:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:31,810 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:53:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:53:31,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:53:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:53:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash -890855529, now seen corresponding path program 22 times [2021-11-20 05:53:31,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:53:31,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495872963] [2021-11-20 05:53:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:53:31,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:53:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:53:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 175 proven. 557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:53:32,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:53:32,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495872963] [2021-11-20 05:53:32,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495872963] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:53:32,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048520437] [2021-11-20 05:53:32,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 05:53:32,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:53:32,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:53:32,712 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:53:32,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2021-11-20 05:53:32,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 05:53:32,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:53:32,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-20 05:53:32,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:53:32,922 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:53:32,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:53:32,994 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:53:32,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:53:33,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:53:33,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:53:34,022 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:53:34,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 34 [2021-11-20 05:53:34,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:34,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:35,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:35,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:35,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:53:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 31 proven. 701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:53:35,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:53:37,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:53:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 176 proven. 556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:53:37,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048520437] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:53:37,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:53:37,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35, 34] total 102 [2021-11-20 05:53:37,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834528450] [2021-11-20 05:53:37,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:54:01,045 WARN L227 SmtUtils]: Spent 23.28s on a formula simplification. DAG size of input: 254 DAG size of output: 231 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:54:01,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2021-11-20 05:54:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1789, Invalid=8513, Unknown=0, NotChecked=0, Total=10302 [2021-11-20 05:54:01,164 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. cyclomatic complexity: 4 Second operand has 102 states, 102 states have (on average 1.8431372549019607) internal successors, (188), 102 states have internal predecessors, (188), 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-20 05:54:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:03,884 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2021-11-20 05:54:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-20 05:54:03,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 104 transitions. [2021-11-20 05:54:03,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-11-20 05:54:03,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 70 states and 72 transitions. [2021-11-20 05:54:03,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-11-20 05:54:03,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-11-20 05:54:03,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 72 transitions. [2021-11-20 05:54:03,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:54:03,886 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2021-11-20 05:54:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 72 transitions. [2021-11-20 05:54:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2021-11-20 05:54:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 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-20 05:54:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-11-20 05:54:03,888 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-11-20 05:54:03,888 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-11-20 05:54:03,888 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-11-20 05:54:03,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2021-11-20 05:54:03,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-11-20 05:54:03,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:54:03,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:54:03,890 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 1, 1, 1, 1, 1] [2021-11-20 05:54:03,890 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 1, 1, 1, 1, 1] [2021-11-20 05:54:03,890 INFO L791 eck$LassoCheckResult]: Stem: 11454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11455#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 11464#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 11465#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 11498#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11497#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11496#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11495#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11463#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11460#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11461#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11494#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11493#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11492#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11491#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11490#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11489#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11488#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11487#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11486#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11485#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11484#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11483#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11482#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11481#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11480#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11479#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11478#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11477#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11476#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11475#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11474#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11471#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11470#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11469#L558-1 [2021-11-20 05:54:03,890 INFO L793 eck$LassoCheckResult]: Loop: 11469#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 11467#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 11468#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 11466#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 11456#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11457#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11462#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11458#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11459#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11521#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11520#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11519#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11518#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11517#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11516#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11515#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11514#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11513#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11512#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11511#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11510#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11509#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11508#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11507#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11506#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11505#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11504#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11503#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11502#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11501#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11500#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11499#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11473#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 11472#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 11469#L558-1 [2021-11-20 05:54:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1409386661, now seen corresponding path program 6 times [2021-11-20 05:54:03,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:03,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937222332] [2021-11-20 05:54:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:03,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:03,916 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:54:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:03,946 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:54:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1216576489, now seen corresponding path program 13 times [2021-11-20 05:54:03,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:03,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798034940] [2021-11-20 05:54:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:03,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:03,989 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:54:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:04,016 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:54:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1694358413, now seen corresponding path program 23 times [2021-11-20 05:54:04,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:04,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617687609] [2021-11-20 05:54:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:04,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 201 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:05,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617687609] [2021-11-20 05:54:05,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617687609] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:54:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113204765] [2021-11-20 05:54:05,051 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 05:54:05,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:54:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:54:05,052 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:54:05,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2021-11-20 05:54:06,779 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2021-11-20 05:54:06,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:54:06,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-20 05:54:06,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:54:06,837 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:54:06,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:54:06,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:06,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:06,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:06,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:07,411 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:54:07,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:54:07,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:07,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:07,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:54:07,869 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-20 05:54:07,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 26 [2021-11-20 05:54:07,945 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:07,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,027 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,112 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,194 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,286 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,370 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,458 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,564 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,653 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,745 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 05:54:08,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:08,842 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:54:08,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2021-11-20 05:54:08,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:09,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:54:09,125 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 05:54:09,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2021-11-20 05:54:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 55 proven. 789 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:09,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:54:13,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:54:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 346 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:13,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113204765] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:54:13,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:54:13,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 37, 36] total 109 [2021-11-20 05:54:13,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490357056] [2021-11-20 05:54:13,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:54:38,144 WARN L227 SmtUtils]: Spent 24.82s on a formula simplification. DAG size of input: 268 DAG size of output: 244 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:54:38,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:54:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2021-11-20 05:54:38,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2023, Invalid=9749, Unknown=0, NotChecked=0, Total=11772 [2021-11-20 05:54:38,260 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 109 states, 109 states have (on average 1.834862385321101) internal successors, (200), 109 states have internal predecessors, (200), 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-20 05:54:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:54:42,473 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2021-11-20 05:54:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-20 05:54:42,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 110 transitions. [2021-11-20 05:54:42,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2021-11-20 05:54:42,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 74 states and 76 transitions. [2021-11-20 05:54:42,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-11-20 05:54:42,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-11-20 05:54:42,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2021-11-20 05:54:42,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:54:42,476 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 76 transitions. [2021-11-20 05:54:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2021-11-20 05:54:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2021-11-20 05:54:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 71 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:54:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2021-11-20 05:54:42,478 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-11-20 05:54:42,478 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-11-20 05:54:42,478 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-11-20 05:54:42,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 74 transitions. [2021-11-20 05:54:42,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2021-11-20 05:54:42,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:54:42,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:54:42,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 1, 1, 1, 1, 1] [2021-11-20 05:54:42,480 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 1, 1, 1, 1, 1] [2021-11-20 05:54:42,480 INFO L791 eck$LassoCheckResult]: Stem: 12234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 12244#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 12280#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 12279#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12278#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12277#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12276#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12243#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12240#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12241#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12275#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12274#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12273#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12272#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12271#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12270#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12269#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12268#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12267#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12266#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12265#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12264#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12263#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12262#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12261#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12260#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12259#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12258#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12257#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12256#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12255#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12254#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12253#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12250#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12249#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12248#L558-1 [2021-11-20 05:54:42,481 INFO L793 eck$LassoCheckResult]: Loop: 12248#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 12247#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 12245#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 12246#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 12236#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12237#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12242#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12238#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12239#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12305#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12304#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12303#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12302#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12301#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12300#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12299#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12298#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12297#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12296#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12295#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12294#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12293#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12292#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12291#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12290#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12289#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12288#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12287#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12286#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12285#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12284#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12283#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12282#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12281#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12252#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 12251#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12248#L558-1 [2021-11-20 05:54:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1505883872, now seen corresponding path program 7 times [2021-11-20 05:54:42,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:42,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010359241] [2021-11-20 05:54:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:42,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:42,510 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:54:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:42,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:54:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash 898902308, now seen corresponding path program 14 times [2021-11-20 05:54:42,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:42,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184404477] [2021-11-20 05:54:42,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:42,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:42,573 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:54:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:54:42,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:54:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:54:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -414950269, now seen corresponding path program 24 times [2021-11-20 05:54:42,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:54:42,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400738299] [2021-11-20 05:54:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:54:42,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:54:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:54:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 228 proven. 736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:43,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:54:43,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400738299] [2021-11-20 05:54:43,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400738299] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:54:43,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392485773] [2021-11-20 05:54:43,720 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 05:54:43,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:54:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:54:43,722 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:54:43,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2021-11-20 05:54:45,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2021-11-20 05:54:45,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:54:45,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-20 05:54:45,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:54:45,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:54:46,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:54:46,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:54:46,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:54:46,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2021-11-20 05:54:46,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:46,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:46,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:54:47,697 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:54:47,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:54:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 63 proven. 901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:47,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:54:50,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:54:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 230 proven. 734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:54:50,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392485773] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:54:50,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:54:50,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 37] total 110 [2021-11-20 05:54:50,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990594304] [2021-11-20 05:54:50,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:55:21,785 WARN L227 SmtUtils]: Spent 31.31s on a formula simplification. DAG size of input: 282 DAG size of output: 257 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:55:21,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:55:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-11-20 05:55:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=9841, Unknown=0, NotChecked=0, Total=11990 [2021-11-20 05:55:21,886 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. cyclomatic complexity: 4 Second operand has 110 states, 110 states have (on average 1.8818181818181818) internal successors, (207), 110 states have internal predecessors, (207), 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-20 05:55:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:55:24,151 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2021-11-20 05:55:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-20 05:55:24,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 116 transitions. [2021-11-20 05:55:24,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2021-11-20 05:55:24,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 78 states and 80 transitions. [2021-11-20 05:55:24,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-11-20 05:55:24,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-11-20 05:55:24,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 80 transitions. [2021-11-20 05:55:24,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:55:24,154 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 80 transitions. [2021-11-20 05:55:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 80 transitions. [2021-11-20 05:55:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-11-20 05:55:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 75 states have internal predecessors, (78), 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-20 05:55:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2021-11-20 05:55:24,157 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-11-20 05:55:24,157 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-11-20 05:55:24,157 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-11-20 05:55:24,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 78 transitions. [2021-11-20 05:55:24,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2021-11-20 05:55:24,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:55:24,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:55:24,159 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 1, 1, 1, 1, 1] [2021-11-20 05:55:24,159 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 1, 1, 1, 1, 1] [2021-11-20 05:55:24,159 INFO L791 eck$LassoCheckResult]: Stem: 13022#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 13032#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 13070#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 13069#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13068#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13067#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13066#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13031#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13028#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13029#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13065#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13064#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13063#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13062#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13061#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13060#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13059#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13058#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13057#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13056#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13055#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13054#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13053#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13052#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13051#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13050#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13049#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13048#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13047#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13046#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13045#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13044#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13043#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13042#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13041#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13038#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13037#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13036#L558-1 [2021-11-20 05:55:24,160 INFO L793 eck$LassoCheckResult]: Loop: 13036#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 13035#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 13033#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 13034#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 13024#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13025#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13030#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13026#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13027#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13097#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13096#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13095#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13094#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13093#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13092#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13091#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13090#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13089#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13088#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13087#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13086#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13085#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13084#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13083#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13082#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13081#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13080#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13079#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13078#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13077#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13076#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13075#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13074#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13073#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13072#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13071#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13040#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13039#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13036#L558-1 [2021-11-20 05:55:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash -249576869, now seen corresponding path program 8 times [2021-11-20 05:55:24,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:24,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714632468] [2021-11-20 05:55:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:24,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:55:24,205 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:55:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:55:24,239 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:55:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash 556692383, now seen corresponding path program 15 times [2021-11-20 05:55:24,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:24,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377882275] [2021-11-20 05:55:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:24,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:55:24,271 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:55:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:55:24,305 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:55:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:55:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1463573895, now seen corresponding path program 25 times [2021-11-20 05:55:24,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:55:24,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041300618] [2021-11-20 05:55:24,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:55:24,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:55:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 257 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:55:25,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:55:25,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041300618] [2021-11-20 05:55:25,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041300618] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:55:25,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988913209] [2021-11-20 05:55:25,439 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 05:55:25,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:55:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:55:25,441 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:55:25,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2021-11-20 05:55:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:55:25,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-20 05:55:25,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:55:25,596 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:55:25,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:55:25,677 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:55:25,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:55:25,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 05:55:25,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:25,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:25,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:25,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:55:26,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:55:27,073 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:55:27,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2021-11-20 05:55:27,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:27,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:55:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 37 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:55:28,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:55:32,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:55:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 263 proven. 829 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:55:32,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988913209] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:55:32,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:55:32,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 41, 40] total 121 [2021-11-20 05:55:32,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165345272] [2021-11-20 05:55:32,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:56:22,074 WARN L227 SmtUtils]: Spent 49.79s on a formula simplification. DAG size of input: 296 DAG size of output: 270 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:56:22,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:56:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2021-11-20 05:56:22,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2513, Invalid=12007, Unknown=0, NotChecked=0, Total=14520 [2021-11-20 05:56:22,184 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. cyclomatic complexity: 4 Second operand has 121 states, 121 states have (on average 1.8512396694214877) internal successors, (224), 121 states have internal predecessors, (224), 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-20 05:56:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:56:26,172 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2021-11-20 05:56:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-11-20 05:56:26,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 122 transitions. [2021-11-20 05:56:26,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-11-20 05:56:26,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 82 states and 84 transitions. [2021-11-20 05:56:26,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-11-20 05:56:26,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-11-20 05:56:26,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2021-11-20 05:56:26,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:56:26,174 INFO L681 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2021-11-20 05:56:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2021-11-20 05:56:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2021-11-20 05:56:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.025) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:56:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2021-11-20 05:56:26,176 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-11-20 05:56:26,176 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-11-20 05:56:26,176 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-11-20 05:56:26,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 82 transitions. [2021-11-20 05:56:26,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2021-11-20 05:56:26,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:56:26,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:56:26,178 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 1, 1, 1, 1, 1] [2021-11-20 05:56:26,178 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 1, 1, 1, 1, 1] [2021-11-20 05:56:26,178 INFO L791 eck$LassoCheckResult]: Stem: 13894#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 13906#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 13948#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 13896#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13897#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13902#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13898#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13899#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13900#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13901#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13903#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13973#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13972#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13971#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13970#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13969#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13968#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13967#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13966#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13965#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13964#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13963#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13962#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13961#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13960#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13959#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13958#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13957#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13956#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13955#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13954#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13953#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13952#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13951#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13950#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13949#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13947#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13913#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13912#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13909#L558-1 [2021-11-20 05:56:26,178 INFO L793 eck$LassoCheckResult]: Loop: 13909#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 13908#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 13904#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 13905#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 13907#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13946#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13945#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13944#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13943#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13942#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13941#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13940#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13939#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13938#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13937#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13936#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13935#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13934#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13933#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13932#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13931#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13930#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13929#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13928#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13927#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13926#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13925#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13924#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13923#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13922#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13921#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13920#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13919#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13918#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13917#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13916#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13915#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13914#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13911#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 13910#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 13909#L558-1 [2021-11-20 05:56:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:56:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 674798358, now seen corresponding path program 9 times [2021-11-20 05:56:26,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:56:26,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676207962] [2021-11-20 05:56:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:56:26,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:56:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:56:26,211 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:56:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:56:26,259 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:56:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:56:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1889531046, now seen corresponding path program 16 times [2021-11-20 05:56:26,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:56:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667784602] [2021-11-20 05:56:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:56:26,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:56:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:56:26,325 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:56:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:56:26,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:56:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:56:26,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1564136081, now seen corresponding path program 26 times [2021-11-20 05:56:26,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:56:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622839132] [2021-11-20 05:56:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:56:26,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:56:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:56:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 288 proven. 940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:56:27,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:56:27,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622839132] [2021-11-20 05:56:27,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622839132] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:56:27,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144952143] [2021-11-20 05:56:27,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:56:27,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:56:27,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:56:27,558 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:56:27,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2021-11-20 05:56:27,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:56:27,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:56:27,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-20 05:56:27,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:56:27,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:56:27,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:56:27,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:27,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:27,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:27,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:27,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:27,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:27,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:56:28,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:56:28,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2021-11-20 05:56:28,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:28,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:28,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:29,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:56:30,014 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:56:30,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:56:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 71 proven. 1157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:56:30,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:56:33,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:56:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 294 proven. 934 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:56:33,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144952143] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:56:33,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:56:33,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 42, 41] total 122 [2021-11-20 05:56:33,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139352799] [2021-11-20 05:56:33,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:57:31,521 WARN L227 SmtUtils]: Spent 57.90s on a formula simplification. DAG size of input: 310 DAG size of output: 283 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:57:31,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:57:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2021-11-20 05:57:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2642, Invalid=12120, Unknown=0, NotChecked=0, Total=14762 [2021-11-20 05:57:31,626 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. cyclomatic complexity: 4 Second operand has 122 states, 122 states have (on average 1.8934426229508197) internal successors, (231), 122 states have internal predecessors, (231), 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-20 05:57:34,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:57:34,108 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2021-11-20 05:57:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-11-20 05:57:34,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 128 transitions. [2021-11-20 05:57:34,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-11-20 05:57:34,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 86 states and 88 transitions. [2021-11-20 05:57:34,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-11-20 05:57:34,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-11-20 05:57:34,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 88 transitions. [2021-11-20 05:57:34,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:57:34,111 INFO L681 BuchiCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-11-20 05:57:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 88 transitions. [2021-11-20 05:57:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2021-11-20 05:57:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 83 states have internal predecessors, (86), 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-20 05:57:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2021-11-20 05:57:34,114 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-11-20 05:57:34,114 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-11-20 05:57:34,114 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-11-20 05:57:34,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 86 transitions. [2021-11-20 05:57:34,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-11-20 05:57:34,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:57:34,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:57:34,115 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 1, 1, 1, 1, 1] [2021-11-20 05:57:34,115 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 1, 1, 1, 1, 1] [2021-11-20 05:57:34,116 INFO L791 eck$LassoCheckResult]: Stem: 14770#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14771#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 14782#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 14825#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 14772#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14773#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14778#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14774#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14775#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14776#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14777#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14779#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14853#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14852#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14851#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14850#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14849#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14848#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14847#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14846#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14845#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14844#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14843#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14842#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14841#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14840#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14839#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14838#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14837#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14836#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14835#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14834#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14833#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14832#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14831#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14830#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14829#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14828#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14827#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14826#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14789#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14788#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14785#L558-1 [2021-11-20 05:57:34,116 INFO L793 eck$LassoCheckResult]: Loop: 14785#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 14784#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 14780#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 14781#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 14783#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14824#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14823#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14822#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14821#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14820#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14819#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14818#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14817#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14816#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14815#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14814#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14813#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14812#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14811#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14810#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14809#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14808#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14807#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14806#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14805#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14804#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14803#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14802#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14801#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14800#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14799#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14798#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14797#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14796#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14795#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14794#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14793#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14792#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14791#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14790#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14787#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 14786#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 14785#L558-1 [2021-11-20 05:57:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:57:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash -58838767, now seen corresponding path program 10 times [2021-11-20 05:57:34,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:57:34,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936779057] [2021-11-20 05:57:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:57:34,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:57:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:57:34,147 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:57:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:57:34,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:57:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:57:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash 931831893, now seen corresponding path program 17 times [2021-11-20 05:57:34,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:57:34,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644243494] [2021-11-20 05:57:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:57:34,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:57:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:57:34,222 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:57:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:57:34,261 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:57:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:57:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1865253531, now seen corresponding path program 27 times [2021-11-20 05:57:34,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:57:34,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520363843] [2021-11-20 05:57:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:57:34,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:57:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:57:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 321 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:57:35,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:57:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520363843] [2021-11-20 05:57:35,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520363843] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:57:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560000281] [2021-11-20 05:57:35,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:57:35,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:57:35,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:57:35,593 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:57:35,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2021-11-20 05:57:39,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-11-20 05:57:39,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:57:39,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-20 05:57:39,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:57:39,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 05:57:39,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 05:57:39,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:39,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:39,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:39,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:39,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:39,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 05:57:40,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 05:57:40,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2021-11-20 05:57:40,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:40,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:40,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:40,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:57:41,896 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 05:57:41,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 05:57:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 75 proven. 1297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:57:41,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:57:45,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 05:57:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 329 proven. 1043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:57:45,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560000281] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:57:45,561 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:57:45,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 43] total 128 [2021-11-20 05:57:45,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001568268] [2021-11-20 05:57:45,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:58:58,131 WARN L227 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 324 DAG size of output: 296 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 05:58:58,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:58:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2021-11-20 05:58:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2908, Invalid=13348, Unknown=0, NotChecked=0, Total=16256 [2021-11-20 05:58:58,255 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. cyclomatic complexity: 4 Second operand has 128 states, 128 states have (on average 1.8984375) internal successors, (243), 128 states have internal predecessors, (243), 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-20 05:59:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:59:00,946 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2021-11-20 05:59:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-20 05:59:00,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 134 transitions. [2021-11-20 05:59:00,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-11-20 05:59:00,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 90 states and 92 transitions. [2021-11-20 05:59:00,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-11-20 05:59:00,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-11-20 05:59:00,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 92 transitions. [2021-11-20 05:59:00,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 05:59:00,949 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2021-11-20 05:59:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 92 transitions. [2021-11-20 05:59:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-11-20 05:59:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 87 states have internal predecessors, (90), 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-20 05:59:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2021-11-20 05:59:00,952 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2021-11-20 05:59:00,952 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2021-11-20 05:59:00,952 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-11-20 05:59:00,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 90 transitions. [2021-11-20 05:59:00,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-11-20 05:59:00,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 05:59:00,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 05:59:00,953 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 1, 1, 1, 1, 1] [2021-11-20 05:59:00,953 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 1, 1, 1, 1, 1] [2021-11-20 05:59:00,954 INFO L791 eck$LassoCheckResult]: Stem: 15690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15691#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 15700#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 15701#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 15702#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15743#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15742#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15741#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15699#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15696#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15697#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15740#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15739#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15738#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15737#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15736#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15735#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15734#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15733#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15732#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15731#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15730#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15729#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15728#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15727#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15726#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15725#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15724#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15723#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15722#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15721#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15720#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15719#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15718#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15717#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15716#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15715#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15714#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15713#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15712#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15711#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15710#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15707#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15706#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15705#L558-1 [2021-11-20 05:59:00,954 INFO L793 eck$LassoCheckResult]: Loop: 15705#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 15703#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 15704#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 15744#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 15692#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15693#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15698#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15694#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15695#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15777#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15776#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15775#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15774#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15773#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15772#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15771#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15770#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15769#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15768#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15767#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15766#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15765#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15764#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15763#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15762#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15761#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15760#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15759#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15758#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15757#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15756#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15755#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15754#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15753#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15752#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15751#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15750#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15749#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15748#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15747#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15746#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15745#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15709#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 15708#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 15705#L558-1 [2021-11-20 05:59:00,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -709479348, now seen corresponding path program 11 times [2021-11-20 05:59:00,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:59:00,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868271666] [2021-11-20 05:59:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:00,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:59:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:59:00,987 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:59:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:59:01,032 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:59:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2137252496, now seen corresponding path program 18 times [2021-11-20 05:59:01,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:59:01,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089477934] [2021-11-20 05:59:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:01,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:59:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:59:01,067 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:59:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:59:01,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:59:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:59:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash 280302171, now seen corresponding path program 28 times [2021-11-20 05:59:01,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:59:01,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069060221] [2021-11-20 05:59:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:59:01,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:59:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:59:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 356 proven. 1168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:59:02,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:59:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069060221] [2021-11-20 05:59:02,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069060221] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:59:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78061120] [2021-11-20 05:59:02,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 05:59:02,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:59:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:59:02,411 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:59:02,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2021-11-20 05:59:02,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 05:59:02,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:59:02,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-20 05:59:02,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:59:02,633 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 05:59:02,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 05:59:02,751 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 05:59:02,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 05:59:02,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:02,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:03,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:04,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:04,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 05:59:04,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 05:59:04,570 INFO L354 Elim1Store]: treesize reduction 20, result has 41.2 percent of original size [2021-11-20 05:59:04,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 34 [2021-11-20 05:59:04,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:04,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:04,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:05,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 05:59:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 43 proven. 1481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:59:06,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:59:11,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 05:59:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 368 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:59:11,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78061120] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:59:11,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:59:11,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 47, 46] total 139 [2021-11-20 05:59:11,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286184190] [2021-11-20 05:59:11,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:00:31,145 WARN L227 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 338 DAG size of output: 309 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:00:31,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:00:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2021-11-20 06:00:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3326, Invalid=15856, Unknown=0, NotChecked=0, Total=19182 [2021-11-20 06:00:31,264 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. cyclomatic complexity: 4 Second operand has 139 states, 139 states have (on average 1.870503597122302) internal successors, (260), 139 states have internal predecessors, (260), 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-20 06:00:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:00:36,336 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2021-11-20 06:00:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-11-20 06:00:36,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 140 transitions. [2021-11-20 06:00:36,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-11-20 06:00:36,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 94 states and 96 transitions. [2021-11-20 06:00:36,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-11-20 06:00:36,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-11-20 06:00:36,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 96 transitions. [2021-11-20 06:00:36,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:00:36,339 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2021-11-20 06:00:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 96 transitions. [2021-11-20 06:00:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2021-11-20 06:00:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 91 states have internal predecessors, (94), 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-20 06:00:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2021-11-20 06:00:36,341 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 94 transitions. [2021-11-20 06:00:36,341 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 94 transitions. [2021-11-20 06:00:36,342 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-11-20 06:00:36,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 94 transitions. [2021-11-20 06:00:36,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2021-11-20 06:00:36,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:00:36,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:00:36,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 1, 1, 1, 1, 1] [2021-11-20 06:00:36,343 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [21, 20, 1, 1, 1, 1, 1] [2021-11-20 06:00:36,344 INFO L791 eck$LassoCheckResult]: Stem: 16700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 16712#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 16756#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 16755#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16754#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16753#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16752#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16709#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16706#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16707#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16751#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16750#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16749#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16748#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16747#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16746#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16745#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16744#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16743#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16742#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16741#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16740#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16739#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16738#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16737#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16736#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16735#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16734#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16733#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16732#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16731#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16730#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16729#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16728#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16727#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16726#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16725#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16724#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16723#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16722#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16721#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16720#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16719#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16716#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16715#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16714#L558-1 [2021-11-20 06:00:36,344 INFO L793 eck$LassoCheckResult]: Loop: 16714#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 16713#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 16710#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 16711#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 16702#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16703#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16708#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16704#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16705#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16791#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16790#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16789#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16788#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16787#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16786#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16785#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16784#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16783#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16782#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16781#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16780#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16779#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16778#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16777#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16776#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16775#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16774#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16773#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16772#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16771#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16770#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16769#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16768#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16767#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16766#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16765#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16764#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16763#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16762#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16761#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16760#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16759#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16758#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16757#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16718#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 16717#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 16714#L558-1 [2021-11-20 06:00:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:00:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1090147527, now seen corresponding path program 12 times [2021-11-20 06:00:36,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:00:36,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712877757] [2021-11-20 06:00:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:00:36,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:00:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:00:36,392 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:00:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:00:36,433 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:00:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:00:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 905282059, now seen corresponding path program 19 times [2021-11-20 06:00:36,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:00:36,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828786426] [2021-11-20 06:00:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:00:36,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:00:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:00:36,467 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:00:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:00:36,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:00:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:00:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1032426415, now seen corresponding path program 29 times [2021-11-20 06:00:36,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:00:36,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161679842] [2021-11-20 06:00:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:00:36,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:00:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:00:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 393 proven. 1291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:00:37,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:00:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161679842] [2021-11-20 06:00:37,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161679842] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:00:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362422244] [2021-11-20 06:00:37,994 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:00:37,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:00:37,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:00:37,995 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:00:37,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2021-11-20 06:00:42,068 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2021-11-20 06:00:42,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:00:42,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-20 06:00:42,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:00:42,135 INFO L354 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2021-11-20 06:00:42,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2021-11-20 06:00:42,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:00:42,701 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 06:00:42,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-11-20 06:00:42,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 06:00:42,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-20 06:00:42,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:00:43,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-20 06:00:43,862 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-20 06:00:43,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 28 [2021-11-20 06:00:43,957 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:43,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,054 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,160 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,269 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,370 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,488 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,607 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,719 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,834 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 06:00:44,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:44,947 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-20 06:00:44,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2021-11-20 06:00:45,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:45,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:46,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-20 06:00:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 65 proven. 1619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:00:46,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:00:53,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2021-11-20 06:00:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 527 proven. 1157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:00:53,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362422244] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:00:53,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:00:53,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 49, 48] total 145 [2021-11-20 06:00:53,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622379308] [2021-11-20 06:00:53,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:02:47,426 WARN L227 SmtUtils]: Spent 1.90m on a formula simplification. DAG size of input: 352 DAG size of output: 322 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:02:47,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:02:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2021-11-20 06:02:47,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3464, Invalid=17416, Unknown=0, NotChecked=0, Total=20880 [2021-11-20 06:02:47,535 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. cyclomatic complexity: 4 Second operand has 145 states, 145 states have (on average 1.8758620689655172) internal successors, (272), 145 states have internal predecessors, (272), 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-20 06:02:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:02:54,709 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2021-11-20 06:02:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-11-20 06:02:54,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 146 transitions. [2021-11-20 06:02:54,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-11-20 06:02:54,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 98 states and 100 transitions. [2021-11-20 06:02:54,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-11-20 06:02:54,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2021-11-20 06:02:54,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 100 transitions. [2021-11-20 06:02:54,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:02:54,712 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-11-20 06:02:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 100 transitions. [2021-11-20 06:02:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2021-11-20 06:02:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 95 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-20 06:02:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2021-11-20 06:02:54,716 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2021-11-20 06:02:54,716 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2021-11-20 06:02:54,716 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-11-20 06:02:54,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 98 transitions. [2021-11-20 06:02:54,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2021-11-20 06:02:54,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:02:54,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:02:54,718 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 1, 1, 1, 1, 1] [2021-11-20 06:02:54,718 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [22, 21, 1, 1, 1, 1, 1] [2021-11-20 06:02:54,718 INFO L791 eck$LassoCheckResult]: Stem: 17756#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 17766#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 17814#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 17813#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17812#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17811#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17810#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17765#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17762#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17763#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17809#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17808#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17807#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17806#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17805#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17804#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17803#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17802#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17801#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17800#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17799#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17798#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17797#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17796#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17795#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17794#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17793#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17792#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17791#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17790#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17789#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17788#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17787#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17786#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17785#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17784#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17783#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17782#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17781#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17780#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17779#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17778#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17777#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17776#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17775#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17772#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17771#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17770#L558-1 [2021-11-20 06:02:54,719 INFO L793 eck$LassoCheckResult]: Loop: 17770#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 17769#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 17767#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 17768#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 17758#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17759#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17764#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17760#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17761#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17851#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17850#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17849#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17848#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17847#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17846#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17845#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17844#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17843#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17842#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17841#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17840#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17839#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17838#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17837#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17836#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17835#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17834#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17833#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17832#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17831#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17830#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17829#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17828#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17827#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17826#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17825#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17824#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17823#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17822#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17821#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17820#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17819#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17818#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17817#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17816#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17815#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17774#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 17773#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17770#L558-1 [2021-11-20 06:02:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:02:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash -340245886, now seen corresponding path program 13 times [2021-11-20 06:02:54,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:02:54,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789725819] [2021-11-20 06:02:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:02:54,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:02:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:02:54,756 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:02:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:02:54,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:02:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:02:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1902301498, now seen corresponding path program 20 times [2021-11-20 06:02:54,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:02:54,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612249374] [2021-11-20 06:02:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:02:54,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:02:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:02:54,837 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:02:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:02:54,883 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:02:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:02:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1751124807, now seen corresponding path program 30 times [2021-11-20 06:02:54,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:02:54,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113437856] [2021-11-20 06:02:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:02:54,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:02:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:02:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 432 proven. 1420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:02:56,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:02:56,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113437856] [2021-11-20 06:02:56,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113437856] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:02:56,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819148125] [2021-11-20 06:02:56,486 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:02:56,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:02:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:02:56,487 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:02:56,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e5fd38e-8cbe-47e1-bf17-4850ecc49fe9/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2021-11-20 06:03:07,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2021-11-20 06:03:07,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:03:07,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-20 06:03:07,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:03:07,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-20 06:03:07,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-20 06:03:07,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:07,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:08,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-20 06:03:08,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-20 06:03:08,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2021-11-20 06:03:08,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:08,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-20 06:03:09,945 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:03:09,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-20 06:03:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 87 proven. 1765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:03:09,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:03:14,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-20 06:03:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 446 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:03:14,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819148125] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:03:14,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:03:14,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 50, 49] total 146 [2021-11-20 06:03:14,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558704567] [2021-11-20 06:03:14,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton