./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP --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 2a580f3a42bca030605af1bbd4c6a77550e46d88a6197c1e34cf45bb050eadef --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:45:40,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:45:40,266 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-06 22:45:40,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:45:40,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:45:40,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:45:40,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:45:40,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:45:40,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:45:40,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:45:40,323 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:45:40,323 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:45:40,324 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:45:40,325 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:45:40,326 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:45:40,327 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:45:40,327 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:45:40,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:45:40,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:45:40,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:45:40,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:45:40,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:45:40,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:45:40,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:45:40,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:45:40,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:45:40,335 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:45:40,336 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:45:40,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:45:40,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:45:40,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:45:40,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:45:40,340 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:45:40,341 INFO L153 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_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/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_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP 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 -> 2a580f3a42bca030605af1bbd4c6a77550e46d88a6197c1e34cf45bb050eadef [2023-11-06 22:45:40,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:45:40,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:45:40,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:45:40,714 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:45:40,715 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:45:40,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i [2023-11-06 22:45:44,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:45:44,850 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:45:44,851 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/sv-benchmarks/c/termination-15/array16_alloca_fixed.i [2023-11-06 22:45:44,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/data/0917a153f/ec29794bfca7424a9ee4f8744370cdbd/FLAG1155cb287 [2023-11-06 22:45:44,887 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/data/0917a153f/ec29794bfca7424a9ee4f8744370cdbd [2023-11-06 22:45:44,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:45:44,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:45:44,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:44,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:45:44,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:45:44,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:44" (1/1) ... [2023-11-06 22:45:44,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcdebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:44, skipping insertion in model container [2023-11-06 22:45:44,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:44" (1/1) ... [2023-11-06 22:45:44,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:45:45,418 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:45,436 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:45:45,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:45,580 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:45:45,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45 WrapperNode [2023-11-06 22:45:45,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:45,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:45,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:45:45,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:45:45,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,661 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-06 22:45:45,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:45,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:45:45,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:45:45,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:45:45,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:45:45,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:45:45,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:45:45,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:45:45,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (1/1) ... [2023-11-06 22:45:45,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:45,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:45,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:45,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 22:45:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:45:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:45:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:45:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:45:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:45:45,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:45:45,912 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:45:45,915 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:45:46,121 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:45:46,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:45:46,129 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:45:46,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:46 BoogieIcfgContainer [2023-11-06 22:45:46,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:45:46,137 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:45:46,138 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:45:46,143 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:45:46,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:45:46,144 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:45:44" (1/3) ... [2023-11-06 22:45:46,145 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e862dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:45:46, skipping insertion in model container [2023-11-06 22:45:46,145 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:45:46,146 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:45" (2/3) ... [2023-11-06 22:45:46,146 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e862dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:45:46, skipping insertion in model container [2023-11-06 22:45:46,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:45:46,146 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:46" (3/3) ... [2023-11-06 22:45:46,148 INFO L332 chiAutomizerObserver]: Analyzing ICFG array16_alloca_fixed.i [2023-11-06 22:45:46,220 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:45:46,220 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:45:46,220 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:45:46,220 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:45:46,221 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:45:46,221 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:45:46,221 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:45:46,221 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:45:46,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:46,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-06 22:45:46,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:46,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:46,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:45:46,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:45:46,262 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:45:46,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:46,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-06 22:45:46,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:46,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:46,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:45:46,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:45:46,276 INFO L748 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2023-11-06 22:45:46,277 INFO L750 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 4#L370-3true [2023-11-06 22:45:46,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2023-11-06 22:45:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720582118] [2023-11-06 22:45:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:46,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:46,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:46,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2023-11-06 22:45:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:46,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5553218] [2023-11-06 22:45:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:46,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:46,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:46,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2023-11-06 22:45:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954804089] [2023-11-06 22:45:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:46,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:46,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:47,209 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:45:47,210 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:45:47,210 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:45:47,210 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:45:47,210 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:45:47,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:47,211 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:45:47,211 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:45:47,211 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_fixed.i_Iteration1_Lasso [2023-11-06 22:45:47,211 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:45:47,211 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:45:47,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:47,917 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:45:47,921 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:45:47,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:47,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:47,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:45:47,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-06 22:45:47,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:47,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:47,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:47,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:47,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:47,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:47,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:47,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:47,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:47,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:47,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:47,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,005 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 [2023-11-06 22:45:48,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-06 22:45:48,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:48,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:48,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:45:48,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-06 22:45:48,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,127 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 [2023-11-06 22:45:48,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-06 22:45:48,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-06 22:45:48,177 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 [2023-11-06 22:45:48,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,234 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 [2023-11-06 22:45:48,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-06 22:45:48,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,276 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,285 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 [2023-11-06 22:45:48,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-06 22:45:48,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,329 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 [2023-11-06 22:45:48,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-06 22:45:48,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,362 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,371 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 [2023-11-06 22:45:48,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-06 22:45:48,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:48,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:48,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-06 22:45:48,430 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 [2023-11-06 22:45:48,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:48,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:48,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:48,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,465 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:45:48,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-06 22:45:48,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:48,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:48,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:48,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,534 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 [2023-11-06 22:45:48,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-06 22:45:48,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:48,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:48,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:48,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:48,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:48,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:48,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:45:48,652 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-06 22:45:48,653 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-11-06 22:45:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:48,680 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:48,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-06 22:45:48,687 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:45:48,716 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:45:48,717 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:45:48,717 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-06 22:45:48,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,738 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-06 22:45:48,753 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2023-11-06 22:45:48,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:48,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:45:48,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:48,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:48,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:45:48,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:49,015 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 [2023-11-06 22:45:49,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2023-11-06 22:45:49,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 48 transitions. Complement of second has 8 states. [2023-11-06 22:45:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:45:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2023-11-06 22:45:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-06 22:45:49,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2023-11-06 22:45:49,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:45:49,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2023-11-06 22:45:49,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:45:49,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-06 22:45:49,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:45:49,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2023-11-06 22:45:49,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:49,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 17 transitions. [2023-11-06 22:45:49,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-06 22:45:49,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-06 22:45:49,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2023-11-06 22:45:49,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:49,158 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-06 22:45:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2023-11-06 22:45:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-06 22:45:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-06 22:45:49,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-06 22:45:49,194 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-06 22:45:49,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:45:49,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2023-11-06 22:45:49,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:49,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:49,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:49,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:49,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:49,198 INFO L748 eck$LassoCheckResult]: Stem: 117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 119#L367 assume !(main_~length~0#1 < 1); 111#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 112#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 113#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 114#L370-4 main_~j~0#1 := 0; 115#L378-2 [2023-11-06 22:45:49,198 INFO L750 eck$LassoCheckResult]: Loop: 115#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 116#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 115#L378-2 [2023-11-06 22:45:49,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2023-11-06 22:45:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214857859] [2023-11-06 22:45:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:49,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214857859] [2023-11-06 22:45:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214857859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:49,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:49,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:45:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335729637] [2023-11-06 22:45:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:49,397 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:49,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2023-11-06 22:45:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899359627] [2023-11-06 22:45:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:49,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:45:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:45:49,547 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 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) [2023-11-06 22:45:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:49,593 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-06 22:45:49,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-06 22:45:49,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:49,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-06 22:45:49,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-06 22:45:49,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-06 22:45:49,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-06 22:45:49,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:49,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-06 22:45:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-06 22:45:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-06 22:45:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) 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) [2023-11-06 22:45:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-06 22:45:49,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-06 22:45:49,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:45:49,608 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-06 22:45:49,608 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:45:49,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2023-11-06 22:45:49,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:49,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:49,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:49,612 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:49,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:49,613 INFO L748 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 152#L367 assume !(main_~length~0#1 < 1); 144#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 145#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 146#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 153#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 155#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 154#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 147#L370-4 main_~j~0#1 := 0; 148#L378-2 [2023-11-06 22:45:49,613 INFO L750 eck$LassoCheckResult]: Loop: 148#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 149#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 148#L378-2 [2023-11-06 22:45:49,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2023-11-06 22:45:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:49,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352672940] [2023-11-06 22:45:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:49,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:49,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2023-11-06 22:45:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:49,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871280933] [2023-11-06 22:45:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:49,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2023-11-06 22:45:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584199893] [2023-11-06 22:45:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:49,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:50,259 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:45:50,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:45:50,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:45:50,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:45:50,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:45:50,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:50,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:45:50,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:45:50,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_fixed.i_Iteration3_Lasso [2023-11-06 22:45:50,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:45:50,260 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:45:50,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:45:50,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:45:50,863 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:45:50,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:50,865 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:50,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-06 22:45:50,877 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 [2023-11-06 22:45:50,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:50,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:50,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:50,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:50,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:50,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:50,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:50,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:50,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:50,924 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:50,934 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 [2023-11-06 22:45:50,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-06 22:45:50,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:50,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:50,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:50,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:50,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:50,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:50,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:50,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:50,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:50,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:50,980 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:50,995 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 [2023-11-06 22:45:50,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-06 22:45:51,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:51,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:51,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:51,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,038 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 [2023-11-06 22:45:51,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-06 22:45:51,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:51,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:51,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,082 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-06 22:45:51,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:45:51,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:51,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:51,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:51,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,139 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-06 22:45:51,155 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 [2023-11-06 22:45:51,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:51,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:51,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:51,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,202 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:45:51,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-06 22:45:51,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:51,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:51,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:51,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,252 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,257 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 [2023-11-06 22:45:51,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-06 22:45:51,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:51,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:51,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:51,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,301 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,306 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 [2023-11-06 22:45:51,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-06 22:45:51,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:51,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:51,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,351 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,358 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 [2023-11-06 22:45:51,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-06 22:45:51,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:45:51,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:45:51,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:45:51,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:45:51,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,406 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,412 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 [2023-11-06 22:45:51,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-06 22:45:51,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:45:51,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:45:51,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:45:51,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:45:51,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:45:51,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:45:51,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:45:51,505 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-06 22:45:51,505 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-11-06 22:45:51,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:45:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:51,509 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:51,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-06 22:45:51,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:45:51,550 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:45:51,551 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:45:51,551 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2023-11-06 22:45:51,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:51,567 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-06 22:45:51,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:45:51,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:45:51,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:51,680 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 [2023-11-06 22:45:51,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-06 22:45:51,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 states and 22 transitions. Complement of second has 5 states. [2023-11-06 22:45:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-06 22:45:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-06 22:45:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2023-11-06 22:45:51,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2023-11-06 22:45:51,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:45:51,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2023-11-06 22:45:51,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:45:51,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2023-11-06 22:45:51,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:45:51,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2023-11-06 22:45:51,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:51,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2023-11-06 22:45:51,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-06 22:45:51,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-06 22:45:51,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2023-11-06 22:45:51,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:51,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-06 22:45:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2023-11-06 22:45:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-06 22:45:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2023-11-06 22:45:51,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-06 22:45:51,726 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-06 22:45:51,727 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:45:51,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2023-11-06 22:45:51,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:51,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:51,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:51,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:51,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:51,729 INFO L748 eck$LassoCheckResult]: Stem: 249#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 251#L367 assume !(main_~length~0#1 < 1); 240#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 241#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 242#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 252#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 255#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 253#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 243#L370-4 main_~j~0#1 := 0; 244#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 245#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 246#L378-2 [2023-11-06 22:45:51,729 INFO L750 eck$LassoCheckResult]: Loop: 246#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 254#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 246#L378-2 [2023-11-06 22:45:51,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2023-11-06 22:45:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:51,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532472429] [2023-11-06 22:45:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:51,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:52,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532472429] [2023-11-06 22:45:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532472429] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593131087] [2023-11-06 22:45:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:52,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:52,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:52,316 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:52,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-06 22:45:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:52,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:45:52,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:52,452 INFO L351 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 15 treesize of output 1 [2023-11-06 22:45:52,535 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:45:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:52,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:52,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-11-06 22:45:52,711 INFO L351 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 22 treesize of output 18 [2023-11-06 22:45:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593131087] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:52,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:52,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2023-11-06 22:45:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868292562] [2023-11-06 22:45:52,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:52,729 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:52,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2023-11-06 22:45:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728848037] [2023-11-06 22:45:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:52,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:52,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:52,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:45:52,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:45:52,821 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:53,026 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2023-11-06 22:45:53,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2023-11-06 22:45:53,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-06 22:45:53,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 40 transitions. [2023-11-06 22:45:53,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-06 22:45:53,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-06 22:45:53,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2023-11-06 22:45:53,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:53,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-11-06 22:45:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2023-11-06 22:45:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-11-06 22:45:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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) [2023-11-06 22:45:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2023-11-06 22:45:53,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-06 22:45:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:45:53,034 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-06 22:45:53,035 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:45:53,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2023-11-06 22:45:53,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:53,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:53,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:53,037 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:53,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:53,037 INFO L748 eck$LassoCheckResult]: Stem: 385#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 387#L367 assume !(main_~length~0#1 < 1); 376#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 377#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 378#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 388#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 391#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 396#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 395#L370-4 main_~j~0#1 := 0; 394#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 383#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 384#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 381#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 382#L378-2 [2023-11-06 22:45:53,037 INFO L750 eck$LassoCheckResult]: Loop: 382#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 392#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 382#L378-2 [2023-11-06 22:45:53,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 1 times [2023-11-06 22:45:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:53,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483594312] [2023-11-06 22:45:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483594312] [2023-11-06 22:45:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483594312] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762068830] [2023-11-06 22:45:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:53,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:53,136 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:53,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-06 22:45:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:53,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:45:53,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:53,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762068830] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:53,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:53,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 22:45:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517731156] [2023-11-06 22:45:53,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:53,326 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:53,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2023-11-06 22:45:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703038614] [2023-11-06 22:45:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:53,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:53,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:45:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:45:53,415 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:53,562 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-11-06 22:45:53,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2023-11-06 22:45:53,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-06 22:45:53,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 57 transitions. [2023-11-06 22:45:53,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-06 22:45:53,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-06 22:45:53,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2023-11-06 22:45:53,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:53,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-11-06 22:45:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2023-11-06 22:45:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-11-06 22:45:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 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) [2023-11-06 22:45:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-06 22:45:53,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-06 22:45:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:45:53,572 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-06 22:45:53,573 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 22:45:53,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2023-11-06 22:45:53,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-06 22:45:53,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:53,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:53,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:53,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:53,575 INFO L748 eck$LassoCheckResult]: Stem: 557#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 559#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 548#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 549#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 581#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 579#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 575#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 576#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 574#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 573#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 571#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 552#L370-4 main_~j~0#1 := 0; 553#L378-2 [2023-11-06 22:45:53,575 INFO L750 eck$LassoCheckResult]: Loop: 553#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 554#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 553#L378-2 [2023-11-06 22:45:53,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2023-11-06 22:45:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241581245] [2023-11-06 22:45:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241581245] [2023-11-06 22:45:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241581245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816407890] [2023-11-06 22:45:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:53,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:53,648 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:53,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-06 22:45:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:53,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:45:53,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:53,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816407890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:45:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-06 22:45:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067286516] [2023-11-06 22:45:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:53,772 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:53,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2023-11-06 22:45:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:53,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541141788] [2023-11-06 22:45:53,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:53,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:53,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:53,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:45:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:45:53,874 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. cyclomatic complexity: 20 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-11-06 22:45:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:53,900 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-11-06 22:45:53,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2023-11-06 22:45:53,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:53,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 32 transitions. [2023-11-06 22:45:53,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-06 22:45:53,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-06 22:45:53,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2023-11-06 22:45:53,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:53,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-06 22:45:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2023-11-06 22:45:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-06 22:45:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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) [2023-11-06 22:45:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-06 22:45:53,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-06 22:45:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:45:53,906 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-06 22:45:53,907 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 22:45:53,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2023-11-06 22:45:53,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:53,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:53,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:53,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:53,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:53,909 INFO L748 eck$LassoCheckResult]: Stem: 670#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 672#L367 assume !(main_~length~0#1 < 1); 661#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 662#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 663#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 673#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 676#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 674#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 675#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 683#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 680#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 679#L370-4 main_~j~0#1 := 0; 678#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 666#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 667#L378-2 [2023-11-06 22:45:53,909 INFO L750 eck$LassoCheckResult]: Loop: 667#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 677#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 667#L378-2 [2023-11-06 22:45:53,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959587, now seen corresponding path program 1 times [2023-11-06 22:45:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:53,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075732981] [2023-11-06 22:45:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075732981] [2023-11-06 22:45:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075732981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980253634] [2023-11-06 22:45:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:54,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:54,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:54,548 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:54,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-06 22:45:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:54,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:45:54,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:54,665 INFO L351 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 15 treesize of output 1 [2023-11-06 22:45:54,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:45:54,770 INFO L351 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 35 treesize of output 15 [2023-11-06 22:45:54,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:45:54,796 INFO L351 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 35 treesize of output 15 [2023-11-06 22:45:54,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:45:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:54,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:55,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-06 22:45:55,217 INFO L351 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 60 treesize of output 56 [2023-11-06 22:45:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980253634] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:55,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-06 22:45:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434466828] [2023-11-06 22:45:55,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:55,267 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:55,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2023-11-06 22:45:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086165585] [2023-11-06 22:45:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:55,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:55,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:45:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:45:55,335 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. cyclomatic complexity: 12 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:55,499 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-06 22:45:55,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2023-11-06 22:45:55,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:55,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 32 transitions. [2023-11-06 22:45:55,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-06 22:45:55,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-06 22:45:55,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2023-11-06 22:45:55,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:55,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-06 22:45:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2023-11-06 22:45:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-11-06 22:45:55,502 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) [2023-11-06 22:45:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-06 22:45:55,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-06 22:45:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:45:55,504 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-06 22:45:55,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 22:45:55,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2023-11-06 22:45:55,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:55,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:55,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:55,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:55,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:55,506 INFO L748 eck$LassoCheckResult]: Stem: 830#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 832#L367 assume !(main_~length~0#1 < 1); 821#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 822#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 823#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 833#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 837#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 834#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 835#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 836#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 839#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 824#L370-4 main_~j~0#1 := 0; 825#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 828#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 829#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 826#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 827#L378-2 [2023-11-06 22:45:55,506 INFO L750 eck$LassoCheckResult]: Loop: 827#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 838#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 827#L378-2 [2023-11-06 22:45:55,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 2 times [2023-11-06 22:45:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260476613] [2023-11-06 22:45:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:55,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:55,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260476613] [2023-11-06 22:45:55,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260476613] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814159605] [2023-11-06 22:45:56,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:45:56,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:56,004 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:56,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-06 22:45:56,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:45:56,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:45:56,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:45:56,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:56,191 INFO L351 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 15 treesize of output 1 [2023-11-06 22:45:56,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:45:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:56,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:56,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-06 22:45:56,551 INFO L351 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 26 treesize of output 18 [2023-11-06 22:45:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814159605] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:56,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-06 22:45:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804882724] [2023-11-06 22:45:56,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:56,564 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:56,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2023-11-06 22:45:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74666799] [2023-11-06 22:45:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:56,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:56,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:56,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:45:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:45:56,652 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 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) [2023-11-06 22:45:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:56,910 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-11-06 22:45:56,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2023-11-06 22:45:56,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-06 22:45:56,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 44 transitions. [2023-11-06 22:45:56,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-06 22:45:56,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-06 22:45:56,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2023-11-06 22:45:56,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:56,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-06 22:45:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2023-11-06 22:45:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2023-11-06 22:45:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-06 22:45:56,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-06 22:45:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:45:56,918 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-06 22:45:56,918 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-06 22:45:56,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2023-11-06 22:45:56,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:56,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:56,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:56,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:56,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:56,921 INFO L748 eck$LassoCheckResult]: Stem: 1011#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1012#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1010#L367 assume !(main_~length~0#1 < 1); 1001#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1002#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1003#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1013#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1021#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1014#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1015#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1016#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1018#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1019#L370-4 main_~j~0#1 := 0; 1024#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1023#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1017#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1008#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1009#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1006#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1007#L378-2 [2023-11-06 22:45:56,921 INFO L750 eck$LassoCheckResult]: Loop: 1007#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1022#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1007#L378-2 [2023-11-06 22:45:56,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2110686111, now seen corresponding path program 3 times [2023-11-06 22:45:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301040930] [2023-11-06 22:45:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:57,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301040930] [2023-11-06 22:45:57,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301040930] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028126874] [2023-11-06 22:45:57,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:45:57,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:57,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:57,068 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:57,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-06 22:45:57,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:45:57,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:45:57,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:45:57,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:57,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:57,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028126874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:57,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 22:45:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124615548] [2023-11-06 22:45:57,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:57,341 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:57,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2023-11-06 22:45:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101907013] [2023-11-06 22:45:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:57,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:57,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:57,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:45:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:45:57,433 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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) [2023-11-06 22:45:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:57,562 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-06 22:45:57,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2023-11-06 22:45:57,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:57,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 41 transitions. [2023-11-06 22:45:57,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-06 22:45:57,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-06 22:45:57,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2023-11-06 22:45:57,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:57,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-06 22:45:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2023-11-06 22:45:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-11-06 22:45:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 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) [2023-11-06 22:45:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-11-06 22:45:57,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-06 22:45:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:45:57,572 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-06 22:45:57,574 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-06 22:45:57,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2023-11-06 22:45:57,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:57,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:57,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:57,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:57,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:57,578 INFO L748 eck$LassoCheckResult]: Stem: 1208#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1210#L367 assume !(main_~length~0#1 < 1); 1199#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1200#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1201#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1211#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1214#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1212#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1213#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1227#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1226#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1221#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1225#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1222#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1202#L370-4 main_~j~0#1 := 0; 1203#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1206#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1207#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1204#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1205#L378-2 [2023-11-06 22:45:57,578 INFO L750 eck$LassoCheckResult]: Loop: 1205#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1216#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1205#L378-2 [2023-11-06 22:45:57,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -761055450, now seen corresponding path program 1 times [2023-11-06 22:45:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:57,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005198398] [2023-11-06 22:45:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005198398] [2023-11-06 22:45:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005198398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494077688] [2023-11-06 22:45:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:58,383 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:58,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-06 22:45:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:45:58,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:58,583 INFO L351 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 15 treesize of output 1 [2023-11-06 22:45:58,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:45:58,717 INFO L351 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 29 treesize of output 13 [2023-11-06 22:45:58,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:45:58,738 INFO L351 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 29 treesize of output 13 [2023-11-06 22:45:58,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:45:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:58,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:59,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-11-06 22:45:59,243 INFO L351 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 24 treesize of output 16 [2023-11-06 22:45:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494077688] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:59,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:59,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2023-11-06 22:45:59,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825169831] [2023-11-06 22:45:59,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:59,258 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:45:59,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2023-11-06 22:45:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782955089] [2023-11-06 22:45:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:59,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:59,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:45:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:45:59,350 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:59,664 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-11-06 22:45:59,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2023-11-06 22:45:59,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:59,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2023-11-06 22:45:59,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-06 22:45:59,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-06 22:45:59,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2023-11-06 22:45:59,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:59,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-06 22:45:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2023-11-06 22:45:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-11-06 22:45:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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) [2023-11-06 22:45:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-06 22:45:59,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-06 22:45:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:45:59,670 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-06 22:45:59,670 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-06 22:45:59,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2023-11-06 22:45:59,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:45:59,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:59,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:59,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:59,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:45:59,672 INFO L748 eck$LassoCheckResult]: Stem: 1416#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1418#L367 assume !(main_~length~0#1 < 1); 1407#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1408#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1409#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1419#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1422#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1420#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1421#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1430#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1429#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1427#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1428#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1426#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1410#L370-4 main_~j~0#1 := 0; 1411#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1414#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1415#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1423#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1424#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1412#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1413#L378-2 [2023-11-06 22:45:59,673 INFO L750 eck$LassoCheckResult]: Loop: 1413#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1425#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1413#L378-2 [2023-11-06 22:45:59,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1622874713, now seen corresponding path program 4 times [2023-11-06 22:45:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856087699] [2023-11-06 22:45:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856087699] [2023-11-06 22:46:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856087699] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:46:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650958999] [2023-11-06 22:46:00,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:46:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:46:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:00,204 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:46:00,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-06 22:46:00,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:46:00,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:46:00,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:46:00,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:00,328 INFO L351 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 19 treesize of output 1 [2023-11-06 22:46:00,482 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-06 22:46:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:00,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:46:00,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-06 22:46:00,706 INFO L351 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 26 treesize of output 18 [2023-11-06 22:46:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650958999] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:46:00,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:46:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2023-11-06 22:46:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118763066] [2023-11-06 22:46:00,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:46:00,726 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:46:00,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2023-11-06 22:46:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597563649] [2023-11-06 22:46:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:00,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:00,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:46:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:46:00,815 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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) [2023-11-06 22:46:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:01,173 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-06 22:46:01,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2023-11-06 22:46:01,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-06 22:46:01,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 52 transitions. [2023-11-06 22:46:01,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-06 22:46:01,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-06 22:46:01,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2023-11-06 22:46:01,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:46:01,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-06 22:46:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2023-11-06 22:46:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2023-11-06 22:46:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 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) [2023-11-06 22:46:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-11-06 22:46:01,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-06 22:46:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:46:01,180 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-06 22:46:01,181 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-06 22:46:01,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2023-11-06 22:46:01,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:46:01,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:46:01,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:46:01,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:01,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:46:01,183 INFO L748 eck$LassoCheckResult]: Stem: 1632#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1633#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1634#L367 assume !(main_~length~0#1 < 1); 1623#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1624#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1625#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1635#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1645#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1646#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1647#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1648#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1636#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1637#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1640#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1641#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1626#L370-4 main_~j~0#1 := 0; 1627#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1650#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1649#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1630#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1631#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1639#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1643#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1628#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1629#L378-2 [2023-11-06 22:46:01,183 INFO L750 eck$LassoCheckResult]: Loop: 1629#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1644#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1629#L378-2 [2023-11-06 22:46:01,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -509471318, now seen corresponding path program 5 times [2023-11-06 22:46:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362939485] [2023-11-06 22:46:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362939485] [2023-11-06 22:46:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362939485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:46:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340338328] [2023-11-06 22:46:01,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:46:01,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:46:01,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:01,390 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:46:01,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-06 22:46:01,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-06 22:46:01,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:46:01,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:46:01,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:01,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:46:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340338328] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:46:01,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:46:01,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:46:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645115513] [2023-11-06 22:46:01,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:46:01,739 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:46:01,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2023-11-06 22:46:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910989200] [2023-11-06 22:46:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:01,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:01,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:01,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:46:01,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:46:01,817 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 13 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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) [2023-11-06 22:46:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:01,982 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-11-06 22:46:01,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2023-11-06 22:46:01,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:46:01,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 47 transitions. [2023-11-06 22:46:01,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-06 22:46:01,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-06 22:46:01,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2023-11-06 22:46:01,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:46:01,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-11-06 22:46:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2023-11-06 22:46:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2023-11-06 22:46:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-06 22:46:01,987 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-06 22:46:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:46:01,994 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-06 22:46:01,995 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-06 22:46:01,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2023-11-06 22:46:01,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:46:01,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:46:01,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:46:01,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:01,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:46:01,998 INFO L748 eck$LassoCheckResult]: Stem: 1877#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1879#L367 assume !(main_~length~0#1 < 1); 1868#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1869#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1870#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1880#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1901#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1881#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1882#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1884#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1885#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1900#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1899#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1898#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1887#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1897#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1894#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1893#L370-4 main_~j~0#1 := 0; 1892#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1883#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1891#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1889#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1888#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1871#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1872#L378-2 [2023-11-06 22:46:01,998 INFO L750 eck$LassoCheckResult]: Loop: 1872#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1890#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1872#L378-2 [2023-11-06 22:46:01,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1285147747, now seen corresponding path program 2 times [2023-11-06 22:46:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926006268] [2023-11-06 22:46:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926006268] [2023-11-06 22:46:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926006268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:46:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707541283] [2023-11-06 22:46:02,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:46:02,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:46:02,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:02,800 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:46:02,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-06 22:46:02,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:46:02,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:46:02,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:46:02,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:03,053 INFO L351 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 15 treesize of output 1 [2023-11-06 22:46:03,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:46:03,191 INFO L351 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 29 treesize of output 13 [2023-11-06 22:46:03,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:46:03,212 INFO L351 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 29 treesize of output 13 [2023-11-06 22:46:03,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:46:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:03,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:46:03,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-11-06 22:46:03,828 INFO L351 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 24 treesize of output 16 [2023-11-06 22:46:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707541283] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:46:03,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:46:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 26 [2023-11-06 22:46:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072581853] [2023-11-06 22:46:03,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:46:03,852 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:46:03,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2023-11-06 22:46:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736244514] [2023-11-06 22:46:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:03,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:03,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:46:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:46:03,939 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 13 Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 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) [2023-11-06 22:46:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:04,389 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-11-06 22:46:04,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2023-11-06 22:46:04,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:46:04,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 48 transitions. [2023-11-06 22:46:04,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-06 22:46:04,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-06 22:46:04,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2023-11-06 22:46:04,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:46:04,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-11-06 22:46:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2023-11-06 22:46:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2023-11-06 22:46:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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) [2023-11-06 22:46:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-06 22:46:04,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-06 22:46:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:46:04,401 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-06 22:46:04,402 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-06 22:46:04,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2023-11-06 22:46:04,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-06 22:46:04,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:46:04,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:46:04,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:04,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:46:04,407 INFO L748 eck$LassoCheckResult]: Stem: 2133#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2135#L367 assume !(main_~length~0#1 < 1); 2124#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2125#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2126#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2136#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2140#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2137#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2138#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2152#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2151#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2150#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2149#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2148#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2142#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2146#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2141#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2131#L370-4 main_~j~0#1 := 0; 2132#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2129#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2130#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2139#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2147#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2144#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2143#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2127#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 2128#L378-2 [2023-11-06 22:46:04,409 INFO L750 eck$LassoCheckResult]: Loop: 2128#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2145#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2128#L378-2 [2023-11-06 22:46:04,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1665431516, now seen corresponding path program 6 times [2023-11-06 22:46:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545800195] [2023-11-06 22:46:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545800195] [2023-11-06 22:46:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545800195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:46:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138148496] [2023-11-06 22:46:05,123 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:46:05,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:46:05,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:05,128 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:46:05,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-06 22:46:05,250 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-06 22:46:05,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:46:05,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:46:05,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:05,385 INFO L351 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 23 treesize of output 1 [2023-11-06 22:46:06,032 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:46:06,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2023-11-06 22:46:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:06,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:46:07,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-11-06 22:46:07,019 INFO L351 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 26 treesize of output 14 [2023-11-06 22:46:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138148496] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:46:07,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:46:07,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-06 22:46:07,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093754440] [2023-11-06 22:46:07,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:46:07,129 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:46:07,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2023-11-06 22:46:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081198081] [2023-11-06 22:46:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:07,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:07,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:46:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:46:07,215 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 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) [2023-11-06 22:46:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:09,860 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-06 22:46:09,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2023-11-06 22:46:09,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-06 22:46:09,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2023-11-06 22:46:09,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-06 22:46:09,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-06 22:46:09,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-06 22:46:09,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:09,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:46:09,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:46:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:46:09,864 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:46:09,864 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-06 22:46:09,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:46:09,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-06 22:46:09,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-06 22:46:09,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.11 10:46:09 BoogieIcfgContainer [2023-11-06 22:46:09,872 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-06 22:46:09,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:46:09,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:46:09,873 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:46:09,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:46" (3/4) ... [2023-11-06 22:46:09,876 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:46:09,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:46:09,878 INFO L158 Benchmark]: Toolchain (without parser) took 24985.95ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 100.7MB in the beginning and 226.7MB in the end (delta: -126.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:09,878 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 76.2MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:09,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.22ms. Allocated memory is still 144.7MB. Free memory was 100.7MB in the beginning and 83.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:46:09,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.52ms. Allocated memory is still 144.7MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:09,880 INFO L158 Benchmark]: Boogie Preprocessor took 53.70ms. Allocated memory is still 144.7MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:09,880 INFO L158 Benchmark]: RCFGBuilder took 418.86ms. Allocated memory is still 144.7MB. Free memory was 79.8MB in the beginning and 69.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:46:09,881 INFO L158 Benchmark]: BuchiAutomizer took 23734.61ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 68.7MB in the beginning and 226.7MB in the end (delta: -158.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:09,881 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 272.6MB. Free memory is still 226.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:09,883 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 76.2MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.22ms. Allocated memory is still 144.7MB. Free memory was 100.7MB in the beginning and 83.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.52ms. Allocated memory is still 144.7MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.70ms. Allocated memory is still 144.7MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.86ms. Allocated memory is still 144.7MB. Free memory was 79.8MB in the beginning and 69.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 23734.61ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 68.7MB in the beginning and 226.7MB in the end (delta: -158.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 272.6MB. Free memory is still 226.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function NULL and consists of 5 locations. One deterministic module has affine ranking function ((-1 * j) + length) and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.6s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 17.9s. Construction of modules took 2.2s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 61 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 605 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 478 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 127 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf100 lsp96 ukn82 mio100 lsp56 div180 bol100 ite100 ukn100 eq150 hnf94 smp64 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-06 22:46:09,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-11-06 22:46:10,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-11-06 22:46:10,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-11-06 22:46:10,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-11-06 22:46:10,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-11-06 22:46:10,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-11-06 22:46:11,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-11-06 22:46:11,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-11-06 22:46:11,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-06 22:46:11,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-11-06 22:46:11,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-06 22:46:12,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c3638af-ca16-4c38-bd09-a7fc90ecc30e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE