./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:49:25,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:49:25,648 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:49:25,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:49:25,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:49:25,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:49:25,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:49:25,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:49:25,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:49:25,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:49:25,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:49:25,675 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:49:25,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:49:25,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:49:25,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:49:25,676 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:49:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:49:25,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2024-12-06 05:49:25,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:49:25,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:49:25,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:49:25,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:49:25,917 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:49:25,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2024-12-06 05:49:28,514 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/data/4bb432dd1/19ade4f5309f4517992bf5ed5bc34ce0/FLAGf4733ecc1 [2024-12-06 05:49:29,110 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:49:29,111 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2024-12-06 05:49:29,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/data/4bb432dd1/19ade4f5309f4517992bf5ed5bc34ce0/FLAGf4733ecc1 [2024-12-06 05:49:29,596 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/data/4bb432dd1/19ade4f5309f4517992bf5ed5bc34ce0 [2024-12-06 05:49:29,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:49:29,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:49:29,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:49:29,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:49:29,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:49:29,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:49:29" (1/1) ... [2024-12-06 05:49:29,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5932316f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:29, skipping insertion in model container [2024-12-06 05:49:29,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:49:29" (1/1) ... [2024-12-06 05:49:29,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:49:31,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2024-12-06 05:49:31,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2024-12-06 05:49:31,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:49:31,236 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:49:32,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2024-12-06 05:49:32,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2024-12-06 05:49:32,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:49:32,141 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:49:32,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32 WrapperNode [2024-12-06 05:49:32,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:49:32,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:49:32,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:49:32,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:49:32,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,458 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-12-06 05:49:32,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:49:32,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:49:32,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:49:32,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:49:32,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:49:32,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:49:32,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:49:32,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:49:32,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:49:32" (1/1) ... [2024-12-06 05:49:32,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:49:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:49:32,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:49:32,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:49:32,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-12-06 05:49:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-12-06 05:49:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-12-06 05:49:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-12-06 05:49:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-12-06 05:49:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-12-06 05:49:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:49:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-12-06 05:49:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-12-06 05:49:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:49:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:49:33,025 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:49:33,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:49:41,142 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-12-06 05:49:41,142 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:49:43,143 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:49:43,144 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-12-06 05:49:43,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:49:43 BoogieIcfgContainer [2024-12-06 05:49:43,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:49:43,146 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:49:43,146 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:49:43,156 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:49:43,156 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:49:43" (1/1) ... [2024-12-06 05:49:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:49:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 1717 states and 3378 transitions. [2024-12-06 05:49:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 3378 transitions. [2024-12-06 05:49:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:49:43,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:49:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 1721 states and 3384 transitions. [2024-12-06 05:49:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3384 transitions. [2024-12-06 05:49:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:49:43,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:49:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 1722 states and 3384 transitions. [2024-12-06 05:49:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3384 transitions. [2024-12-06 05:49:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:49:43,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:49:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 1729 states and 3397 transitions. [2024-12-06 05:49:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3397 transitions. [2024-12-06 05:49:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 05:49:44,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:49:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 1741 states and 3423 transitions. [2024-12-06 05:49:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 3423 transitions. [2024-12-06 05:49:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 05:49:44,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:49:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 1744 states and 3428 transitions. [2024-12-06 05:49:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3428 transitions. [2024-12-06 05:49:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:49:45,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:49:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 1742 states and 3423 transitions. [2024-12-06 05:49:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3423 transitions. [2024-12-06 05:49:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:49:45,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:49:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 1739 states and 3415 transitions. [2024-12-06 05:49:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 3415 transitions. [2024-12-06 05:49:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 05:49:45,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:49:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 1751 states and 3441 transitions. [2024-12-06 05:49:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 3441 transitions. [2024-12-06 05:49:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 05:49:47,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:49:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 1753 states and 3447 transitions. [2024-12-06 05:49:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3447 transitions. [2024-12-06 05:49:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-06 05:49:47,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:49:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 1750 states and 3438 transitions. [2024-12-06 05:49:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3438 transitions. [2024-12-06 05:49:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-06 05:49:47,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:49:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1754 states and 3444 transitions. [2024-12-06 05:49:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3444 transitions. [2024-12-06 05:49:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 05:49:48,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:48,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:49:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 1754 states and 3443 transitions. [2024-12-06 05:49:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3443 transitions. [2024-12-06 05:49:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:49:48,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:49:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1756 states and 3447 transitions. [2024-12-06 05:49:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3447 transitions. [2024-12-06 05:49:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 05:49:48,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:49:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 1766 states and 3464 transitions. [2024-12-06 05:49:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3464 transitions. [2024-12-06 05:49:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-06 05:49:48,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2024-12-06 05:49:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2024-12-06 05:49:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-06 05:49:49,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:49:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 1771 states and 3472 transitions. [2024-12-06 05:49:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3472 transitions. [2024-12-06 05:49:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-06 05:49:49,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 1773 states and 3475 transitions. [2024-12-06 05:49:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 3475 transitions. [2024-12-06 05:49:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-06 05:49:49,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-06 05:49:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1775 states and 3477 transitions. [2024-12-06 05:49:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3477 transitions. [2024-12-06 05:49:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 05:49:49,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:49,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:49:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 1779 states and 3485 transitions. [2024-12-06 05:49:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3485 transitions. [2024-12-06 05:49:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 05:49:49,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:49,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 1786 states and 3501 transitions. [2024-12-06 05:49:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 3501 transitions. [2024-12-06 05:49:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 05:49:50,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:49:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 1793 states and 3522 transitions. [2024-12-06 05:49:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2024-12-06 05:49:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 05:49:51,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:51,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:49:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1795 states and 3527 transitions. [2024-12-06 05:49:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3527 transitions. [2024-12-06 05:49:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-06 05:49:51,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:49:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 1793 states and 3521 transitions. [2024-12-06 05:49:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3521 transitions. [2024-12-06 05:49:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-06 05:49:51,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:49:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 1789 states and 3510 transitions. [2024-12-06 05:49:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 3510 transitions. [2024-12-06 05:49:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 05:49:51,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:49:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 1790 states and 3510 transitions. [2024-12-06 05:49:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3510 transitions. [2024-12-06 05:49:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-06 05:49:51,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 1798 states and 3525 transitions. [2024-12-06 05:49:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3525 transitions. [2024-12-06 05:49:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-06 05:49:52,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:52,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1800 states and 3529 transitions. [2024-12-06 05:49:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3529 transitions. [2024-12-06 05:49:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 05:49:52,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 1805 states and 3540 transitions. [2024-12-06 05:49:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3540 transitions. [2024-12-06 05:49:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 05:49:53,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:49:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1809 states and 3546 transitions. [2024-12-06 05:49:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3546 transitions. [2024-12-06 05:49:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 05:49:53,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:49:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 1820 states and 3569 transitions. [2024-12-06 05:49:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 3569 transitions. [2024-12-06 05:49:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 05:49:54,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:49:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 1820 states and 3569 transitions. [2024-12-06 05:49:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 3569 transitions. [2024-12-06 05:49:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 05:49:54,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:49:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 1820 states and 3569 transitions. [2024-12-06 05:49:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 3569 transitions. [2024-12-06 05:49:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 05:49:54,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:54,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:49:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 1820 states and 3569 transitions. [2024-12-06 05:49:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 3569 transitions. [2024-12-06 05:49:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 05:49:54,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 05:49:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 1822 states and 3571 transitions. [2024-12-06 05:49:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3571 transitions. [2024-12-06 05:49:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 05:49:55,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 05:49:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 1827 states and 3580 transitions. [2024-12-06 05:49:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3580 transitions. [2024-12-06 05:49:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 05:49:55,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 05:49:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 1827 states and 3579 transitions. [2024-12-06 05:49:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3579 transitions. [2024-12-06 05:49:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-06 05:49:56,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 05:49:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 1829 states and 3581 transitions. [2024-12-06 05:49:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3581 transitions. [2024-12-06 05:49:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 05:49:56,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:49:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 1836 states and 3595 transitions. [2024-12-06 05:49:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 3595 transitions. [2024-12-06 05:49:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 05:49:57,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:49:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 1840 states and 3601 transitions. [2024-12-06 05:49:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 3601 transitions. [2024-12-06 05:49:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-06 05:49:57,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 05:49:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 1845 states and 3610 transitions. [2024-12-06 05:49:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3610 transitions. [2024-12-06 05:49:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-06 05:49:58,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 05:49:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 1850 states and 3620 transitions. [2024-12-06 05:49:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 3620 transitions. [2024-12-06 05:49:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:49:58,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:58,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-06 05:49:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 1852 states and 3623 transitions. [2024-12-06 05:49:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 3623 transitions. [2024-12-06 05:49:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:49:58,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:49:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 1857 states and 3632 transitions. [2024-12-06 05:49:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 3632 transitions. [2024-12-06 05:49:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:49:58,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-06 05:49:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 1861 states and 3638 transitions. [2024-12-06 05:49:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 3638 transitions. [2024-12-06 05:49:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:49:59,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:50:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 1871 states and 3658 transitions. [2024-12-06 05:50:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 3658 transitions. [2024-12-06 05:50:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 05:50:00,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-12-06 05:50:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 1890 states and 3715 transitions. [2024-12-06 05:50:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 3715 transitions. [2024-12-06 05:50:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 05:50:03,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:50:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 1899 states and 3735 transitions. [2024-12-06 05:50:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3735 transitions. [2024-12-06 05:50:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 05:50:04,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:50:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 1904 states and 3750 transitions. [2024-12-06 05:50:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3750 transitions. [2024-12-06 05:50:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 05:50:05,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 05:50:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 1908 states and 3758 transitions. [2024-12-06 05:50:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3758 transitions. [2024-12-06 05:50:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 05:50:05,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 05:50:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 1912 states and 3765 transitions. [2024-12-06 05:50:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3765 transitions. [2024-12-06 05:50:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 05:50:06,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:50:06,187 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 05:50:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:50:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:50:06,423 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 05:50:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:50:06,587 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 51 iterations. [2024-12-06 05:50:06,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:50:06 ImpRootNode [2024-12-06 05:50:06,748 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:50:06,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:50:06,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:50:06,749 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:50:06,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:49:43" (3/4) ... [2024-12-06 05:50:06,751 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 05:50:06,870 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 102. [2024-12-06 05:50:06,977 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:50:06,977 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:50:06,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:50:06,979 INFO L158 Benchmark]: Toolchain (without parser) took 37379.06ms. Allocated memory was 117.4MB in the beginning and 620.8MB in the end (delta: 503.3MB). Free memory was 59.0MB in the beginning and 357.9MB in the end (delta: -299.0MB). Peak memory consumption was 200.2MB. Max. memory is 16.1GB. [2024-12-06 05:50:06,979 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:50:06,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2541.80ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 59.0MB in the beginning and 73.4MB in the end (delta: -14.4MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-12-06 05:50:06,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 315.80ms. Allocated memory is still 209.7MB. Free memory was 73.4MB in the beginning and 70.3MB in the end (delta: 3.1MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-12-06 05:50:06,980 INFO L158 Benchmark]: Boogie Preprocessor took 418.72ms. Allocated memory was 209.7MB in the beginning and 511.7MB in the end (delta: 302.0MB). Free memory was 70.3MB in the beginning and 333.0MB in the end (delta: -262.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-12-06 05:50:06,981 INFO L158 Benchmark]: RCFGBuilder took 10265.68ms. Allocated memory was 511.7MB in the beginning and 562.0MB in the end (delta: 50.3MB). Free memory was 333.0MB in the beginning and 268.3MB in the end (delta: 64.8MB). Peak memory consumption was 322.5MB. Max. memory is 16.1GB. [2024-12-06 05:50:06,981 INFO L158 Benchmark]: CodeCheck took 23602.18ms. Allocated memory was 562.0MB in the beginning and 620.8MB in the end (delta: 58.7MB). Free memory was 268.3MB in the beginning and 378.9MB in the end (delta: -110.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:50:06,982 INFO L158 Benchmark]: Witness Printer took 228.41ms. Allocated memory is still 620.8MB. Free memory was 378.9MB in the beginning and 357.9MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:50:06,985 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 8 procedures, 1717 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 51, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19242 SdHoareTripleChecker+Valid, 33.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11371 mSDsluCounter, 28946 SdHoareTripleChecker+Invalid, 28.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18813 mSDsCounter, 6847 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22620 IncrementalHoareTripleChecker+Invalid, 29467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6847 mSolverCounterUnsat, 10133 mSDtfsCounter, 22620 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30543 GetRequests, 30021 SyntacticMatches, 164 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61838 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3200 NumberOfCodeBlocks, 3200 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3056 ConstructedInterpolants, 0 QuantifiedInterpolants, 5163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 41 PerfectInterpolantSequences, 1130/1175 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) [L11429] COND FALSE !(T1_E == 0) [L11434] COND FALSE !(E_M == 0) [L11439] COND FALSE !(E_1 == 0) [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) [L11457] COND FALSE !(T1_E == 1) [L11462] COND FALSE !(E_M == 1) [L11467] COND FALSE !(E_1 == 1) [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=-1] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=-1] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=-1] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2541.80ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 59.0MB in the beginning and 73.4MB in the end (delta: -14.4MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 315.80ms. Allocated memory is still 209.7MB. Free memory was 73.4MB in the beginning and 70.3MB in the end (delta: 3.1MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 418.72ms. Allocated memory was 209.7MB in the beginning and 511.7MB in the end (delta: 302.0MB). Free memory was 70.3MB in the beginning and 333.0MB in the end (delta: -262.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * RCFGBuilder took 10265.68ms. Allocated memory was 511.7MB in the beginning and 562.0MB in the end (delta: 50.3MB). Free memory was 333.0MB in the beginning and 268.3MB in the end (delta: 64.8MB). Peak memory consumption was 322.5MB. Max. memory is 16.1GB. * CodeCheck took 23602.18ms. Allocated memory was 562.0MB in the beginning and 620.8MB in the end (delta: 58.7MB). Free memory was 268.3MB in the beginning and 378.9MB in the end (delta: -110.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 228.41ms. Allocated memory is still 620.8MB. Free memory was 378.9MB in the beginning and 357.9MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 05:50:07,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b674628-45f2-47c1-9f40-62315fbe137b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE