./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.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_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/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_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/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_087c3790-9fe6-4482-a136-6dc1da0cb781/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 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:49:41,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:49:41,825 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:49:41,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:49:41,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:49:41,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:49:41,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:49:41,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:49:41,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:49:41,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:49:41,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:49:41,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:49:41,852 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:49:41,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:49:41,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:49:41,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:49:41,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:49:41,853 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:49:41,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:49:41,853 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_087c3790-9fe6-4482-a136-6dc1da0cb781/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 -> 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d [2024-12-05 23:49:42,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:49:42,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:49:42,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:49:42,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:49:42,065 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:49:42,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-12-05 23:49:44,657 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/data/4d7b4d452/666be57a83134c9f8fb598c3204e5cb6/FLAG078a6af81 [2024-12-05 23:49:44,867 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:49:44,868 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-12-05 23:49:44,876 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/data/4d7b4d452/666be57a83134c9f8fb598c3204e5cb6/FLAG078a6af81 [2024-12-05 23:49:44,888 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/data/4d7b4d452/666be57a83134c9f8fb598c3204e5cb6 [2024-12-05 23:49:44,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:49:44,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:49:44,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:49:44,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:49:44,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:49:44,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:49:44" (1/1) ... [2024-12-05 23:49:44,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6a4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:44, skipping insertion in model container [2024-12-05 23:49:44,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:49:44" (1/1) ... [2024-12-05 23:49:44,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:49:45,111 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_087c3790-9fe6-4482-a136-6dc1da0cb781/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2024-12-05 23:49:45,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:49:45,124 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:49:45,174 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_087c3790-9fe6-4482-a136-6dc1da0cb781/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2024-12-05 23:49:45,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:49:45,188 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:49:45,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45 WrapperNode [2024-12-05 23:49:45,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:49:45,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:49:45,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:49:45,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:49:45,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,229 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-12-05 23:49:45,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:49:45,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:49:45,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:49:45,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:49:45,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:49:45,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:49:45,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:49:45,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:49:45,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:49:45" (1/1) ... [2024-12-05 23:49:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:49:45,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:49:45,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:49:45,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:49:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:49:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:49:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:49:45,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:49:45,397 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:49:45,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:49:45,872 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-12-05 23:49:45,872 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:49:46,319 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:49:46,320 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-05 23:49:46,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:49:46 BoogieIcfgContainer [2024-12-05 23:49:46,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:49:46,321 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:49:46,321 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:49:46,330 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:49:46,330 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:49:46" (1/1) ... [2024-12-05 23:49:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:49:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-05 23:49:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-05 23:49:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 23:49:46,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:48,505 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-05 23:49:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-05 23:49:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-05 23:49:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:49:48,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:49,518 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-05 23:49:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-05 23:49:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-05 23:49:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 23:49:49,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:50,529 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-05 23:49:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-05 23:49:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-05 23:49:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 23:49:50,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:51,886 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-05 23:49:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-05 23:49:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-05 23:49:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-05 23:49:52,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:53,467 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-05 23:49:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 38 states and 70 transitions. [2024-12-05 23:49:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 70 transitions. [2024-12-05 23:49:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:49:53,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:54,474 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-05 23:49:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 44 states and 83 transitions. [2024-12-05 23:49:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 83 transitions. [2024-12-05 23:49:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 23:49:55,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:55,389 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-05 23:49:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 45 states and 83 transitions. [2024-12-05 23:49:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2024-12-05 23:49:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:49:55,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:56,163 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-05 23:49:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 55 states and 102 transitions. [2024-12-05 23:49:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2024-12-05 23:49:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:49:57,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:58,293 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-05 23:49:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 64 states and 118 transitions. [2024-12-05 23:49:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 118 transitions. [2024-12-05 23:49:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:49:59,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:59,839 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-05 23:50:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 67 states and 124 transitions. [2024-12-05 23:50:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 124 transitions. [2024-12-05 23:50:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 23:50:00,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 83 states and 158 transitions. [2024-12-05 23:50:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 158 transitions. [2024-12-05 23:50:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:50:05,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 95 states and 192 transitions. [2024-12-05 23:50:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 192 transitions. [2024-12-05 23:50:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:50:09,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 110 states and 224 transitions. [2024-12-05 23:50:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 224 transitions. [2024-12-05 23:50:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:50:14,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 118 states and 246 transitions. [2024-12-05 23:50:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 246 transitions. [2024-12-05 23:50:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:50:18,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 125 states and 270 transitions. [2024-12-05 23:50:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 270 transitions. [2024-12-05 23:50:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:50:21,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 127 states and 281 transitions. [2024-12-05 23:50:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 281 transitions. [2024-12-05 23:50:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:50:23,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 135 states and 306 transitions. [2024-12-05 23:50:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 306 transitions. [2024-12-05 23:50:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:50:28,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 138 states and 320 transitions. [2024-12-05 23:50:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 320 transitions. [2024-12-05 23:50:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:50:30,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 143 states and 336 transitions. [2024-12-05 23:50:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 336 transitions. [2024-12-05 23:50:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:50:34,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 144 states and 339 transitions. [2024-12-05 23:50:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 339 transitions. [2024-12-05 23:50:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 23:50:35,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 163 states and 379 transitions. [2024-12-05 23:50:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 379 transitions. [2024-12-05 23:50:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 23:50:42,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 166 states and 396 transitions. [2024-12-05 23:50:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 396 transitions. [2024-12-05 23:50:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 23:50:46,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 170 states and 414 transitions. [2024-12-05 23:50:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 414 transitions. [2024-12-05 23:50:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 23:50:51,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 171 states and 415 transitions. [2024-12-05 23:50:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 415 transitions. [2024-12-05 23:50:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 23:50:53,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 172 states and 421 transitions. [2024-12-05 23:50:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 421 transitions. [2024-12-05 23:50:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 23:50:57,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 183 states and 451 transitions. [2024-12-05 23:51:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 451 transitions. [2024-12-05 23:51:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 23:51:02,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 192 states and 471 transitions. [2024-12-05 23:51:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 471 transitions. [2024-12-05 23:51:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 23:51:09,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:51:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 193 states and 472 transitions. [2024-12-05 23:51:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 472 transitions. [2024-12-05 23:51:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 23:51:09,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:51:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 194 states and 473 transitions. [2024-12-05 23:51:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 473 transitions. [2024-12-05 23:51:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-05 23:51:10,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:51:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 194 states and 472 transitions. [2024-12-05 23:51:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 472 transitions. [2024-12-05 23:51:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 23:51:10,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 208 states and 526 transitions. [2024-12-05 23:51:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 526 transitions. [2024-12-05 23:51:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 23:51:19,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 222 states and 586 transitions. [2024-12-05 23:51:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 586 transitions. [2024-12-05 23:51:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 23:51:31,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 236 states and 645 transitions. [2024-12-05 23:51:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 645 transitions. [2024-12-05 23:51:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:51:43,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:43,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 251 states and 687 transitions. [2024-12-05 23:51:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 687 transitions. [2024-12-05 23:51:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:51:53,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 261 states and 710 transitions. [2024-12-05 23:52:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 710 transitions. [2024-12-05 23:52:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:52:01,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 262 states and 717 transitions. [2024-12-05 23:52:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 717 transitions. [2024-12-05 23:52:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:52:03,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 274 states and 742 transitions. [2024-12-05 23:52:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 742 transitions. [2024-12-05 23:52:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:52:14,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 287 states and 773 transitions. [2024-12-05 23:52:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 773 transitions. [2024-12-05 23:52:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:52:24,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 288 states and 777 transitions. [2024-12-05 23:52:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 777 transitions. [2024-12-05 23:52:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:52:25,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-05 23:52:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 293 states and 792 transitions. [2024-12-05 23:52:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 792 transitions. [2024-12-05 23:52:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:52:31,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 305 states and 823 transitions. [2024-12-05 23:52:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 823 transitions. [2024-12-05 23:52:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:52:41,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 316 states and 860 transitions. [2024-12-05 23:52:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 860 transitions. [2024-12-05 23:52:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:52:51,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 321 states and 877 transitions. [2024-12-05 23:52:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 877 transitions. [2024-12-05 23:52:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:52:59,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 333 states and 910 transitions. [2024-12-05 23:53:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 910 transitions. [2024-12-05 23:53:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:53:13,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 341 states and 939 transitions. [2024-12-05 23:53:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 939 transitions. [2024-12-05 23:53:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:53:26,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 350 states and 959 transitions. [2024-12-05 23:53:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 959 transitions. [2024-12-05 23:53:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:53:35,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 363 states and 1000 transitions. [2024-12-05 23:53:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 1000 transitions. [2024-12-05 23:53:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:53:50,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 365 states and 1007 transitions. [2024-12-05 23:53:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1007 transitions. [2024-12-05 23:53:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:53:53,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 372 states and 1036 transitions. [2024-12-05 23:54:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1036 transitions. [2024-12-05 23:54:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:06,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 380 states and 1054 transitions. [2024-12-05 23:54:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1054 transitions. [2024-12-05 23:54:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:15,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 382 states and 1066 transitions. [2024-12-05 23:54:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1066 transitions. [2024-12-05 23:54:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:20,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 387 states and 1088 transitions. [2024-12-05 23:54:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1088 transitions. [2024-12-05 23:54:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:29,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 388 states and 1099 transitions. [2024-12-05 23:54:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1099 transitions. [2024-12-05 23:54:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:31,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 393 states and 1119 transitions. [2024-12-05 23:54:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1119 transitions. [2024-12-05 23:54:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:42,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 394 states and 1119 transitions. [2024-12-05 23:54:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1119 transitions. [2024-12-05 23:54:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:54:46,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:54:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:54:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:55:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:55:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 400 states and 1135 transitions. [2024-12-05 23:55:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1135 transitions. [2024-12-05 23:55:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:55:04,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:55:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:55:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:55:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:55:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:55:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 402 states and 1150 transitions. [2024-12-05 23:55:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1150 transitions. [2024-12-05 23:55:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:55:10,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:55:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:55:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:55:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:55:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:55:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 410 states and 1180 transitions. [2024-12-05 23:55:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1180 transitions. [2024-12-05 23:55:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:55:25,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:55:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:55:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:55:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:55:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:55:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 421 states and 1207 transitions. [2024-12-05 23:55:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1207 transitions. [2024-12-05 23:55:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:55:42,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:55:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:55:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:55:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:55:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:55:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 425 states and 1222 transitions. [2024-12-05 23:55:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1222 transitions. [2024-12-05 23:55:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:55:49,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:55:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:55:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:55:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:55:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:55:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 426 states and 1234 transitions. [2024-12-05 23:55:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1234 transitions. [2024-12-05 23:55:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:55:55,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:55:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:55:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:55:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:56:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 437 states and 1271 transitions. [2024-12-05 23:56:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1271 transitions. [2024-12-05 23:56:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:56:13,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:56:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 448 states and 1301 transitions. [2024-12-05 23:56:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1301 transitions. [2024-12-05 23:56:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:56:30,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:56:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 457 states and 1325 transitions. [2024-12-05 23:56:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1325 transitions. [2024-12-05 23:56:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:56:48,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:56:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 460 states and 1339 transitions. [2024-12-05 23:56:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1339 transitions. [2024-12-05 23:56:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:56:54,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:56:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 462 states and 1352 transitions. [2024-12-05 23:56:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1352 transitions. [2024-12-05 23:56:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:56:59,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 466 states and 1367 transitions. [2024-12-05 23:57:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1367 transitions. [2024-12-05 23:57:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:57:06,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 471 states and 1394 transitions. [2024-12-05 23:57:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1394 transitions. [2024-12-05 23:57:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:57:16,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 475 states and 1420 transitions. [2024-12-05 23:57:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1420 transitions. [2024-12-05 23:57:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:57:24,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 477 states and 1433 transitions. [2024-12-05 23:57:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1433 transitions. [2024-12-05 23:57:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:57:28,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 482 states and 1452 transitions. [2024-12-05 23:57:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1452 transitions. [2024-12-05 23:57:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:57:38,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:38,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 484 states and 1460 transitions. [2024-12-05 23:57:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1460 transitions. [2024-12-05 23:57:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:57:44,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 485 states and 1462 transitions. [2024-12-05 23:57:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1462 transitions. [2024-12-05 23:57:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:57:47,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 492 states and 1487 transitions. [2024-12-05 23:58:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1487 transitions. [2024-12-05 23:58:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:58:03,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 497 states and 1510 transitions. [2024-12-05 23:58:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1510 transitions. [2024-12-05 23:58:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:58:25,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 502 states and 1517 transitions. [2024-12-05 23:58:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1517 transitions. [2024-12-05 23:58:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:58:39,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 504 states and 1526 transitions. [2024-12-05 23:58:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1526 transitions. [2024-12-05 23:58:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:58:46,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 509 states and 1549 transitions. [2024-12-05 23:58:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1549 transitions. [2024-12-05 23:58:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:58:58,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:59:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 510 states and 1550 transitions. [2024-12-05 23:59:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1550 transitions. [2024-12-05 23:59:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-05 23:59:03,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:59:04,564 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 23:59:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:59:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:59:05,791 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 23:59:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:59:06,482 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 80 iterations. [2024-12-05 23:59:06,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:59:06 ImpRootNode [2024-12-05 23:59:06,592 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:59:06,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:59:06,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:59:06,594 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:59:06,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:49:46" (3/4) ... [2024-12-05 23:59:06,596 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-05 23:59:06,876 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 189. [2024-12-05 23:59:07,007 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:59:07,007 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:59:07,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:59:07,008 INFO L158 Benchmark]: Toolchain (without parser) took 562116.59ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 118.0MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-12-05 23:59:07,009 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:59:07,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 100.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 23:59:07,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.75ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 97.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:59:07,010 INFO L158 Benchmark]: Boogie Preprocessor took 33.20ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:59:07,010 INFO L158 Benchmark]: RCFGBuilder took 1056.00ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 95.6MB in the end (delta: -405.7kB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-12-05 23:59:07,011 INFO L158 Benchmark]: CodeCheck took 560271.85ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 95.6MB in the beginning and 956.6MB in the end (delta: -861.0MB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-12-05 23:59:07,011 INFO L158 Benchmark]: Witness Printer took 414.21ms. Allocated memory is still 3.5GB. Free memory was 956.6MB in the beginning and 2.9GB in the end (delta: -2.0GB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-12-05 23:59:07,013 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 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 560.1s, OverallIterations: 80, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55342 SdHoareTripleChecker+Valid, 360.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52480 mSDsluCounter, 19817 SdHoareTripleChecker+Invalid, 323.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18296 mSDsCounter, 20422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176662 IncrementalHoareTripleChecker+Invalid, 197084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20422 mSolverCounterUnsat, 1521 mSDtfsCounter, 176662 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30636 GetRequests, 27441 SyntacticMatches, 1193 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463793 ImplicationChecksByTransitivity, 445.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 143.4s InterpolantComputationTime, 2492 NumberOfCodeBlocks, 2492 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 2365 ConstructedInterpolants, 0 QuantifiedInterpolants, 23271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 79 InterpolantComputations, 13 PerfectInterpolantSequences, 317/1597 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: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND FALSE !(\read(r131)) [L274] COND TRUE \read(r121) [L275] COND TRUE \read(ep23) [L276] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND FALSE !(\read(r211)) [L287] COND TRUE \read(r231) [L288] COND TRUE \read(ep31) [L289] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=0, id2=1, id3=127, m1=1, m2=0, m3=2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=2, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND FALSE !(\read(newmax2)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=3, id1=0, id2=1, id3=127, m1=127, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND FALSE !((int )max2 == (int )id2) [L156] nl2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=-1, m2=127, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=-1, m2=127, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=-1, m2=127, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L600] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=-1, m2=127, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 100.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.75ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 97.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.20ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1056.00ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 95.6MB in the end (delta: -405.7kB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * CodeCheck took 560271.85ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 95.6MB in the beginning and 956.6MB in the end (delta: -861.0MB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 414.21ms. Allocated memory is still 3.5GB. Free memory was 956.6MB in the beginning and 2.9GB in the end (delta: -2.0GB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-05 23:59:07,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087c3790-9fe6-4482-a136-6dc1da0cb781/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