./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.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_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:22:29,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:22:29,978 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:22:29,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:22:29,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:22:30,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:22:30,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:22:30,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:22:30,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:22:30,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:22:30,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:22:30,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:22:30,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:22:30,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:22:30,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:22:30,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:22:30,029 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:22:30,029 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:22:30,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:22:30,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:22:30,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:22:30,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:22:30,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:22:30,030 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:22:30,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:22:30,030 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_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2024-11-13 21:22:30,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:22:30,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:22:30,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:22:30,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:22:30,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:22:30,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 21:22:32,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:22:32,639 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:22:32,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-13 21:22:32,651 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/data/b47b71143/47fa5bf4ebcd4224a9632ba954540f71/FLAG3ad4d2d8a [2024-11-13 21:22:32,666 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/data/b47b71143/47fa5bf4ebcd4224a9632ba954540f71 [2024-11-13 21:22:32,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:22:32,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:22:32,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:22:32,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:22:32,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:22:32,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:22:32" (1/1) ... [2024-11-13 21:22:32,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5977e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:32, skipping insertion in model container [2024-11-13 21:22:32,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:22:32" (1/1) ... [2024-11-13 21:22:32,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:22:32,993 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_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-13 21:22:32,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:22:33,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:22:33,065 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_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-13 21:22:33,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:22:33,081 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:22:33,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33 WrapperNode [2024-11-13 21:22:33,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:22:33,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:22:33,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:22:33,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:22:33,090 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:22:33" (1/1) ... [2024-11-13 21:22:33,099 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:22:33" (1/1) ... [2024-11-13 21:22:33,137 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-13 21:22:33,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:22:33,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:22:33,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:22:33,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:22:33,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:22:33,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:22:33,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:22:33,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:22:33,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:33" (1/1) ... [2024-11-13 21:22:33,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:22:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:22:33,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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:22:33,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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:22:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:22:33,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:22:33,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:22:33,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:22:33,401 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:22:33,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:22:34,270 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-13 21:22:34,271 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:22:35,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:22:35,237 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:22:35,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:22:35 BoogieIcfgContainer [2024-11-13 21:22:35,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:22:35,238 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:22:35,239 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:22:35,250 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:22:35,251 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:22:35" (1/1) ... [2024-11-13 21:22:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:22:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:22:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:22:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:22:35,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:38,612 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:22:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 21:22:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 21:22:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:22:38,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:40,291 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:22:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 21:22:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 21:22:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:22:40,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:41,846 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:22:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 21:22:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 21:22:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:22:42,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:43,633 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:22:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 21:22:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 21:22:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:22:44,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:45,767 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:22:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-13 21:22:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-13 21:22:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:22:46,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:47,562 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:22:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-13 21:22:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-13 21:22:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:22:49,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:49,355 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:22:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-13 21:22:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-13 21:22:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:49,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:49,911 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:22:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-13 21:22:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-13 21:22:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:50,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:51,377 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:22:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-13 21:22:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-13 21:22:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:22:53,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:53,856 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:22:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 58 states and 101 transitions. [2024-11-13 21:22:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2024-11-13 21:22:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:22:54,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:57,603 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:23:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-11-13 21:23:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-11-13 21:23:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:23:01,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:03,215 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:23:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 88 states and 153 transitions. [2024-11-13 21:23:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2024-11-13 21:23:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:23:05,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:07,222 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:23:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 89 states and 156 transitions. [2024-11-13 21:23:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 156 transitions. [2024-11-13 21:23:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:23:07,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:09,313 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:23:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 97 states and 187 transitions. [2024-11-13 21:23:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 187 transitions. [2024-11-13 21:23:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:23:12,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:13,789 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:23:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 99 states and 192 transitions. [2024-11-13 21:23:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 192 transitions. [2024-11-13 21:23:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:23:14,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:16,245 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:23:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 113 states and 219 transitions. [2024-11-13 21:23:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 219 transitions. [2024-11-13 21:23:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:23:19,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:21,077 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:23:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 116 states and 230 transitions. [2024-11-13 21:23:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2024-11-13 21:23:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:23:22,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:24,936 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:23:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 122 states and 256 transitions. [2024-11-13 21:23:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 256 transitions. [2024-11-13 21:23:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:23:29,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:31,562 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:23:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 141 states and 287 transitions. [2024-11-13 21:23:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 287 transitions. [2024-11-13 21:23:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:23:36,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:37,922 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:23:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 146 states and 302 transitions. [2024-11-13 21:23:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 302 transitions. [2024-11-13 21:23:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:23:40,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:43,145 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:23:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 151 states and 311 transitions. [2024-11-13 21:23:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 311 transitions. [2024-11-13 21:23:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:23:46,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:49,092 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:23:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 165 states and 353 transitions. [2024-11-13 21:23:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 353 transitions. [2024-11-13 21:23:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:23:56,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:58,450 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:24:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 179 states and 384 transitions. [2024-11-13 21:24:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 384 transitions. [2024-11-13 21:24:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:24:05,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:06,818 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:24:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 190 states and 406 transitions. [2024-11-13 21:24:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 406 transitions. [2024-11-13 21:24:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:24:14,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:15,408 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:24:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 192 states and 413 transitions. [2024-11-13 21:24:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 413 transitions. [2024-11-13 21:24:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:24:16,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:19,091 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:24:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 198 states and 427 transitions. [2024-11-13 21:24:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 427 transitions. [2024-11-13 21:24:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:24:24,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:26,914 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:24:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 201 states and 437 transitions. [2024-11-13 21:24:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 437 transitions. [2024-11-13 21:24:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:24:29,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:34,589 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:24:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 205 states and 445 transitions. [2024-11-13 21:24:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 445 transitions. [2024-11-13 21:24:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:24:41,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:45,415 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:24:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 208 states and 456 transitions. [2024-11-13 21:24:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 456 transitions. [2024-11-13 21:24:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:24:50,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:54,306 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:25:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 215 states and 477 transitions. [2024-11-13 21:25:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 477 transitions. [2024-11-13 21:25:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:03,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:06,028 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:25:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 218 states and 484 transitions. [2024-11-13 21:25:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 484 transitions. [2024-11-13 21:25:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:09,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:11,750 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:25:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 219 states and 487 transitions. [2024-11-13 21:25:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 487 transitions. [2024-11-13 21:25:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:12,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:15,490 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:25:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 220 states and 491 transitions. [2024-11-13 21:25:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 491 transitions. [2024-11-13 21:25:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:17,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:18,856 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:25:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 224 states and 511 transitions. [2024-11-13 21:25:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 511 transitions. [2024-11-13 21:25:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:22,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:24,638 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:25:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 225 states and 521 transitions. [2024-11-13 21:25:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 521 transitions. [2024-11-13 21:25:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:26,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:26,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:27,669 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:25:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 226 states and 530 transitions. [2024-11-13 21:25:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 530 transitions. [2024-11-13 21:25:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:28,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:31,178 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:25:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 228 states and 535 transitions. [2024-11-13 21:25:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 535 transitions. [2024-11-13 21:25:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:25:33,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:38,551 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:25:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 240 states and 557 transitions. [2024-11-13 21:25:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 557 transitions. [2024-11-13 21:25:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:25:48,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:51,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:26:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 247 states and 581 transitions. [2024-11-13 21:26:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 581 transitions. [2024-11-13 21:26:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:26:00,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:00,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:01,570 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:26:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 249 states and 586 transitions. [2024-11-13 21:26:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 586 transitions. [2024-11-13 21:26:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:26:04,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:05,996 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:26:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 250 states and 589 transitions. [2024-11-13 21:26:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 589 transitions. [2024-11-13 21:26:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:26:07,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 262 states and 628 transitions. [2024-11-13 21:26:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 628 transitions. [2024-11-13 21:26:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:26:21,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:22,647 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:26:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 263 states and 629 transitions. [2024-11-13 21:26:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 629 transitions. [2024-11-13 21:26:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:26:24,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:24,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:28,778 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:26:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 273 states and 656 transitions. [2024-11-13 21:26:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 656 transitions. [2024-11-13 21:26:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:26:42,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:44,982 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:26:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 278 states and 670 transitions. [2024-11-13 21:26:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 670 transitions. [2024-11-13 21:26:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:26:51,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:53,917 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:26:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 282 states and 684 transitions. [2024-11-13 21:26:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 684 transitions. [2024-11-13 21:26:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:26:59,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:05,576 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:27:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 284 states and 691 transitions. [2024-11-13 21:27:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 691 transitions. [2024-11-13 21:27:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:27:10,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:14,983 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:27:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 285 states and 691 transitions. [2024-11-13 21:27:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 691 transitions. [2024-11-13 21:27:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:27:17,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:21,867 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:27:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 292 states and 708 transitions. [2024-11-13 21:27:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 708 transitions. [2024-11-13 21:27:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:27:31,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:35,362 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:27:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 293 states and 708 transitions. [2024-11-13 21:27:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 708 transitions. [2024-11-13 21:27:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:27:38,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:39,275 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:27:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 293 states and 707 transitions. [2024-11-13 21:27:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 707 transitions. [2024-11-13 21:27:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:27:40,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:27:41,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:27:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:27:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:27:43,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:27:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:27:43,865 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 52 iterations. [2024-11-13 21:27:44,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:27:44 ImpRootNode [2024-11-13 21:27:44,023 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:27:44,024 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:27:44,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:27:44,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:27:44,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:22:35" (3/4) ... [2024-11-13 21:27:44,029 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:27:44,215 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:27:44,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:27:44,217 INFO L158 Benchmark]: Toolchain (without parser) took 311546.76ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 93.7MB in the beginning and 651.6MB in the end (delta: -557.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-13 21:27:44,217 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:27:44,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.59ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 76.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:27:44,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.44ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 73.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:27:44,219 INFO L158 Benchmark]: Boogie Preprocessor took 51.34ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 70.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:27:44,219 INFO L158 Benchmark]: RCFGBuilder took 2047.92ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 70.6MB in the beginning and 253.8MB in the end (delta: -183.2MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-13 21:27:44,219 INFO L158 Benchmark]: CodeCheck took 308784.58ms. Allocated memory was 352.3MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 253.8MB in the beginning and 668.4MB in the end (delta: -414.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-13 21:27:44,220 INFO L158 Benchmark]: Witness Printer took 192.43ms. Allocated memory is still 2.0GB. Free memory was 668.4MB in the beginning and 651.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:27:44,222 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: 308.6s, OverallIterations: 52, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20970 SdHoareTripleChecker+Valid, 145.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19197 mSDsluCounter, 6429 SdHoareTripleChecker+Invalid, 131.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5600 mSDsCounter, 6159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57314 IncrementalHoareTripleChecker+Invalid, 63473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6159 mSolverCounterUnsat, 829 mSDtfsCounter, 57314 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15865 GetRequests, 13829 SyntacticMatches, 934 SemanticMatches, 1102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813770 ImplicationChecksByTransitivity, 211.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 109.5s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 15303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 209/1041 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: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=0, m2=0, m3=127, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND TRUE (int )m1 > (int )max1 [L100] max1 = m1 [L101] newmax = (_Bool)1 [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L609] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=2, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.59ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 76.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.44ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 73.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.34ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 70.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2047.92ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 70.6MB in the beginning and 253.8MB in the end (delta: -183.2MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * CodeCheck took 308784.58ms. Allocated memory was 352.3MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 253.8MB in the beginning and 668.4MB in the end (delta: -414.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 192.43ms. Allocated memory is still 2.0GB. Free memory was 668.4MB in the beginning and 651.6MB 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:27:44,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a98fd6-4c60-4dcf-b5fe-766f6426c1d9/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