./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 9bd2c7ff 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_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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-9bd2c7f [2023-11-19 07:56:00,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:56:00,651 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-19 07:56:00,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:56:00,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:56:00,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:56:00,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:56:00,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:56:00,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:56:00,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:56:00,714 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:56:00,715 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:56:00,715 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:56:00,717 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:56:00,718 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:56:00,718 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:56:00,718 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:56:00,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:56:00,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:56:00,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:56:00,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:56:00,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:56:00,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:56:00,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:56:00,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:56:00,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:56:00,724 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:56:00,724 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:56:00,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:56:00,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:56:00,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:56:00,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:56:00,727 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:56:00,727 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_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/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_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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-19 07:56:00,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:56:01,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:56:01,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:56:01,028 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:56:01,029 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:56:01,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i [2023-11-19 07:56:04,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:56:04,417 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:56:04,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/sv-benchmarks/c/termination-15/array16_alloca_fixed.i [2023-11-19 07:56:04,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/data/46517e2fe/6bcb10ec5c174bc4b50341db48ff487a/FLAGcfbb8ffcf [2023-11-19 07:56:04,448 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/data/46517e2fe/6bcb10ec5c174bc4b50341db48ff487a [2023-11-19 07:56:04,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:56:04,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:56:04,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:04,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:56:04,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:56:04,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:04" (1/1) ... [2023-11-19 07:56:04,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac5faa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:04, skipping insertion in model container [2023-11-19 07:56:04,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:04" (1/1) ... [2023-11-19 07:56:04,529 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:56:04,874 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:04,889 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:56:04,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:05,013 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:56:05,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05 WrapperNode [2023-11-19 07:56:05,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:05,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:05,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:56:05,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:56:05,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,075 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-19 07:56:05,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:05,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:56:05,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:56:05,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:56:05,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:56:05,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:56:05,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:56:05,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:56:05,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (1/1) ... [2023-11-19 07:56:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:05,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:05,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:56:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:56:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:56:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:56:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:56:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:56:05,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:56:05,282 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:56:05,285 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:56:05,437 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:56:05,444 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:56:05,445 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:56:05,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:05 BoogieIcfgContainer [2023-11-19 07:56:05,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:56:05,449 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:56:05,449 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:56:05,453 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:56:05,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:56:05,455 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:56:04" (1/3) ... [2023-11-19 07:56:05,456 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52bd4d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:56:05, skipping insertion in model container [2023-11-19 07:56:05,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:56:05,456 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:05" (2/3) ... [2023-11-19 07:56:05,456 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52bd4d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:56:05, skipping insertion in model container [2023-11-19 07:56:05,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:56:05,457 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:05" (3/3) ... [2023-11-19 07:56:05,458 INFO L332 chiAutomizerObserver]: Analyzing ICFG array16_alloca_fixed.i [2023-11-19 07:56:05,512 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:56:05,513 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:56:05,513 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:56:05,513 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:56:05,513 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:56:05,514 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:56:05,514 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:56:05,514 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:56:05,518 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-19 07:56:05,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-19 07:56:05,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:05,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:05,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-19 07:56:05,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:56:05,546 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:56:05,547 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-19 07:56:05,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-19 07:56:05,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:05,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:05,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-19 07:56:05,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:56:05,556 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-19 07:56:05,557 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-19 07:56:05,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2023-11-19 07:56:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120121791] [2023-11-19 07:56:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:05,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:05,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:05,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:05,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2023-11-19 07:56:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:05,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990633670] [2023-11-19 07:56:05,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:05,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:05,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:05,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2023-11-19 07:56:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:05,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044736234] [2023-11-19 07:56:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:05,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:05,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:05,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:06,289 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 07:56:06,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 07:56:06,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 07:56:06,292 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 07:56:06,292 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-19 07:56:06,292 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:06,292 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 07:56:06,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 07:56:06,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_fixed.i_Iteration1_Lasso [2023-11-19 07:56:06,293 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 07:56:06,293 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 07:56:06,317 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-19 07:56:06,327 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-19 07:56:06,333 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-19 07:56:06,338 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-19 07:56:06,343 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-19 07:56:06,347 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-19 07:56:06,350 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-19 07:56:06,353 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-19 07:56:06,357 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-19 07:56:06,533 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-19 07:56:06,537 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-19 07:56:06,908 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-19 07:56:06,913 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-19 07:56:06,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:06,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:06,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:06,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:06,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:06,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:06,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:06,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:06,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:06,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:06,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:06,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-19 07:56:06,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-19 07:56:07,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:07,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:07,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-19 07:56:07,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-19 07:56:07,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-19 07:56:07,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-19 07:56:07,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-19 07:56:07,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:07,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-19 07:56:07,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-19 07:56:07,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-19 07:56:07,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:07,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:07,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-19 07:56:07,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:07,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:07,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:07,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:07,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-19 07:56:07,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:07,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:07,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:07,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:07,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-19 07:56:07,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:07,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:07,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:07,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:07,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:07,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:07,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:07,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-19 07:56:07,711 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-11-19 07:56:07,711 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-11-19 07:56:07,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:07,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:07,748 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:07,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-19 07:56:07,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-19 07:56:07,785 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-19 07:56:07,785 INFO L513 LassoAnalysis]: Proved termination. [2023-11-19 07:56:07,785 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 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-19 07:56:07,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:07,824 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-19 07:56:07,837 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2023-11-19 07:56:07,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:07,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:56:07,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:07,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:56:07,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:07,955 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-19 07:56:08,004 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-19 07:56:08,007 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-19 07:56:08,091 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-19 07:56:08,095 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-19 07:56:08,102 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-19 07:56:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-19 07:56:08,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2023-11-19 07:56:08,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:56:08,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2023-11-19 07:56:08,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:56:08,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-19 07:56:08,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:56:08,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2023-11-19 07:56:08,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:08,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 17 transitions. [2023-11-19 07:56:08,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-19 07:56:08,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-19 07:56:08,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2023-11-19 07:56:08,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:08,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-19 07:56:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2023-11-19 07:56:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-19 07:56:08,158 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-19 07:56:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-19 07:56:08,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-19 07:56:08,162 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-19 07:56:08,162 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:56:08,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2023-11-19 07:56:08,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:08,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:08,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:08,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:08,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:08,166 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-19 07:56:08,166 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-19 07:56:08,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2023-11-19 07:56:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782194488] [2023-11-19 07:56:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,298 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-19 07:56:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782194488] [2023-11-19 07:56:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782194488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:08,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:08,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220066215] [2023-11-19 07:56:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:08,303 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:08,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2023-11-19 07:56:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638811510] [2023-11-19 07:56:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:08,385 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-19 07:56:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:08,423 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-19 07:56:08,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-19 07:56:08,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:08,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-19 07:56:08,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-19 07:56:08,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-19 07:56:08,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-19 07:56:08,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:08,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-19 07:56:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-19 07:56:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-19 07:56:08,432 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-19 07:56:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-19 07:56:08,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-19 07:56:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:56:08,435 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-19 07:56:08,435 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:56:08,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2023-11-19 07:56:08,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:08,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:08,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:08,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:08,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:08,439 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-19 07:56:08,439 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-19 07:56:08,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2023-11-19 07:56:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:08,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400989945] [2023-11-19 07:56:08,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:08,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2023-11-19 07:56:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730795288] [2023-11-19 07:56:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:08,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2023-11-19 07:56:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641503870] [2023-11-19 07:56:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:08,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:08,983 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 07:56:08,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 07:56:08,984 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 07:56:08,984 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 07:56:08,984 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-19 07:56:08,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:08,984 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 07:56:08,984 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 07:56:08,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_fixed.i_Iteration3_Lasso [2023-11-19 07:56:08,985 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 07:56:08,985 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 07:56:08,987 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-19 07:56:08,991 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-19 07:56:08,993 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-19 07:56:08,996 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-19 07:56:08,999 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-19 07:56:09,002 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-19 07:56:09,004 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-19 07:56:09,007 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-19 07:56:09,009 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-19 07:56:09,013 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-19 07:56:09,015 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-19 07:56:09,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,466 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-19 07:56:09,466 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-19 07:56:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,468 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-19 07:56:09,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:09,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-19 07:56:09,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:09,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,583 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:09,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-19 07:56:09,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,640 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:09,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:09,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:09,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-19 07:56:09,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,701 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:09,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-19 07:56:09,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,752 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-19 07:56:09,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:09,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,812 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:09,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-19 07:56:09,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,880 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 07:56:09,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:09,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-19 07:56:09,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:09,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:09,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:09,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:09,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-19 07:56:09,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:09,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-19 07:56:09,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:09,979 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:09,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-19 07:56:09,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:09,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:09,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:56:09,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:09,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:09,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:09,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:56:09,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:56:10,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:56:10,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-19 07:56:10,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:10,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:10,018 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:10,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-19 07:56:10,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-19 07:56:10,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:56:10,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:56:10,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:56:10,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:56:10,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:56:10,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:56:10,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-19 07:56:10,100 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-19 07:56:10,100 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-11-19 07:56:10,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:56:10,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:10,107 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:10,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-19 07:56:10,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-19 07:56:10,142 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-19 07:56:10,142 INFO L513 LassoAnalysis]: Proved termination. [2023-11-19 07:56:10,142 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-19 07:56:10,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:10,174 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-19 07:56:10,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:10,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:56:10,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:10,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:56:10,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:10,258 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-19 07:56:10,259 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-19 07:56:10,259 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-19 07:56:10,287 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-19 07:56:10,288 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-19 07:56:10,289 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-19 07:56:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2023-11-19 07:56:10,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2023-11-19 07:56:10,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:56:10,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2023-11-19 07:56:10,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:56:10,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2023-11-19 07:56:10,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:56:10,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2023-11-19 07:56:10,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:10,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2023-11-19 07:56:10,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-19 07:56:10,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-19 07:56:10,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2023-11-19 07:56:10,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:10,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-19 07:56:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2023-11-19 07:56:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-19 07:56:10,299 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-19 07:56:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2023-11-19 07:56:10,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-19 07:56:10,302 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-19 07:56:10,302 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:56:10,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2023-11-19 07:56:10,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:10,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:10,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:10,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:10,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:10,307 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-19 07:56:10,308 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-19 07:56:10,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2023-11-19 07:56:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113537814] [2023-11-19 07:56:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:10,785 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-19 07:56:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113537814] [2023-11-19 07:56:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113537814] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012346983] [2023-11-19 07:56:10,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:10,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:10,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:10,791 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:10,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-19 07:56:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:10,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-19 07:56:10,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:10,885 INFO L378 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-19 07:56:10,970 INFO L378 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-19 07:56:10,983 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-19 07:56:10,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:11,086 INFO L378 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 18 treesize of output 16 [2023-11-19 07:56:11,091 INFO L378 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 16 treesize of output 14 [2023-11-19 07:56:11,095 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-19 07:56:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012346983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:11,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:11,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-19 07:56:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486222857] [2023-11-19 07:56:11,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:11,097 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:11,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2023-11-19 07:56:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631391326] [2023-11-19 07:56:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:11,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:11,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:11,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 07:56:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:56:11,182 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 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-19 07:56:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:11,348 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2023-11-19 07:56:11,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2023-11-19 07:56:11,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-19 07:56:11,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 40 transitions. [2023-11-19 07:56:11,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-19 07:56:11,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-19 07:56:11,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2023-11-19 07:56:11,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:11,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-11-19 07:56:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2023-11-19 07:56:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-11-19 07:56:11,354 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-19 07:56:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2023-11-19 07:56:11,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-19 07:56:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:56:11,356 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-19 07:56:11,356 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:56:11,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2023-11-19 07:56:11,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:11,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:11,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:11,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:11,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:11,358 INFO L748 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#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; 388#L367 assume !(main_~length~0#1 < 1); 377#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; 378#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 379#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); 389#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; 392#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 397#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 396#L370-4 main_~j~0#1 := 0; 395#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); 384#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; 385#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); 382#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; 383#L378-2 [2023-11-19 07:56:11,358 INFO L750 eck$LassoCheckResult]: Loop: 383#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); 393#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; 383#L378-2 [2023-11-19 07:56:11,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 1 times [2023-11-19 07:56:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:11,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405884925] [2023-11-19 07:56:11,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:11,442 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-19 07:56:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405884925] [2023-11-19 07:56:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405884925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681687341] [2023-11-19 07:56:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:11,445 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:11,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-19 07:56:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:11,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:56:11,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:11,568 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-19 07:56:11,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:11,605 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-19 07:56:11,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681687341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:11,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:11,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-19 07:56:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663496020] [2023-11-19 07:56:11,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:11,607 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:11,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2023-11-19 07:56:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811713486] [2023-11-19 07:56:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:11,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:11,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:56:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:56:11,674 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-19 07:56:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:11,784 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-11-19 07:56:11,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2023-11-19 07:56:11,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-19 07:56:11,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 57 transitions. [2023-11-19 07:56:11,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-19 07:56:11,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-19 07:56:11,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2023-11-19 07:56:11,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:11,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-11-19 07:56:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2023-11-19 07:56:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-11-19 07:56:11,796 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-19 07:56:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-19 07:56:11,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-19 07:56:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:56:11,801 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-19 07:56:11,801 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:56:11,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2023-11-19 07:56:11,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-19 07:56:11,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:11,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:11,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:11,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:11,807 INFO L748 eck$LassoCheckResult]: Stem: 558#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 559#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; 560#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 549#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; 550#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 582#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); 580#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; 576#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 577#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); 575#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); 574#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 572#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 553#L370-4 main_~j~0#1 := 0; 554#L378-2 [2023-11-19 07:56:11,807 INFO L750 eck$LassoCheckResult]: Loop: 554#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); 555#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; 554#L378-2 [2023-11-19 07:56:11,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2023-11-19 07:56:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911782330] [2023-11-19 07:56:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:11,887 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-19 07:56:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911782330] [2023-11-19 07:56:11,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911782330] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957251147] [2023-11-19 07:56:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:11,895 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:11,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-19 07:56:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:11,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:56:11,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:11,992 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-19 07:56:11,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:56:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957251147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:11,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:56:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-19 07:56:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194974175] [2023-11-19 07:56:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:11,995 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:11,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2023-11-19 07:56:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721982088] [2023-11-19 07:56:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:12,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:12,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:12,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:56:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:12,069 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-19 07:56:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:12,101 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-11-19 07:56:12,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2023-11-19 07:56:12,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:12,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 32 transitions. [2023-11-19 07:56:12,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:56:12,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:56:12,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2023-11-19 07:56:12,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:12,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-19 07:56:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2023-11-19 07:56:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 07:56:12,110 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-19 07:56:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-19 07:56:12,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-19 07:56:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:12,116 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-19 07:56:12,116 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 07:56:12,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2023-11-19 07:56:12,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:12,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:12,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:12,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:12,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:12,118 INFO L748 eck$LassoCheckResult]: Stem: 671#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 672#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; 673#L367 assume !(main_~length~0#1 < 1); 662#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; 663#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 664#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); 674#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; 677#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 675#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); 676#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); 684#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 681#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 680#L370-4 main_~j~0#1 := 0; 679#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); 667#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; 668#L378-2 [2023-11-19 07:56:12,118 INFO L750 eck$LassoCheckResult]: Loop: 668#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); 678#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; 668#L378-2 [2023-11-19 07:56:12,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959587, now seen corresponding path program 1 times [2023-11-19 07:56:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472281899] [2023-11-19 07:56:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:12,783 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-19 07:56:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472281899] [2023-11-19 07:56:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472281899] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741729827] [2023-11-19 07:56:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:12,787 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:12,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-19 07:56:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:12,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 07:56:12,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:12,878 INFO L378 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-19 07:56:12,956 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-19 07:56:12,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-11-19 07:56:12,983 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-19 07:56:12,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-11-19 07:56:13,034 INFO L378 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-19 07:56:13,048 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-19 07:56:13,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:13,322 INFO L378 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 25 treesize of output 23 [2023-11-19 07:56:13,327 INFO L378 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 46 treesize of output 44 [2023-11-19 07:56:13,355 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-19 07:56:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741729827] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:13,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-19 07:56:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366801080] [2023-11-19 07:56:13,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:13,357 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:13,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2023-11-19 07:56:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269027021] [2023-11-19 07:56:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:13,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:13,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:13,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:13,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 07:56:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:56:13,421 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. cyclomatic complexity: 12 Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 21 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-19 07:56:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:13,654 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-19 07:56:13,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2023-11-19 07:56:13,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:13,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 32 transitions. [2023-11-19 07:56:13,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:56:13,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:56:13,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2023-11-19 07:56:13,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:13,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-19 07:56:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2023-11-19 07:56:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-11-19 07:56:13,658 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-19 07:56:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-19 07:56:13,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-19 07:56:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:56:13,661 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-19 07:56:13,662 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 07:56:13,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2023-11-19 07:56:13,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:13,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:13,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:13,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:13,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:13,663 INFO L748 eck$LassoCheckResult]: Stem: 837#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 838#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; 839#L367 assume !(main_~length~0#1 < 1); 828#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; 829#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 830#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); 840#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; 844#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 841#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); 842#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; 843#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 846#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 831#L370-4 main_~j~0#1 := 0; 832#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); 835#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; 836#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); 833#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; 834#L378-2 [2023-11-19 07:56:13,663 INFO L750 eck$LassoCheckResult]: Loop: 834#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); 845#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; 834#L378-2 [2023-11-19 07:56:13,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 2 times [2023-11-19 07:56:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280846629] [2023-11-19 07:56:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:14,178 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-19 07:56:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:14,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280846629] [2023-11-19 07:56:14,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280846629] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:14,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707943411] [2023-11-19 07:56:14,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:56:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:14,187 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:14,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-19 07:56:14,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:56:14,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:14,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-19 07:56:14,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:14,330 INFO L378 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-19 07:56:14,460 INFO L378 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-19 07:56:14,471 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-19 07:56:14,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:14,579 INFO L378 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-19 07:56:14,591 INFO L378 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-19 07:56:14,601 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-19 07:56:14,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707943411] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:14,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:14,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-19 07:56:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074140599] [2023-11-19 07:56:14,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:14,602 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:14,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:14,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2023-11-19 07:56:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219100610] [2023-11-19 07:56:14,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:14,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:14,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:14,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 07:56:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:56:14,667 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-19 07:56:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:14,884 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-11-19 07:56:14,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2023-11-19 07:56:14,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-19 07:56:14,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 44 transitions. [2023-11-19 07:56:14,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-19 07:56:14,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-19 07:56:14,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2023-11-19 07:56:14,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:14,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-19 07:56:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2023-11-19 07:56:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2023-11-19 07:56:14,888 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-19 07:56:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-19 07:56:14,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-19 07:56:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:56:14,890 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-19 07:56:14,890 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-19 07:56:14,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2023-11-19 07:56:14,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:14,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:14,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:14,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:14,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:14,921 INFO L748 eck$LassoCheckResult]: Stem: 1017#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1018#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; 1019#L367 assume !(main_~length~0#1 < 1); 1008#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; 1009#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1010#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); 1020#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; 1028#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1021#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); 1022#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; 1023#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1025#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1026#L370-4 main_~j~0#1 := 0; 1031#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); 1030#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; 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); 1015#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; 1016#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); 1013#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; 1014#L378-2 [2023-11-19 07:56:14,921 INFO L750 eck$LassoCheckResult]: Loop: 1014#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); 1029#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; 1014#L378-2 [2023-11-19 07:56:14,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2110686111, now seen corresponding path program 3 times [2023-11-19 07:56:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808660916] [2023-11-19 07:56:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:15,062 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-19 07:56:15,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:15,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808660916] [2023-11-19 07:56:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808660916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271229485] [2023-11-19 07:56:15,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:56:15,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:15,065 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:15,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-19 07:56:15,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 07:56:15,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:15,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:56:15,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:15,222 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-19 07:56:15,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:15,290 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-19 07:56:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271229485] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:15,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:15,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-19 07:56:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024673428] [2023-11-19 07:56:15,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:15,292 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:15,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2023-11-19 07:56:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973942630] [2023-11-19 07:56:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:15,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:15,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:56:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:56:15,360 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-19 07:56:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:15,471 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-19 07:56:15,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2023-11-19 07:56:15,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:15,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 41 transitions. [2023-11-19 07:56:15,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:56:15,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:56:15,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2023-11-19 07:56:15,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:15,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-19 07:56:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2023-11-19 07:56:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-11-19 07:56:15,475 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-19 07:56:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-11-19 07:56:15,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-19 07:56:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:56:15,478 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-19 07:56:15,478 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-19 07:56:15,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2023-11-19 07:56:15,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:15,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:15,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:15,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:15,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:15,480 INFO L748 eck$LassoCheckResult]: Stem: 1215#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1216#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; 1217#L367 assume !(main_~length~0#1 < 1); 1206#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; 1207#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1208#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); 1218#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; 1221#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1219#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); 1220#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; 1234#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1233#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); 1228#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); 1232#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1229#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1209#L370-4 main_~j~0#1 := 0; 1210#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); 1213#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; 1214#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); 1211#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; 1212#L378-2 [2023-11-19 07:56:15,480 INFO L750 eck$LassoCheckResult]: Loop: 1212#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); 1223#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; 1212#L378-2 [2023-11-19 07:56:15,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash -761055450, now seen corresponding path program 1 times [2023-11-19 07:56:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602872510] [2023-11-19 07:56:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:15,997 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-19 07:56:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602872510] [2023-11-19 07:56:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602872510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735399817] [2023-11-19 07:56:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:15,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:15,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:16,000 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:16,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-19 07:56:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:16,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 07:56:16,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:16,091 INFO L378 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-19 07:56:16,162 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-19 07:56:16,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 17 [2023-11-19 07:56:16,182 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-19 07:56:16,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 17 [2023-11-19 07:56:16,233 INFO L378 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-19 07:56:16,247 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-19 07:56:16,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:16,444 INFO L378 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-19 07:56:16,450 INFO L378 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-19 07:56:16,459 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-19 07:56:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735399817] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:16,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-11-19 07:56:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296280204] [2023-11-19 07:56:16,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:16,461 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:16,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2023-11-19 07:56:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596285422] [2023-11-19 07:56:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:16,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:16,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:56:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:56:16,527 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:16,736 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-11-19 07:56:16,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2023-11-19 07:56:16,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:16,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2023-11-19 07:56:16,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:56:16,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:56:16,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2023-11-19 07:56:16,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:16,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-19 07:56:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2023-11-19 07:56:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-11-19 07:56:16,739 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-19 07:56:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-19 07:56:16,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-19 07:56:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:56:16,741 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-19 07:56:16,741 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-19 07:56:16,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2023-11-19 07:56:16,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:16,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:16,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:16,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:16,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:16,743 INFO L748 eck$LassoCheckResult]: Stem: 1417#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1418#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; 1419#L367 assume !(main_~length~0#1 < 1); 1408#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; 1409#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1410#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); 1420#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; 1423#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1421#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); 1422#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; 1431#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1430#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); 1428#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; 1429#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1427#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1411#L370-4 main_~j~0#1 := 0; 1412#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); 1415#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; 1416#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); 1424#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; 1425#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); 1413#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; 1414#L378-2 [2023-11-19 07:56:16,744 INFO L750 eck$LassoCheckResult]: Loop: 1414#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); 1426#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; 1414#L378-2 [2023-11-19 07:56:16,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1622874713, now seen corresponding path program 4 times [2023-11-19 07:56:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601744475] [2023-11-19 07:56:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:17,150 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-19 07:56:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601744475] [2023-11-19 07:56:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601744475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155745877] [2023-11-19 07:56:17,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 07:56:17,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:17,155 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:17,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-19 07:56:17,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 07:56:17,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:17,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-19 07:56:17,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:17,287 INFO L378 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-19 07:56:17,396 INFO L378 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-19 07:56:17,413 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-19 07:56:17,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:17,554 INFO L378 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-19 07:56:17,558 INFO L378 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-19 07:56:17,582 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-19 07:56:17,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155745877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:17,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2023-11-19 07:56:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780746378] [2023-11-19 07:56:17,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:17,584 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:17,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2023-11-19 07:56:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:17,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382657609] [2023-11-19 07:56:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:17,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:17,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:56:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:56:17,654 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-19 07:56:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:17,879 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-19 07:56:17,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2023-11-19 07:56:17,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-19 07:56:17,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 52 transitions. [2023-11-19 07:56:17,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-19 07:56:17,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-19 07:56:17,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2023-11-19 07:56:17,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:17,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-19 07:56:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2023-11-19 07:56:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2023-11-19 07:56:17,884 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-19 07:56:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-11-19 07:56:17,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-19 07:56:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:56:17,886 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-19 07:56:17,887 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-19 07:56:17,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2023-11-19 07:56:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:17,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:17,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:17,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:17,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:17,889 INFO L748 eck$LassoCheckResult]: Stem: 1633#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1634#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; 1635#L367 assume !(main_~length~0#1 < 1); 1624#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; 1625#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1626#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); 1636#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; 1646#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1647#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); 1648#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; 1649#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1637#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); 1638#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; 1641#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1642#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1631#L370-4 main_~j~0#1 := 0; 1632#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); 1653#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; 1652#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); 1629#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; 1630#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); 1640#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; 1651#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); 1627#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; 1628#L378-2 [2023-11-19 07:56:17,889 INFO L750 eck$LassoCheckResult]: Loop: 1628#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; 1628#L378-2 [2023-11-19 07:56:17,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -509471318, now seen corresponding path program 5 times [2023-11-19 07:56:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957857093] [2023-11-19 07:56:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:18,067 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-19 07:56:18,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957857093] [2023-11-19 07:56:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957857093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26617716] [2023-11-19 07:56:18,068 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-19 07:56:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:18,070 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:18,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-19 07:56:18,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-19 07:56:18,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:18,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 07:56:18,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:18,275 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-19 07:56:18,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:18,367 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-19 07:56:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26617716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:18,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-19 07:56:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548315112] [2023-11-19 07:56:18,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:18,368 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:18,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:18,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2023-11-19 07:56:18,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:18,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278605780] [2023-11-19 07:56:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:18,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:18,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:18,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:56:18,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:56:18,431 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-19 07:56:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:18,565 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-11-19 07:56:18,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2023-11-19 07:56:18,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:18,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 47 transitions. [2023-11-19 07:56:18,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:56:18,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:56:18,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2023-11-19 07:56:18,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:18,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-11-19 07:56:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2023-11-19 07:56:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2023-11-19 07:56:18,569 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-19 07:56:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-19 07:56:18,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-19 07:56:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:56:18,575 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-19 07:56:18,576 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-19 07:56:18,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2023-11-19 07:56:18,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:18,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:18,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:18,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:18,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:18,578 INFO L748 eck$LassoCheckResult]: Stem: 1878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1879#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; 1880#L367 assume !(main_~length~0#1 < 1); 1869#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; 1870#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1871#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); 1881#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; 1902#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1882#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); 1883#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; 1885#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1886#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); 1901#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; 1900#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1899#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); 1888#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); 1898#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1895#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1894#L370-4 main_~j~0#1 := 0; 1893#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); 1884#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; 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); 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; 1889#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); 1872#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; 1873#L378-2 [2023-11-19 07:56:18,579 INFO L750 eck$LassoCheckResult]: Loop: 1873#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); 1891#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; 1873#L378-2 [2023-11-19 07:56:18,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1285147747, now seen corresponding path program 2 times [2023-11-19 07:56:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001414086] [2023-11-19 07:56:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:19,263 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-19 07:56:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001414086] [2023-11-19 07:56:19,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001414086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:19,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721204871] [2023-11-19 07:56:19,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:56:19,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:19,266 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:19,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-19 07:56:19,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:56:19,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:19,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-19 07:56:19,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:19,468 INFO L378 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-19 07:56:19,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:56:19,580 INFO L378 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-19 07:56:19,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:56:19,598 INFO L378 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-19 07:56:19,771 INFO L378 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-19 07:56:19,788 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-19 07:56:19,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:20,101 INFO L378 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-19 07:56:20,105 INFO L378 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-19 07:56:20,122 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-19 07:56:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721204871] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:20,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 26 [2023-11-19 07:56:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809526022] [2023-11-19 07:56:20,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:20,123 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:20,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2023-11-19 07:56:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998813572] [2023-11-19 07:56:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:20,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:20,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:20,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 07:56:20,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-11-19 07:56:20,193 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-19 07:56:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:20,579 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-11-19 07:56:20,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2023-11-19 07:56:20,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:20,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 48 transitions. [2023-11-19 07:56:20,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:56:20,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:56:20,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2023-11-19 07:56:20,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:56:20,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-11-19 07:56:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2023-11-19 07:56:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2023-11-19 07:56:20,583 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-19 07:56:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-19 07:56:20,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-19 07:56:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:56:20,585 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-19 07:56:20,586 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-19 07:56:20,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2023-11-19 07:56:20,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-19 07:56:20,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:56:20,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:56:20,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:20,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-19 07:56:20,588 INFO L748 eck$LassoCheckResult]: Stem: 2134#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2135#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; 2136#L367 assume !(main_~length~0#1 < 1); 2125#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; 2126#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2127#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); 2137#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; 2141#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2138#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); 2139#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; 2153#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2152#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); 2151#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; 2150#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2149#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); 2143#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; 2147#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2142#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2132#L370-4 main_~j~0#1 := 0; 2133#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); 2130#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; 2131#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); 2140#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; 2148#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; 2144#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); 2128#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; 2129#L378-2 [2023-11-19 07:56:20,588 INFO L750 eck$LassoCheckResult]: Loop: 2129#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); 2146#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; 2129#L378-2 [2023-11-19 07:56:20,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1665431516, now seen corresponding path program 6 times [2023-11-19 07:56:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264823673] [2023-11-19 07:56:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:21,095 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-19 07:56:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264823673] [2023-11-19 07:56:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264823673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438396214] [2023-11-19 07:56:21,096 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-19 07:56:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:21,098 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:21,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-19 07:56:21,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-19 07:56:21,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:56:21,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-19 07:56:21,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:21,286 INFO L378 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-19 07:56:21,790 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-19 07:56:21,791 INFO L378 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-19 07:56:21,812 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-19 07:56:21,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:56:22,478 INFO L378 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-19 07:56:22,483 INFO L378 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-19 07:56:22,573 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-19 07:56:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438396214] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:56:22,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:56:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-19 07:56:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233417132] [2023-11-19 07:56:22,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:56:22,575 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:56:22,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2023-11-19 07:56:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:22,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138538869] [2023-11-19 07:56:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:22,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:56:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:56:22,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:56:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-19 07:56:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2023-11-19 07:56:22,648 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-19 07:56:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:24,821 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-19 07:56:24,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2023-11-19 07:56:24,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-19 07:56:24,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2023-11-19 07:56:24,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-19 07:56:24,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-19 07:56:24,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-19 07:56:24,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:24,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:56:24,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:56:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-19 07:56:24,824 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:56:24,824 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-19 07:56:24,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:56:24,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-19 07:56:24,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-19 07:56:24,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 07:56:24 BoogieIcfgContainer [2023-11-19 07:56:24,830 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-19 07:56:24,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:56:24,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:56:24,832 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:56:24,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:05" (3/4) ... [2023-11-19 07:56:24,834 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:56:24,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:56:24,836 INFO L158 Benchmark]: Toolchain (without parser) took 20379.43ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 140.0MB in the beginning and 189.8MB in the end (delta: -49.8MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2023-11-19 07:56:24,836 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 111.1MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:56:24,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.91ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 121.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-19 07:56:24,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.21ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:56:24,841 INFO L158 Benchmark]: Boogie Preprocessor took 52.55ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 119.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:56:24,842 INFO L158 Benchmark]: RCFGBuilder took 318.87ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 108.1MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:56:24,842 INFO L158 Benchmark]: BuchiAutomizer took 19381.18ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 107.7MB in the beginning and 189.8MB in the end (delta: -82.1MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2023-11-19 07:56:24,842 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 308.3MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:56:24,844 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.48ms. Allocated memory is still 111.1MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.91ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 121.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.21ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.55ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 119.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 318.87ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 108.1MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 19381.18ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 107.7MB in the beginning and 189.8MB in the end (delta: -82.1MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 308.3MB. Free memory is still 189.8MB. 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 19.3s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 14.5s. Construction of modules took 1.6s. Büchi inclusion checks took 2.8s. 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, 423 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 607 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 128 mSDtfsCounter, 1799 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: 46ms 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-19 07:56:24,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:25,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-11-19 07:56:25,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-11-19 07:56:25,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-11-19 07:56:25,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-11-19 07:56:25,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-11-19 07:56:26,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-11-19 07:56:26,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-11-19 07:56:26,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-19 07:56:26,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-11-19 07:56:26,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-19 07:56:27,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ad6af22-70cb-4b48-9dc4-532ca7294f54/bin/uautomizer-verify-uCwYo4JHxu/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