./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm --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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:51:05,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:51:06,031 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:51:06,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:51:06,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:51:06,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:51:06,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:51:06,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:51:06,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:51:06,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:51:06,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:51:06,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:51:06,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:51:06,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:51:06,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:51:06,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:51:06,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:51:06,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:51:06,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:51:06,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:51:06,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:51:06,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:51:06,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:51:06,077 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:51:06,077 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:51:06,077 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:51:06,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:51:06,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:51:06,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:51:06,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:51:06,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:51:06,078 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:51:06,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:51:06,078 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_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2024-11-13 21:51:06,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:51:06,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:51:06,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:51:06,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:51:06,373 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:51:06,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-13 21:51:08,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:51:08,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:51:08,555 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-13 21:51:08,566 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/data/4896fd0db/fb6ddd7bc3264c12b4f0ba082f7dbe1a/FLAGde1c7a359 [2024-11-13 21:51:08,581 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/data/4896fd0db/fb6ddd7bc3264c12b4f0ba082f7dbe1a [2024-11-13 21:51:08,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:51:08,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:51:08,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:51:08,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:51:08,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:51:08,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:08,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649dbea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08, skipping insertion in model container [2024-11-13 21:51:08,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:08,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:51:08,894 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_a079f97b-1c75-459d-91f4-9e3d994a065c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-13 21:51:08,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:51:08,909 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:51:08,963 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_a079f97b-1c75-459d-91f4-9e3d994a065c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-13 21:51:08,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:51:08,983 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:51:08,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08 WrapperNode [2024-11-13 21:51:08,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:51:08,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:51:08,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:51:08,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:51:08,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,033 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-13 21:51:09,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:51:09,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:51:09,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:51:09,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:51:09,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:51:09,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:51:09,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:51:09,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:51:09,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:51:08" (1/1) ... [2024-11-13 21:51:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:51:09,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:51:09,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:51:09,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:51:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:51:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:51:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:51:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:51:09,271 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:51:09,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:51:10,021 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-13 21:51:10,021 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:51:10,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:51:10,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:51:10,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:51:10 BoogieIcfgContainer [2024-11-13 21:51:10,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:51:10,801 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:51:10,801 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:51:10,816 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:51:10,816 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:51:10" (1/1) ... [2024-11-13 21:51:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:51:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:51:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:51:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:51:10,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-11-13 21:51:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-11-13 21:51:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:51:13,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:13,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-11-13 21:51:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-11-13 21:51:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:51:15,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-11-13 21:51:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-11-13 21:51:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:51:17,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-11-13 21:51:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-11-13 21:51:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:51:19,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-11-13 21:51:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-11-13 21:51:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:51:21,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-11-13 21:51:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-11-13 21:51:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:51:23,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-11-13 21:51:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-11-13 21:51:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:51:23,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-13 21:51:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-13 21:51:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:51:26,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 66 states and 120 transitions. [2024-11-13 21:51:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 120 transitions. [2024-11-13 21:51:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:51:29,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 69 states and 126 transitions. [2024-11-13 21:51:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 126 transitions. [2024-11-13 21:51:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:51:30,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:30,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-13 21:51:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-13 21:51:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:51:37,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 99 states and 186 transitions. [2024-11-13 21:51:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 186 transitions. [2024-11-13 21:51:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:51:43,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 105 states and 201 transitions. [2024-11-13 21:51:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 201 transitions. [2024-11-13 21:51:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:51:46,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 123 states and 242 transitions. [2024-11-13 21:51:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 242 transitions. [2024-11-13 21:51:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:51:54,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 124 states and 246 transitions. [2024-11-13 21:51:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 246 transitions. [2024-11-13 21:51:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:51:55,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 125 states and 250 transitions. [2024-11-13 21:51:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 250 transitions. [2024-11-13 21:51:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:51:57,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 139 states and 280 transitions. [2024-11-13 21:52:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 280 transitions. [2024-11-13 21:52:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:52:04,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 140 states and 284 transitions. [2024-11-13 21:52:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 284 transitions. [2024-11-13 21:52:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:52:05,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 142 states and 291 transitions. [2024-11-13 21:52:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 291 transitions. [2024-11-13 21:52:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:52:07,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 161 states and 331 transitions. [2024-11-13 21:52:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 331 transitions. [2024-11-13 21:52:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:52:16,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 166 states and 342 transitions. [2024-11-13 21:52:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 342 transitions. [2024-11-13 21:52:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:52:21,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 168 states and 347 transitions. [2024-11-13 21:52:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 347 transitions. [2024-11-13 21:52:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:52:24,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 169 states and 348 transitions. [2024-11-13 21:52:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 348 transitions. [2024-11-13 21:52:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:52:26,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 178 states and 366 transitions. [2024-11-13 21:52:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 366 transitions. [2024-11-13 21:52:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:52:32,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 183 states and 378 transitions. [2024-11-13 21:52:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 378 transitions. [2024-11-13 21:52:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:52:35,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:52:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 184 states and 379 transitions. [2024-11-13 21:52:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 379 transitions. [2024-11-13 21:52:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:52:35,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:35,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 194 states and 396 transitions. [2024-11-13 21:52:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 396 transitions. [2024-11-13 21:52:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:52:44,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 202 states and 413 transitions. [2024-11-13 21:52:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 413 transitions. [2024-11-13 21:52:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:52:51,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 216 states and 465 transitions. [2024-11-13 21:53:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 465 transitions. [2024-11-13 21:53:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:53:02,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 230 states and 523 transitions. [2024-11-13 21:53:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 523 transitions. [2024-11-13 21:53:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:53:15,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 241 states and 541 transitions. [2024-11-13 21:53:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 541 transitions. [2024-11-13 21:53:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:53:25,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 252 states and 563 transitions. [2024-11-13 21:53:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 563 transitions. [2024-11-13 21:53:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:53:37,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 266 states and 595 transitions. [2024-11-13 21:53:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 595 transitions. [2024-11-13 21:53:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:53:44,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 272 states and 613 transitions. [2024-11-13 21:53:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 613 transitions. [2024-11-13 21:53:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:53:50,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:50,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 280 states and 634 transitions. [2024-11-13 21:54:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 634 transitions. [2024-11-13 21:54:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:54:01,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 294 states and 666 transitions. [2024-11-13 21:54:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 666 transitions. [2024-11-13 21:54:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:54:12,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 299 states and 680 transitions. [2024-11-13 21:54:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 680 transitions. [2024-11-13 21:54:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:54:19,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 300 states and 687 transitions. [2024-11-13 21:54:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 687 transitions. [2024-11-13 21:54:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:54:21,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 314 states and 717 transitions. [2024-11-13 21:54:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 717 transitions. [2024-11-13 21:54:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:54:37,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 328 states and 750 transitions. [2024-11-13 21:54:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 750 transitions. [2024-11-13 21:54:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:54:54,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 331 states and 764 transitions. [2024-11-13 21:55:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 764 transitions. [2024-11-13 21:55:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:55:00,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 337 states and 781 transitions. [2024-11-13 21:55:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 781 transitions. [2024-11-13 21:55:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:55:07,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 352 states and 817 transitions. [2024-11-13 21:55:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 817 transitions. [2024-11-13 21:55:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:55:30,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 358 states and 834 transitions. [2024-11-13 21:55:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 834 transitions. [2024-11-13 21:55:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:55:38,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 363 states and 843 transitions. [2024-11-13 21:55:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 843 transitions. [2024-11-13 21:55:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:55:48,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 371 states and 869 transitions. [2024-11-13 21:56:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 869 transitions. [2024-11-13 21:56:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:56:00,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 377 states and 881 transitions. [2024-11-13 21:56:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 881 transitions. [2024-11-13 21:56:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:56:12,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 378 states and 886 transitions. [2024-11-13 21:56:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 886 transitions. [2024-11-13 21:56:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:56:15,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 393 states and 934 transitions. [2024-11-13 21:56:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 934 transitions. [2024-11-13 21:56:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:56:36,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 394 states and 938 transitions. [2024-11-13 21:56:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 938 transitions. [2024-11-13 21:56:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:56:39,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 396 states and 951 transitions. [2024-11-13 21:56:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 951 transitions. [2024-11-13 21:56:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:56:43,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 399 states and 964 transitions. [2024-11-13 21:56:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 964 transitions. [2024-11-13 21:56:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:56:49,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:56:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:56:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 406 states and 987 transitions. [2024-11-13 21:56:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 987 transitions. [2024-11-13 21:56:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:56:58,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:56:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:56:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:56:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 409 states and 1001 transitions. [2024-11-13 21:57:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1001 transitions. [2024-11-13 21:57:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:57:02,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 414 states and 1021 transitions. [2024-11-13 21:57:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1021 transitions. [2024-11-13 21:57:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:57:08,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 415 states and 1025 transitions. [2024-11-13 21:57:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1025 transitions. [2024-11-13 21:57:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:57:12,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 416 states and 1036 transitions. [2024-11-13 21:57:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1036 transitions. [2024-11-13 21:57:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:57:15,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 417 states and 1040 transitions. [2024-11-13 21:57:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1040 transitions. [2024-11-13 21:57:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:57:17,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 442 states and 1079 transitions. [2024-11-13 21:57:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1079 transitions. [2024-11-13 21:57:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:57:40,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:57:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:57:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 451 states and 1107 transitions. [2024-11-13 21:57:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1107 transitions. [2024-11-13 21:57:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:57:55,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:57:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:57:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:57:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:58:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 453 states and 1110 transitions. [2024-11-13 21:58:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1110 transitions. [2024-11-13 21:58:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:58:04,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:58:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 456 states and 1114 transitions. [2024-11-13 21:58:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1114 transitions. [2024-11-13 21:58:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:58:11,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:58:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 460 states and 1129 transitions. [2024-11-13 21:58:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1129 transitions. [2024-11-13 21:58:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:58:25,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:58:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 465 states and 1150 transitions. [2024-11-13 21:58:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1150 transitions. [2024-11-13 21:58:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:58:39,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:58:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 466 states and 1152 transitions. [2024-11-13 21:58:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1152 transitions. [2024-11-13 21:58:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:58:43,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:58:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:58:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:58:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 472 states and 1177 transitions. [2024-11-13 21:58:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1177 transitions. [2024-11-13 21:58:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:58:59,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:58:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:58:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:59:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:59:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:59:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 473 states and 1182 transitions. [2024-11-13 21:59:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1182 transitions. [2024-11-13 21:59:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:59:03,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:59:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:59:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:59:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:59:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:59:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 478 states and 1189 transitions. [2024-11-13 21:59:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1189 transitions. [2024-11-13 21:59:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:59:11,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:59:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:59:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:59:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:59:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:59:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 481 states and 1203 transitions. [2024-11-13 21:59:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1203 transitions. [2024-11-13 21:59:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:59:16,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:59:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:59:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:59:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:59:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:59:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 481 states and 1202 transitions. [2024-11-13 21:59:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1202 transitions. [2024-11-13 21:59:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:59:18,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:59:18,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:59:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:59:19,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:59:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:59:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:59:20,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:59:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:59:21,358 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 71 iterations. [2024-11-13 21:59:21,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:59:21 ImpRootNode [2024-11-13 21:59:21,549 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:59:21,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:59:21,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:59:21,550 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:59:21,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:51:10" (3/4) ... [2024-11-13 21:59:21,553 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:59:21,853 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:59:21,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:59:21,855 INFO L158 Benchmark]: Toolchain (without parser) took 493269.57ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 93.0MB in the beginning and 500.1MB in the end (delta: -407.1MB). Peak memory consumption was 846.8MB. Max. memory is 16.1GB. [2024-11-13 21:59:21,855 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:59:21,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.93ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:59:21,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 73.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:59:21,856 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:59:21,860 INFO L158 Benchmark]: RCFGBuilder took 1731.58ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 72.4MB in the end (delta: -1.1MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-13 21:59:21,861 INFO L158 Benchmark]: CodeCheck took 490747.57ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 72.4MB in the beginning and 516.9MB in the end (delta: -444.5MB). Peak memory consumption was 810.8MB. Max. memory is 16.1GB. [2024-11-13 21:59:21,861 INFO L158 Benchmark]: Witness Printer took 303.72ms. Allocated memory is still 1.4GB. Free memory was 516.9MB in the beginning and 500.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:59:21,863 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: 490.5s, OverallIterations: 71, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42074 SdHoareTripleChecker+Valid, 278.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39744 mSDsluCounter, 16882 SdHoareTripleChecker+Invalid, 250.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15730 mSDsCounter, 14237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123453 IncrementalHoareTripleChecker+Invalid, 137690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14237 mSolverCounterUnsat, 1152 mSDtfsCounter, 123453 mSolverCounterSat, 2.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25954 GetRequests, 23240 SyntacticMatches, 1020 SemanticMatches, 1694 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745671 ImplicationChecksByTransitivity, 377.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 127.7s InterpolantComputationTime, 2222 NumberOfCodeBlocks, 2222 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2104 ConstructedInterpolants, 0 QuantifiedInterpolants, 18893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 12 PerfectInterpolantSequences, 295/1461 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 - CounterExampleResult [Line: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND TRUE \read(ep32) [L233] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND TRUE \read(r211) [L271] COND TRUE \read(ep13) [L272] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND TRUE \read(ep21) [L285] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, i2=0, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, i2=1, id1=1, id2=126, id3=3, m1=127, m2=0, m3=2, max1=1, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, i2=2, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=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] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, i2=3, id1=1, id2=126, id3=3, m1=126, m2=3, m3=1, max1=126, max2=126, max3=3, mode1=1, mode2=1, mode3=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=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=-1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=-1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=-1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L555] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=126, id3=3, m1=126, m2=3, m3=-1, max1=126, max2=126, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.93ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 73.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1731.58ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 72.4MB in the end (delta: -1.1MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * CodeCheck took 490747.57ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 72.4MB in the beginning and 516.9MB in the end (delta: -444.5MB). Peak memory consumption was 810.8MB. Max. memory is 16.1GB. * Witness Printer took 303.72ms. Allocated memory is still 1.4GB. Free memory was 516.9MB in the beginning and 500.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:59:21,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a079f97b-1c75-459d-91f4-9e3d994a065c/bin/ukojak-verify-EEHR8qb7sm/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