./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R --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 8fbd99b1bfb27b318d252229087f8d9132096866b72085e8874326b5a6d541b4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:48:02,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:48:02,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:48:02,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:48:02,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:48:02,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:48:02,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:48:02,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:48:02,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:48:02,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:48:02,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:48:02,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:48:02,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:48:02,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:48:02,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:48:02,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:48:02,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:48:02,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:48:02,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:48:02,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:48:02,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:48:02,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:48:02,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:48:02,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:48:02,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:48:02,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:48:02,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:48:02,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:48:02,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:48:02,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:48:02,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:48:02,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:48:02,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:48:02,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:48:02,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:48:02,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:48:02,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:48:02,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:48:02,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:48:02,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:48:02,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:48:02,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-25 15:48:02,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:48:02,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:48:02,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:48:02,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:48:02,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:48:02,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:48:02,765 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:48:02,766 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 15:48:02,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 15:48:02,766 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 15:48:02,767 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 15:48:02,767 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 15:48:02,767 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 15:48:02,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:48:02,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:48:02,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:48:02,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:48:02,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 15:48:02,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 15:48:02,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 15:48:02,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:48:02,770 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 15:48:02,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:48:02,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 15:48:02,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:48:02,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:48:02,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:48:02,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:48:02,774 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 15:48:02,774 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_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/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_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R 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 -> 8fbd99b1bfb27b318d252229087f8d9132096866b72085e8874326b5a6d541b4 [2022-11-25 15:48:03,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:48:03,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:48:03,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:48:03,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:48:03,165 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:48:03,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2022-11-25 15:48:06,200 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:48:06,503 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:48:06,504 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2022-11-25 15:48:06,514 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/data/9dcb82653/393bc4d729a74608ac99a598ca944e21/FLAG932764c13 [2022-11-25 15:48:06,530 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/data/9dcb82653/393bc4d729a74608ac99a598ca944e21 [2022-11-25 15:48:06,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:48:06,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:48:06,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:48:06,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:48:06,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:48:06,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:48:06" (1/1) ... [2022-11-25 15:48:06,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25593173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:06, skipping insertion in model container [2022-11-25 15:48:06,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:48:06" (1/1) ... [2022-11-25 15:48:06,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:48:06,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:48:06,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:48:06,910 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:48:06,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:48:07,004 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:48:07,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07 WrapperNode [2022-11-25 15:48:07,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:48:07,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:48:07,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:48:07,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:48:07,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,046 INFO L138 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2022-11-25 15:48:07,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:48:07,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:48:07,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:48:07,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:48:07,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,066 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:48:07,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:48:07,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:48:07,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:48:07,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (1/1) ... [2022-11-25 15:48:07,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:07,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:07,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 15:48:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:48:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:48:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:48:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:48:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:48:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:48:07,250 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:48:07,252 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:48:07,422 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:48:07,428 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:48:07,428 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:48:07,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:48:07 BoogieIcfgContainer [2022-11-25 15:48:07,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:48:07,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 15:48:07,432 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 15:48:07,435 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 15:48:07,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 15:48:07,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 03:48:06" (1/3) ... [2022-11-25 15:48:07,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3be7be55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 03:48:07, skipping insertion in model container [2022-11-25 15:48:07,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 15:48:07,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:07" (2/3) ... [2022-11-25 15:48:07,438 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3be7be55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 03:48:07, skipping insertion in model container [2022-11-25 15:48:07,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 15:48:07,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:48:07" (3/3) ... [2022-11-25 15:48:07,440 INFO L332 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2022-11-25 15:48:07,505 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 15:48:07,505 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 15:48:07,505 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 15:48:07,505 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 15:48:07,505 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 15:48:07,505 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 15:48:07,506 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 15:48:07,506 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 15:48:07,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) [2022-11-25 15:48:07,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:07,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:07,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:07,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 15:48:07,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:48:07,541 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 15:48:07,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) [2022-11-25 15:48:07,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:07,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:07,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:07,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 15:48:07,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:48:07,551 INFO L748 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 12#L552true assume !main_#t~short9#1; 2#L552-2true assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 8#L556-2true [2022-11-25 15:48:07,551 INFO L750 eck$LassoCheckResult]: Loop: 8#L556-2true call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 11#L555-1true assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 7#L556true assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 8#L556-2true [2022-11-25 15:48:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2022-11-25 15:48:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:07,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702710010] [2022-11-25 15:48:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:07,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702710010] [2022-11-25 15:48:07,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702710010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:07,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:07,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:48:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995936835] [2022-11-25 15:48:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:07,919 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:48:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 1 times [2022-11-25 15:48:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:07,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917068975] [2022-11-25 15:48:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:07,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:08,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:08,312 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:08,332 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-11-25 15:48:08,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-11-25 15:48:08,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:08,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 8 transitions. [2022-11-25 15:48:08,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-25 15:48:08,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-25 15:48:08,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-11-25 15:48:08,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:48:08,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-25 15:48:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-11-25 15:48:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-25 15:48:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-11-25 15:48:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-11-25 15:48:08,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-25 15:48:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:08,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-25 15:48:08,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 15:48:08,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-11-25 15:48:08,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:08,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:08,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:08,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 15:48:08,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:48:08,374 INFO L748 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 40#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 34#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 35#L556-2 [2022-11-25 15:48:08,374 INFO L750 eck$LassoCheckResult]: Loop: 35#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 39#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 38#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 35#L556-2 [2022-11-25 15:48:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2022-11-25 15:48:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056183534] [2022-11-25 15:48:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 2 times [2022-11-25 15:48:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:08,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245475877] [2022-11-25 15:48:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029994, now seen corresponding path program 1 times [2022-11-25 15:48:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:08,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103782479] [2022-11-25 15:48:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:08,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:09,811 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 15:48:09,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 15:48:09,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 15:48:09,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 15:48:09,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 15:48:09,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:09,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 15:48:09,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 15:48:09,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration2_Lasso [2022-11-25 15:48:09,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 15:48:09,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 15:48:09,835 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,844 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,852 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,855 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,859 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,862 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,865 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,870 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,876 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,881 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,888 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,895 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,903 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:09,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:10,569 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:11,108 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 15:48:11,117 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 15:48:11,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-25 15:48:11,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-25 15:48:11,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-11-25 15:48:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-25 15:48:11,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:11,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:11,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,301 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-25 15:48:11,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-25 15:48:11,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-25 15:48:11,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:11,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:11,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-25 15:48:11,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,503 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:11,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:11,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-25 15:48:11,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-25 15:48:11,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,571 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-25 15:48:11,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,574 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 15:48:11,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,595 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-25 15:48:11,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,635 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-25 15:48:11,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,681 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-25 15:48:11,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-25 15:48:11,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:11,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:11,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:11,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:11,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-25 15:48:11,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,846 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-25 15:48:11,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,896 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-25 15:48:11,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:11,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:11,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:11,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:11,963 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:11,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-25 15:48:11,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:11,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:11,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:11,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:11,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:11,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:11,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:11,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:11,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-11-25 15:48:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,004 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-25 15:48:12,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:12,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:12,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:12,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,040 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-25 15:48:12,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:12,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:12,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,094 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-25 15:48:12,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:12,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:12,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,143 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-25 15:48:12,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:12,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:12,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,204 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,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 [2022-11-25 15:48:12,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-25 15:48:12,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:12,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:12,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,244 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-25 15:48:12,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:12,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:12,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,309 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-25 15:48:12,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:12,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:12,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:12,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:12,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,356 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:12,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:12,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:12,376 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-25 15:48:12,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:12,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-25 15:48:12,391 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-11-25 15:48:12,392 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-11-25 15:48:12,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 15:48:12,487 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-11-25 15:48:12,488 INFO L444 ModelExtractionUtils]: 4 out of 21 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-11-25 15:48:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:12,536 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:12,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-25 15:48:12,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 15:48:12,654 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-11-25 15:48:12,654 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 15:48:12,655 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1 Supporting invariants [] [2022-11-25 15:48:12,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:12,775 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-11-25 15:48:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:12,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:48:12,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:12,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:48:12,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:12,923 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 15:48:12,925 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:12,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 16 transitions. Complement of second has 7 states. [2022-11-25 15:48:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 15:48:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-11-25 15:48:12,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-25 15:48:12,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:48:12,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-25 15:48:12,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:48:12,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-25 15:48:12,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:48:12,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-11-25 15:48:12,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:12,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-11-25 15:48:12,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-25 15:48:12,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-25 15:48:12,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-11-25 15:48:12,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:48:12,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-25 15:48:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-11-25 15:48:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-25 15:48:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2022-11-25 15:48:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-11-25 15:48:12,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-25 15:48:12,979 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-25 15:48:12,979 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 15:48:12,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-11-25 15:48:12,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:12,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:12,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:12,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:12,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:48:12,983 INFO L748 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 205#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 194#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 195#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 204#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 198#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 199#L556-2 [2022-11-25 15:48:12,983 INFO L750 eck$LassoCheckResult]: Loop: 199#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 202#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 206#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 199#L556-2 [2022-11-25 15:48:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029996, now seen corresponding path program 1 times [2022-11-25 15:48:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:12,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13763380] [2022-11-25 15:48:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:13,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:13,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 3 times [2022-11-25 15:48:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:13,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128295967] [2022-11-25 15:48:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:13,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:13,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash 658080967, now seen corresponding path program 1 times [2022-11-25 15:48:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:13,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611091153] [2022-11-25 15:48:13,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:13,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:13,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:14,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-11-25 15:48:14,795 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 15:48:14,795 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 15:48:14,795 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 15:48:14,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 15:48:14,796 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 15:48:14,796 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:14,796 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 15:48:14,796 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 15:48:14,796 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration3_Lasso [2022-11-25 15:48:14,796 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 15:48:14,796 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 15:48:14,800 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,807 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,810 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,813 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,815 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,818 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,825 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,829 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,832 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,835 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,839 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:14,842 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,499 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,501 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,506 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:15,509 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 15:48:16,045 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 15:48:16,046 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 15:48:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,047 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-25 15:48:16,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,092 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-25 15:48:16,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-11-25 15:48:16,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,117 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-25 15:48:16,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,135 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-25 15:48:16,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,153 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-25 15:48:16,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,194 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,214 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-25 15:48:16,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,215 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 15:48:16,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-25 15:48:16,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,240 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-25 15:48:16,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-11-25 15:48:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,271 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-25 15:48:16,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 [2022-11-25 15:48:16,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,325 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-25 15:48:16,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-11-25 15:48:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,350 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-25 15:48:16,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-11-25 15:48:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,383 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-25 15:48:16,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,404 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-25 15:48:16,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:48:16,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:48:16,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:48:16,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-11-25 15:48:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,422 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-25 15:48:16,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-11-25 15:48:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,458 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-25 15:48:16,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,513 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-25 15:48:16,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-11-25 15:48:16,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,539 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-25 15:48:16,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,580 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:48:16,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-25 15:48:16,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:48:16,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:48:16,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:48:16,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:16,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,641 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 15:48:16,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:48:16,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:48:16,659 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-25 15:48:16,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:48:16,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-25 15:48:16,672 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-11-25 15:48:16,672 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-11-25 15:48:16,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 15:48:16,743 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-25 15:48:16,744 INFO L444 ModelExtractionUtils]: 7 out of 21 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-25 15:48:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:48:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:16,748 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:16,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 15:48:16,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-25 15:48:16,763 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-11-25 15:48:16,763 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 15:48:16,763 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2 Supporting invariants [] [2022-11-25 15:48:16,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-11-25 15:48:16,885 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-11-25 15:48:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:48:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:48:16,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:16,994 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 15:48:16,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2022-11-25 15:48:17,014 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Result 19 states and 24 transitions. Complement of second has 7 states. [2022-11-25 15:48:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 15:48:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2022-11-25 15:48:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-11-25 15:48:17,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-25 15:48:17,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:48:17,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2022-11-25 15:48:17,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:48:17,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2022-11-25 15:48:17,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:48:17,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2022-11-25 15:48:17,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:17,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2022-11-25 15:48:17,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-25 15:48:17,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-11-25 15:48:17,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-11-25 15:48:17,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:48:17,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-25 15:48:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-11-25 15:48:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-25 15:48:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-25 15:48:17,020 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-25 15:48:17,020 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-25 15:48:17,020 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 15:48:17,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-11-25 15:48:17,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-25 15:48:17,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:17,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:17,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2022-11-25 15:48:17,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:48:17,022 INFO L748 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 386#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 375#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 376#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 390#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 388#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 387#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 385#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 379#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 380#L556-2 [2022-11-25 15:48:17,022 INFO L750 eck$LassoCheckResult]: Loop: 380#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 383#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 389#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 380#L556-2 [2022-11-25 15:48:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 658080969, now seen corresponding path program 2 times [2022-11-25 15:48:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:17,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988177806] [2022-11-25 15:48:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:17,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988177806] [2022-11-25 15:48:17,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988177806] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:17,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916345926] [2022-11-25 15:48:17,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:48:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:17,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:17,482 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:17,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-25 15:48:17,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:48:17,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:48:17,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 15:48:17,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:17,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:48:17,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:48:17,682 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 15:48:17,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 15:48:17,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:48:17,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 15:48:17,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:48:17,727 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 9 [2022-11-25 15:48:17,731 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:48:18,093 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:48:18,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-25 15:48:18,113 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 15:48:18,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 74 [2022-11-25 15:48:18,135 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:48:18,157 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 13 [2022-11-25 15:48:18,206 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-25 15:48:18,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-11-25 15:48:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:18,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:18,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916345926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:18,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:18,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-25 15:48:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870911946] [2022-11-25 15:48:18,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:18,483 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:48:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 4 times [2022-11-25 15:48:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:18,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71018167] [2022-11-25 15:48:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:18,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:18,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:18,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:18,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:48:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=163, Unknown=3, NotChecked=0, Total=210 [2022-11-25 15:48:18,635 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:18,669 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (not |c_ULTIMATE.start_main_#t~short9#1|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~maxId~0#1.base|) 1) (or .cse0 (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~maxId~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~maxId~0#1.offset|))) (or (exists ((|ULTIMATE.start_main_~id~0#1.offset| Int)) (let ((.cse1 (select .cse3 |ULTIMATE.start_main_~id~0#1.offset|))) (and (<= (+ .cse1 1) .cse2) (<= 0 .cse1)))) (and .cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_main_~id~0#1.base| Int) (|ULTIMATE.start_main_~id~0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base|))) (and (<= 0 (select .cse4 |ULTIMATE.start_main_~id~0#1.offset|)) (= .cse4 (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base|)) (= .cse2 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~maxId~0#1.offset|)))))) (exists ((v_DerPreprocessor_2 (Array Int Int))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~id~0#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~id~0#1.offset| Int)) (let ((.cse5 (select .cse6 |ULTIMATE.start_main_~id~0#1.offset|))) (and (<= 0 .cse5) (<= (+ .cse5 1) .cse2)))) (= .cse6 (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base|))))) (= .cse2 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~maxId~0#1.offset|)))) (and .cse0 (exists ((|ULTIMATE.start_main_~id~0#1.offset| Int)) (<= 0 (select .cse3 |ULTIMATE.start_main_~id~0#1.offset|))))))))) is different from true [2022-11-25 15:48:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:18,851 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-25 15:48:18,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2022-11-25 15:48:18,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-25 15:48:18,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 30 transitions. [2022-11-25 15:48:18,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-25 15:48:18,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-25 15:48:18,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2022-11-25 15:48:18,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:48:18,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-25 15:48:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2022-11-25 15:48:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-11-25 15:48:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-25 15:48:18,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-25 15:48:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:48:18,859 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-25 15:48:18,860 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 15:48:18,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2022-11-25 15:48:18,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-25 15:48:18,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:18,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:18,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1] [2022-11-25 15:48:18,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2022-11-25 15:48:18,864 INFO L748 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 514#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 502#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 503#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 512#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 506#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 507#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 510#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 508#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 509#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 522#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 521#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 518#L556-2 [2022-11-25 15:48:18,864 INFO L750 eck$LassoCheckResult]: Loop: 518#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 519#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 515#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 516#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 520#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 517#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 518#L556-2 [2022-11-25 15:48:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1635602290, now seen corresponding path program 2 times [2022-11-25 15:48:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:18,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739131071] [2022-11-25 15:48:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739131071] [2022-11-25 15:48:19,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739131071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640343469] [2022-11-25 15:48:19,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:48:19,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:19,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:19,591 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:19,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-25 15:48:19,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:48:19,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:48:19,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 15:48:19,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:19,734 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-25 15:48:19,734 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-25 15:48:19,762 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-25 15:48:19,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-25 15:48:19,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:48:19,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 15:48:19,815 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 25 [2022-11-25 15:48:19,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:48:19,861 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:48:19,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:48:19,888 INFO L321 Elim1Store]: treesize reduction 4, result has 55.6 percent of original size [2022-11-25 15:48:19,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 15:48:20,035 INFO L321 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2022-11-25 15:48:20,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-25 15:48:20,074 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 15:48:20,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:48:20,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-25 15:48:20,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-11-25 15:48:20,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2022-11-25 15:48:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:20,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:21,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640343469] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:21,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:21,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-11-25 15:48:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380935984] [2022-11-25 15:48:21,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:21,023 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:48:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1365695075, now seen corresponding path program 1 times [2022-11-25 15:48:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:21,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555516744] [2022-11-25 15:48:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:21,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:21,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 15:48:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-11-25 15:48:21,260 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:33,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:48:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:34,203 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-25 15:48:34,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2022-11-25 15:48:34,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-25 15:48:34,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 40 states and 44 transitions. [2022-11-25 15:48:34,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-11-25 15:48:34,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-11-25 15:48:34,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2022-11-25 15:48:34,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:48:34,206 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-25 15:48:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2022-11-25 15:48:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-25 15:48:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-25 15:48:34,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-25 15:48:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:48:34,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-25 15:48:34,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 15:48:34,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2022-11-25 15:48:34,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-25 15:48:34,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:34,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:34,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2022-11-25 15:48:34,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2022-11-25 15:48:34,212 INFO L748 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 705#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 693#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 694#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 712#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 710#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 701#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 702#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 711#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 703#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 704#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 699#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 700#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 708#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 697#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 698#L556-2 [2022-11-25 15:48:34,212 INFO L750 eck$LassoCheckResult]: Loop: 698#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 709#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 716#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 717#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 706#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 707#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 719#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 720#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 718#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 698#L556-2 [2022-11-25 15:48:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash 176108201, now seen corresponding path program 3 times [2022-11-25 15:48:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:34,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037196270] [2022-11-25 15:48:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037196270] [2022-11-25 15:48:35,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037196270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525813648] [2022-11-25 15:48:35,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:48:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:35,290 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:35,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-25 15:48:35,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 15:48:35,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:48:35,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 15:48:35,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:35,444 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-25 15:48:35,444 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-25 15:48:35,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-25 15:48:35,481 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-11-25 15:48:35,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 70 [2022-11-25 15:48:35,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 15:48:35,517 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 15:48:35,525 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:48:35,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2022-11-25 15:48:35,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:48:35,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-25 15:48:35,590 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 3 [2022-11-25 15:48:35,610 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:48:35,626 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:48:35,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:48:35,799 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 15:48:35,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:48:35,814 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:48:35,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 15:48:35,977 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:48:35,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-25 15:48:35,990 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 17 [2022-11-25 15:48:36,097 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:48:36,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:48:36,290 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:48:36,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2022-11-25 15:48:36,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:48:36,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-11-25 15:48:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 15:48:36,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525813648] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:37,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 29 [2022-11-25 15:48:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289619036] [2022-11-25 15:48:37,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:37,437 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:48:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 2 times [2022-11-25 15:48:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:37,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238247468] [2022-11-25 15:48:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:37,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:37,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 15:48:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=751, Unknown=15, NotChecked=0, Total=870 [2022-11-25 15:48:38,049 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:39,016 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-25 15:48:39,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2022-11-25 15:48:39,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-25 15:48:39,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 39 transitions. [2022-11-25 15:48:39,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-11-25 15:48:39,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-11-25 15:48:39,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2022-11-25 15:48:39,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:48:39,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-25 15:48:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2022-11-25 15:48:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-11-25 15:48:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-25 15:48:39,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-25 15:48:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:48:39,031 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-25 15:48:39,031 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-25 15:48:39,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2022-11-25 15:48:39,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-25 15:48:39,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:39,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:39,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2022-11-25 15:48:39,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2022-11-25 15:48:39,033 INFO L748 eck$LassoCheckResult]: Stem: 908#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 918#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 906#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 907#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 921#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 912#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 913#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 924#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 922#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 923#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 926#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 925#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 916#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 917#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 933#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 932#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 930#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 910#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 911#L556-2 [2022-11-25 15:48:39,033 INFO L750 eck$LassoCheckResult]: Loop: 911#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 919#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 920#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 914#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 915#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 931#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 928#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 929#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 927#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 911#L556-2 [2022-11-25 15:48:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1816884246, now seen corresponding path program 4 times [2022-11-25 15:48:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:39,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625688360] [2022-11-25 15:48:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625688360] [2022-11-25 15:48:39,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625688360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416545232] [2022-11-25 15:48:39,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:48:39,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:39,939 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:39,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-25 15:48:40,047 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:48:40,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:48:40,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 15:48:40,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:40,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 15:48:40,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:48:40,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:48:40,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 15:48:40,210 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 15:48:40,211 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 31 [2022-11-25 15:48:40,248 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 15:48:40,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:48:40,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2022-11-25 15:48:40,386 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2022-11-25 15:48:40,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 15:48:40,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-11-25 15:48:40,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2022-11-25 15:48:40,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 23 [2022-11-25 15:48:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:40,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:41,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:48:41,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2022-11-25 15:48:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:42,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416545232] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:42,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:42,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-11-25 15:48:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842576108] [2022-11-25 15:48:42,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:42,095 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:48:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 3 times [2022-11-25 15:48:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:42,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328955419] [2022-11-25 15:48:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:42,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:42,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 15:48:42,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1021, Unknown=20, NotChecked=0, Total=1190 [2022-11-25 15:48:42,753 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:43,846 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-11-25 15:48:43,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2022-11-25 15:48:43,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-25 15:48:43,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 41 transitions. [2022-11-25 15:48:43,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-11-25 15:48:43,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-11-25 15:48:43,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 41 transitions. [2022-11-25 15:48:43,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:48:43,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-25 15:48:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 41 transitions. [2022-11-25 15:48:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-11-25 15:48:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-25 15:48:43,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-25 15:48:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:48:43,855 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-25 15:48:43,855 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-25 15:48:43,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2022-11-25 15:48:43,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-25 15:48:43,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:48:43,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:48:43,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 4, 2, 1, 1, 1, 1] [2022-11-25 15:48:43,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2022-11-25 15:48:43,857 INFO L748 eck$LassoCheckResult]: Stem: 1146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1155#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1144#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1145#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1175#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1176#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1174#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1172#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1148#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1149#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1152#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1177#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1153#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1154#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1150#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1151#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1158#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1159#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1173#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1165#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1166#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1164#L556-2 [2022-11-25 15:48:43,857 INFO L750 eck$LassoCheckResult]: Loop: 1164#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1171#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1160#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1161#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1156#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1157#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1170#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1169#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1168#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1163#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1167#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1162#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1164#L556-2 [2022-11-25 15:48:43,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1620751923, now seen corresponding path program 5 times [2022-11-25 15:48:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:43,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575858521] [2022-11-25 15:48:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:45,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575858521] [2022-11-25 15:48:45,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575858521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:45,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355663430] [2022-11-25 15:48:45,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:48:45,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:45,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:45,428 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:45,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-25 15:48:45,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-25 15:48:45,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:48:45,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 15:48:45,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:45,600 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 15:48:45,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 15:48:45,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:48:45,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 15:48:45,644 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 9 [2022-11-25 15:48:45,646 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:48:45,667 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:48:45,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:48:45,850 INFO L321 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2022-11-25 15:48:45,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 83 [2022-11-25 15:48:45,860 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-25 15:48:45,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:48:45,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-25 15:48:45,952 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:48:45,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-25 15:48:46,187 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-25 15:48:46,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 62 [2022-11-25 15:48:46,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-25 15:48:46,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-11-25 15:48:46,391 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-25 15:48:46,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-25 15:48:46,682 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-25 15:48:46,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 51 [2022-11-25 15:48:46,961 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-25 15:48:46,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 50 [2022-11-25 15:48:47,319 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-25 15:48:47,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 53 [2022-11-25 15:48:47,549 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-25 15:48:47,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 38 [2022-11-25 15:48:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:47,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:49,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:48:49,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 139 [2022-11-25 15:48:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:51,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355663430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:51,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:51,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 48 [2022-11-25 15:48:51,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082579451] [2022-11-25 15:48:51,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:51,034 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:48:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 4 times [2022-11-25 15:48:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:51,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409625306] [2022-11-25 15:48:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:51,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:48:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:48:51,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:48:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 15:48:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2012, Unknown=40, NotChecked=0, Total=2352 [2022-11-25 15:48:52,155 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:52,353 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~id~0#1.base| |c_ULTIMATE.start_main_~maxId~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~id~0#1.base|) 1) (= |c_ULTIMATE.start_main_~id~0#1.offset| 0) (or .cse0 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= .cse1 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~id~0#1.base|)) (= (select v_DerPreprocessor_8 |c_ULTIMATE.start_main_~maxId~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~maxId~0#1.base|) 1) (not .cse0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~id~0#1.offset|)))) is different from true [2022-11-25 15:48:53,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:48:58,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:49:58,744 WARN L233 SmtUtils]: Spent 50.57s on a formula simplification. DAG size of input: 170 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:50:12,088 WARN L233 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 84 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:50:25,114 WARN L233 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 89 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:50:53,100 WARN L233 SmtUtils]: Spent 25.12s on a formula simplification. DAG size of input: 147 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:50:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:59,574 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-11-25 15:50:59,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 108 transitions. [2022-11-25 15:50:59,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-25 15:50:59,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 88 states and 92 transitions. [2022-11-25 15:50:59,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 15:50:59,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 15:50:59,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 92 transitions. [2022-11-25 15:50:59,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:50:59,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-25 15:50:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 92 transitions. [2022-11-25 15:50:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2022-11-25 15:50:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:50:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-11-25 15:50:59,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-11-25 15:50:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 15:50:59,586 INFO L428 stractBuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-11-25 15:50:59,586 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-25 15:50:59,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 61 transitions. [2022-11-25 15:50:59,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-25 15:50:59,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:50:59,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:50:59,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 8, 2, 1, 1, 1, 1] [2022-11-25 15:50:59,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2022-11-25 15:50:59,589 INFO L748 eck$LassoCheckResult]: Stem: 1544#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1554#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1542#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1543#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1563#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1565#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1562#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1561#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1560#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1550#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1551#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1578#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1552#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1553#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1548#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1549#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1577#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1576#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1575#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1574#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1573#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1572#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1571#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1570#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1569#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1568#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1567#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1566#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1559#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1564#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1558#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1555#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1546#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1547#L556-2 [2022-11-25 15:50:59,589 INFO L750 eck$LassoCheckResult]: Loop: 1547#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1599#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1579#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1556#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1557#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1582#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1598#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1597#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1596#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1595#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1594#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1593#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1592#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1591#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1590#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1589#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1588#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1587#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1586#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1585#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1584#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1581#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1583#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1580#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1547#L556-2 [2022-11-25 15:50:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:59,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1556392051, now seen corresponding path program 6 times [2022-11-25 15:50:59,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:59,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409053034] [2022-11-25 15:50:59,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:59,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 1 proven. 116 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 15:51:01,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409053034] [2022-11-25 15:51:01,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409053034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:51:01,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201727386] [2022-11-25 15:51:01,584 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 15:51:01,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:01,589 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:01,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-25 15:51:01,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-11-25 15:51:01,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:51:01,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 15:51:01,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:01,972 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-25 15:51:01,973 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-25 15:51:02,017 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-25 15:51:02,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-25 15:51:02,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:51:02,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 15:51:02,069 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 25 [2022-11-25 15:51:02,075 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:51:02,078 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 15:51:02,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2022-11-25 15:51:02,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2022-11-25 15:51:02,175 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:51:02,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:51:02,344 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 15:51:02,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:51:02,358 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:02,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-25 15:51:02,584 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:02,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-11-25 15:51:02,790 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:02,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-25 15:51:02,799 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 17 [2022-11-25 15:51:02,931 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:02,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:03,000 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:03,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:03,056 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:03,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:03,129 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:03,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:03,203 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:03,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:03,426 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:03,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-25 15:51:03,690 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:03,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 48 [2022-11-25 15:51:03,850 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:51:03,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-11-25 15:51:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 15:51:03,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:51:05,602 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_main_#t~mem15#1| |c_ULTIMATE.start_main_#t~mem16#1|)) (forall ((v_ArrVal_535 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base|))) (or (not (<= v_ArrVal_535 (+ (select .cse0 |c_ULTIMATE.start_main_~tmp~0#1.offset|) 1))) (< v_ArrVal_535 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~tmp~0#1.offset| v_ArrVal_535)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|))))) (forall ((v_ArrVal_544 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (select v_ArrVal_541 |c_ULTIMATE.start_main_~tmp~0#1.offset|))) (let ((.cse1 (+ 2 .cse2))) (or (not (<= v_ArrVal_544 .cse1)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store v_ArrVal_541 |c_ULTIMATE.start_main_~tmp~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|) .cse1) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) .cse2) (< v_ArrVal_544 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store v_ArrVal_541 |c_ULTIMATE.start_main_~tmp~0#1.offset| v_ArrVal_544)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|))))))) is different from false [2022-11-25 15:51:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 30 proven. 66 refuted. 0 times theorem prover too weak. 30 trivial. 9 not checked. [2022-11-25 15:51:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201727386] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:51:06,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:51:06,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 41 [2022-11-25 15:51:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804102994] [2022-11-25 15:51:06,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:51:06,559 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:51:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 5 times [2022-11-25 15:51:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637863130] [2022-11-25 15:51:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:06,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:51:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:06,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:51:15,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:15,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 15:51:15,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1466, Unknown=19, NotChecked=78, Total=1722 [2022-11-25 15:51:15,441 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. cyclomatic complexity: 6 Second operand has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 42 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) [2022-11-25 15:51:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:17,703 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-11-25 15:51:17,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 99 transitions. [2022-11-25 15:51:17,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-25 15:51:17,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 68 states and 72 transitions. [2022-11-25 15:51:17,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-11-25 15:51:17,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-25 15:51:17,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 72 transitions. [2022-11-25 15:51:17,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:51:17,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-25 15:51:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 72 transitions. [2022-11-25 15:51:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2022-11-25 15:51:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-11-25 15:51:17,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-11-25 15:51:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:51:17,716 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-11-25 15:51:17,716 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-25 15:51:17,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 64 transitions. [2022-11-25 15:51:17,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-25 15:51:17,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:51:17,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:51:17,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 9, 2, 1, 1, 1, 1] [2022-11-25 15:51:17,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2022-11-25 15:51:17,719 INFO L748 eck$LassoCheckResult]: Stem: 1965#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1966#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1974#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1963#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1964#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1971#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2023#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1972#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1973#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1969#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1970#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1975#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1967#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1968#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2022#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2021#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2020#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2019#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2018#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2017#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2016#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2015#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2014#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2013#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2012#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2011#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2010#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2009#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2008#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2007#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2006#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2005#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2003#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2004#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2002#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2001#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2000#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1980#L556-2 [2022-11-25 15:51:17,719 INFO L750 eck$LassoCheckResult]: Loop: 1980#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1998#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1976#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1977#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1999#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1997#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1996#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1995#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1994#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1993#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1992#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1991#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1990#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1989#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1988#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1987#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1986#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1985#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1984#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1983#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1982#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1979#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1981#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1978#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1980#L556-2 [2022-11-25 15:51:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1653652850, now seen corresponding path program 7 times [2022-11-25 15:51:17,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:17,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598949909] [2022-11-25 15:51:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 7 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:21,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:21,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598949909] [2022-11-25 15:51:21,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598949909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:51:21,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992081077] [2022-11-25 15:51:21,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 15:51:21,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:21,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:21,042 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:21,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-11-25 15:51:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:21,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-25 15:51:21,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:21,240 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-25 15:51:21,240 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-25 15:51:21,274 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-25 15:51:21,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-25 15:51:21,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:51:21,313 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 15:51:21,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:51:21,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-25 15:51:21,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 15:51:21,357 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 9 [2022-11-25 15:51:21,360 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-25 15:51:21,374 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:51:21,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 15:51:21,543 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 15:51:21,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:51:21,556 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:21,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-25 15:51:21,694 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:21,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-25 15:51:21,949 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:21,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2022-11-25 15:51:22,219 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-25 15:51:22,226 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 17 [2022-11-25 15:51:22,356 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:22,429 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:22,490 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:22,556 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 15:51:22,818 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-25 15:51:22,991 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:22,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2022-11-25 15:51:23,343 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:23,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 48 [2022-11-25 15:51:23,532 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:51:23,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-11-25 15:51:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 15:51:23,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:51:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 15:51:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992081077] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:51:27,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:51:27,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 17] total 51 [2022-11-25 15:51:27,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760761431] [2022-11-25 15:51:27,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:51:27,520 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:51:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 6 times [2022-11-25 15:51:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:27,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292744058] [2022-11-25 15:51:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:27,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:51:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:27,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:51:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 15:51:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2423, Unknown=39, NotChecked=0, Total=2652 [2022-11-25 15:51:36,353 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. cyclomatic complexity: 6 Second operand has 52 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 52 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) [2022-11-25 15:51:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:41,171 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-25 15:51:41,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 105 transitions. [2022-11-25 15:51:41,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-25 15:51:41,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 74 states and 78 transitions. [2022-11-25 15:51:41,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 15:51:41,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 15:51:41,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 78 transitions. [2022-11-25 15:51:41,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 15:51:41,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-25 15:51:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 78 transitions. [2022-11-25 15:51:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2022-11-25 15:51:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 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) [2022-11-25 15:51:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-11-25 15:51:41,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-25 15:51:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 15:51:41,181 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-25 15:51:41,181 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-25 15:51:41,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 67 transitions. [2022-11-25 15:51:41,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-25 15:51:41,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:51:41,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:51:41,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 10, 2, 1, 1, 1, 1] [2022-11-25 15:51:41,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2022-11-25 15:51:41,184 INFO L748 eck$LassoCheckResult]: Stem: 2437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 2445#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 2435#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 2436#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2443#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2475#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2476#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2477#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2441#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2442#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2444#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2447#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2455#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2454#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2452#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 2453#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2474#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2473#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2472#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2471#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2470#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2469#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2468#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2467#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2466#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2465#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2464#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2463#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2462#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2461#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2460#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2459#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2458#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2457#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2451#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2456#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2450#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2446#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2439#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 2440#L556-2 [2022-11-25 15:51:41,184 INFO L750 eck$LassoCheckResult]: Loop: 2440#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2498#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2478#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2448#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2449#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2481#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2497#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2496#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2495#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2494#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2493#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2492#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2491#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2490#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2489#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2488#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2487#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2486#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2485#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2484#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2483#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2480#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2482#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2479#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 2440#L556-2 [2022-11-25 15:51:41,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -47191059, now seen corresponding path program 8 times [2022-11-25 15:51:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:41,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021082057] [2022-11-25 15:51:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 10 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:44,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021082057] [2022-11-25 15:51:44,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021082057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:51:44,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289570518] [2022-11-25 15:51:44,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:51:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:51:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:44,282 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:51:44,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-25 15:51:44,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:51:44,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:51:44,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-25 15:51:44,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:44,483 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:51:44,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:51:44,639 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 15:51:44,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:51:44,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 15:51:44,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-25 15:51:44,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-25 15:51:45,011 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:51:45,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-25 15:51:45,017 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2022-11-25 15:51:45,124 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:45,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 15:51:45,408 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:45,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-11-25 15:51:45,761 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:45,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-25 15:51:46,090 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:46,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-25 15:51:46,441 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:46,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-25 15:51:46,769 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:46,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-25 15:51:47,131 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:47,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-25 15:51:47,467 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:51:47,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-25 15:51:47,750 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-25 15:51:47,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 34 [2022-11-25 15:51:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 31 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:47,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:13,528 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-25 15:52:13,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 101 [2022-11-25 15:52:13,529 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-25 15:52:13,529 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:881) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:836) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:751) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 45 more [2022-11-25 15:52:13,532 INFO L158 Benchmark]: Toolchain (without parser) took 246995.60ms. Allocated memory was 134.2MB in the beginning and 249.6MB in the end (delta: 115.3MB). Free memory was 95.9MB in the beginning and 113.3MB in the end (delta: -17.4MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2022-11-25 15:52:13,533 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 134.2MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:52:13,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.79ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 80.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 15:52:13,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.02ms. Allocated memory is still 134.2MB. Free memory was 80.1MB in the beginning and 78.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:52:13,533 INFO L158 Benchmark]: Boogie Preprocessor took 21.65ms. Allocated memory is still 134.2MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:52:13,534 INFO L158 Benchmark]: RCFGBuilder took 361.30ms. Allocated memory is still 134.2MB. Free memory was 77.1MB in the beginning and 65.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 15:52:13,534 INFO L158 Benchmark]: BuchiAutomizer took 246100.30ms. Allocated memory was 134.2MB in the beginning and 249.6MB in the end (delta: 115.3MB). Free memory was 65.0MB in the beginning and 113.3MB in the end (delta: -48.3MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2022-11-25 15:52:13,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.88ms. Allocated memory is still 134.2MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.79ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 80.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.02ms. Allocated memory is still 134.2MB. Free memory was 80.1MB in the beginning and 78.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.65ms. Allocated memory is still 134.2MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.30ms. Allocated memory is still 134.2MB. Free memory was 77.1MB in the beginning and 65.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 246100.30ms. Allocated memory was 134.2MB in the beginning and 249.6MB in the end (delta: 115.3MB). Free memory was 65.0MB in the beginning and 113.3MB in the end (delta: -48.3MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-25 15:52:13,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:13,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-11-25 15:52:13,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:14,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:14,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-11-25 15:52:14,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:14,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:14,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_729c8210-1ad3-44f1-86bd-cb34fcf8388b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")