./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.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_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/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_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/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_6790e7fb-75db-4c67-8aaa-ef3763ffab28/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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:51:45,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:51:45,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 16:51:45,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:51:45,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 16:51:45,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:51:45,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:51:45,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 16:51:45,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:51:45,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:51:45,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:51:45,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:51:45,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:51:45,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:51:45,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:51:45,784 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 16:51:45,784 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 16:51:45,785 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 16:51:45,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:51:45,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:51:45,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:51:45,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:51:45,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:51:45,786 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 16:51:45,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:51:45,786 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_6790e7fb-75db-4c67-8aaa-ef3763ffab28/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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2024-11-13 16:51:46,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:51:46,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:51:46,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:51:46,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:51:46,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:51:46,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 16:51:48,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:51:48,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:51:48,986 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-11-13 16:51:49,000 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/data/ae80a300c/a83639b335fd4662927255b148804131/FLAG45faec962 [2024-11-13 16:51:49,032 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/data/ae80a300c/a83639b335fd4662927255b148804131 [2024-11-13 16:51:49,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:51:49,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:51:49,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:51:49,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:51:49,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:51:49,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f528f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49, skipping insertion in model container [2024-11-13 16:51:49,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:51:49,402 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_6790e7fb-75db-4c67-8aaa-ef3763ffab28/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-13 16:51:49,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:51:49,427 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:51:49,556 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_6790e7fb-75db-4c67-8aaa-ef3763ffab28/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-13 16:51:49,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:51:49,581 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:51:49,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49 WrapperNode [2024-11-13 16:51:49,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:51:49,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:51:49,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:51:49,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:51:49,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,696 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-13 16:51:49,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:51:49,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:51:49,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:51:49,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:51:49,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:51:49,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:51:49,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:51:49,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:51:49,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:49" (1/1) ... [2024-11-13 16:51:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:51:49,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 16:51:49,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 16:51:49,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 16:51:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:51:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:51:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:51:49,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:51:50,034 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:51:50,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:51:51,052 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-13 16:51:51,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:51:52,166 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:51:52,166 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:51:52,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:51:52 BoogieIcfgContainer [2024-11-13 16:51:52,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:51:52,168 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 16:51:52,169 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 16:51:52,183 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 16:51:52,183 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:51:52" (1/1) ... [2024-11-13 16:51:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:51:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 16:51:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 16:51:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 16:51:52,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:56,300 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 16:51:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 16:51:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 16:51:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 16:51:56,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:58,316 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 16:51:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 16:51:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 16:51:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 16:51:58,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:00,345 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 16:52:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 16:52:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 16:52:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 16:52:01,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:02,573 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 16:52:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 16:52:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 16:52:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 16:52:03,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:05,477 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 16:52:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-13 16:52:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-13 16:52:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:52:06,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:07,883 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 16:52:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-13 16:52:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-13 16:52:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:52:09,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:09,866 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 16:52:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-13 16:52:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-13 16:52:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 16:52:10,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:10,538 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 16:52:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-13 16:52:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-13 16:52:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 16:52:10,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:12,393 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 16:52:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-13 16:52:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-13 16:52:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 16:52:14,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:16,689 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 16:52:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 58 states and 100 transitions. [2024-11-13 16:52:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2024-11-13 16:52:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 16:52:17,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:21,156 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 16:52:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-11-13 16:52:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-11-13 16:52:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 16:52:26,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:28,234 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 16:52:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2024-11-13 16:52:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2024-11-13 16:52:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 16:52:32,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:33,764 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 16:52:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 89 states and 154 transitions. [2024-11-13 16:52:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 154 transitions. [2024-11-13 16:52:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 16:52:34,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:36,232 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 16:52:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 103 states and 190 transitions. [2024-11-13 16:52:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2024-11-13 16:52:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 16:52:41,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:43,294 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 16:52:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 105 states and 195 transitions. [2024-11-13 16:52:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 195 transitions. [2024-11-13 16:52:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 16:52:44,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:46,437 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 16:52:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 119 states and 221 transitions. [2024-11-13 16:52:51,276 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 221 transitions. [2024-11-13 16:52:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 16:52:51,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:52,858 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 16:52:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 122 states and 233 transitions. [2024-11-13 16:52:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 233 transitions. [2024-11-13 16:52:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 16:52:54,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:56,612 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 16:53:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 126 states and 254 transitions. [2024-11-13 16:53:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 254 transitions. [2024-11-13 16:53:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 16:53:01,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:02,521 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 16:53:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 127 states and 256 transitions. [2024-11-13 16:53:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 256 transitions. [2024-11-13 16:53:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 16:53:03,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:06,552 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 16:53:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 146 states and 289 transitions. [2024-11-13 16:53:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 289 transitions. [2024-11-13 16:53:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 16:53:14,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:15,978 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 16:53:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 151 states and 304 transitions. [2024-11-13 16:53:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 304 transitions. [2024-11-13 16:53:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 16:53:18,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:22,571 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 16:53:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 160 states and 326 transitions. [2024-11-13 16:53:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 326 transitions. [2024-11-13 16:53:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 16:53:28,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:53:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 161 states and 327 transitions. [2024-11-13 16:53:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 327 transitions. [2024-11-13 16:53:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 16:53:30,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:34,171 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 16:53:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 175 states and 378 transitions. [2024-11-13 16:53:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 378 transitions. [2024-11-13 16:53:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 16:53:44,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:48,996 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 16:54:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 189 states and 425 transitions. [2024-11-13 16:54:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 425 transitions. [2024-11-13 16:54:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 16:54:00,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:03,076 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 16:54:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 200 states and 449 transitions. [2024-11-13 16:54:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 449 transitions. [2024-11-13 16:54:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 16:54:11,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 16:54:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 208 states and 463 transitions. [2024-11-13 16:54:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 463 transitions. [2024-11-13 16:54:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 16:54:20,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:21,686 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 16:54:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 209 states and 466 transitions. [2024-11-13 16:54:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 466 transitions. [2024-11-13 16:54:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 16:54:22,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:25,093 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 16:54:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 210 states and 471 transitions. [2024-11-13 16:54:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 471 transitions. [2024-11-13 16:54:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 16:54:27,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:27,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 218 states and 484 transitions. [2024-11-13 16:54:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 484 transitions. [2024-11-13 16:54:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:54:38,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:40,970 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 16:54:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 228 states and 506 transitions. [2024-11-13 16:54:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 506 transitions. [2024-11-13 16:54:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:54:51,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:52,807 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 16:54:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 235 states and 524 transitions. [2024-11-13 16:54:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 524 transitions. [2024-11-13 16:54:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:54:59,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 236 states and 536 transitions. [2024-11-13 16:55:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 536 transitions. [2024-11-13 16:55:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:55:04,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:05,765 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 16:55:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 238 states and 542 transitions. [2024-11-13 16:55:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 542 transitions. [2024-11-13 16:55:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:55:07,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:09,099 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 16:55:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 240 states and 550 transitions. [2024-11-13 16:55:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 550 transitions. [2024-11-13 16:55:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:55:11,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:13,299 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 16:55:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 241 states and 553 transitions. [2024-11-13 16:55:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 553 transitions. [2024-11-13 16:55:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:55:14,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:14,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 250 states and 568 transitions. [2024-11-13 16:55:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 568 transitions. [2024-11-13 16:55:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:55:27,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 259 states and 593 transitions. [2024-11-13 16:55:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 593 transitions. [2024-11-13 16:55:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:55:36,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:42,090 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 16:55:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 270 states and 606 transitions. [2024-11-13 16:55:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 606 transitions. [2024-11-13 16:55:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:55:54,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:02,368 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 16:56:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 278 states and 619 transitions. [2024-11-13 16:56:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 619 transitions. [2024-11-13 16:56:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:56:13,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 280 states and 628 transitions. [2024-11-13 16:56:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 628 transitions. [2024-11-13 16:56:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:56:17,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 281 states and 635 transitions. [2024-11-13 16:56:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 635 transitions. [2024-11-13 16:56:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:56:20,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 282 states and 636 transitions. [2024-11-13 16:56:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 636 transitions. [2024-11-13 16:56:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 16:56:23,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 284 states and 642 transitions. [2024-11-13 16:56:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 642 transitions. [2024-11-13 16:56:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 16:56:27,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:31,758 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 16:56:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 291 states and 659 transitions. [2024-11-13 16:56:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 659 transitions. [2024-11-13 16:56:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 16:56:43,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:49,302 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 16:56:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 293 states and 661 transitions. [2024-11-13 16:56:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 661 transitions. [2024-11-13 16:56:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 16:56:56,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:01,533 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 16:57:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 295 states and 676 transitions. [2024-11-13 16:57:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 676 transitions. [2024-11-13 16:57:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 16:57:07,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:09,812 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 16:57:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 297 states and 684 transitions. [2024-11-13 16:57:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 684 transitions. [2024-11-13 16:57:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 16:57:14,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:16,710 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 16:57:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 302 states and 703 transitions. [2024-11-13 16:57:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 703 transitions. [2024-11-13 16:57:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 16:57:23,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:28,921 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 16:57:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 304 states and 707 transitions. [2024-11-13 16:57:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 707 transitions. [2024-11-13 16:57:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 16:57:35,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:39,562 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 16:57:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 314 states and 738 transitions. [2024-11-13 16:57:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 738 transitions. [2024-11-13 16:57:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 16:57:54,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:59,912 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 16:58:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 315 states and 740 transitions. [2024-11-13 16:58:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 740 transitions. [2024-11-13 16:58:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 16:58:04,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:10,075 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 16:58:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 316 states and 741 transitions. [2024-11-13 16:58:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 741 transitions. [2024-11-13 16:58:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 16:58:11,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:12,820 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 16:58:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 316 states and 740 transitions. [2024-11-13 16:58:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 740 transitions. [2024-11-13 16:58:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 16:58:14,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:58:15,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:58:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:58:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:58:17,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:58:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:58:18,575 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 55 iterations. [2024-11-13 16:58:18,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 04:58:18 ImpRootNode [2024-11-13 16:58:18,762 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 16:58:18,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:58:18,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:58:18,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:58:18,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:51:52" (3/4) ... [2024-11-13 16:58:18,765 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 16:58:18,974 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 16:58:18,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:58:18,976 INFO L158 Benchmark]: Toolchain (without parser) took 389938.61ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 118.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 384.6MB. Max. memory is 16.1GB. [2024-11-13 16:58:18,977 INFO L158 Benchmark]: CDTParser took 1.83ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:58:18,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.66ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:58:18,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.66ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 97.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:58:18,979 INFO L158 Benchmark]: Boogie Preprocessor took 61.54ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:58:18,980 INFO L158 Benchmark]: RCFGBuilder took 2407.34ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.1MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-11-13 16:58:18,980 INFO L158 Benchmark]: CodeCheck took 386594.15ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 93.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 347.2MB. Max. memory is 16.1GB. [2024-11-13 16:58:18,982 INFO L158 Benchmark]: Witness Printer took 211.87ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:58:18,984 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: 386.4s, OverallIterations: 55, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22714 SdHoareTripleChecker+Valid, 216.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20830 mSDsluCounter, 7383 SdHoareTripleChecker+Invalid, 197.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6503 mSDsCounter, 8331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64572 IncrementalHoareTripleChecker+Invalid, 72903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8331 mSolverCounterUnsat, 880 mSDtfsCounter, 64572 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15621 GetRequests, 13658 SyntacticMatches, 775 SemanticMatches, 1188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925110 ImplicationChecksByTransitivity, 270.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 135.0s InterpolantComputationTime, 1626 NumberOfCodeBlocks, 1626 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1524 ConstructedInterpolants, 0 QuantifiedInterpolants, 13961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 12 PerfectInterpolantSequences, 232/993 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 TRUE \read(r131) [L282] 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 FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, 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 < 1 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [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 FALSE !(\read(ep32)) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=127, m3=1, max1=0, 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=0, p13=0, p13_new=-1, p13_old=0, 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=-1, r1=0, 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 FALSE !(\read(ep32)) [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 TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [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 FALSE !((int )r1 < 1) [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 FALSE !(\read(newmax2)) [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 FALSE !(\read(ep32)) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-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 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] nl1 = (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 FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (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 TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L609] reach_error() VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.83ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.66ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.66ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 97.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.54ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2407.34ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.1MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * CodeCheck took 386594.15ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 93.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 347.2MB. Max. memory is 16.1GB. * Witness Printer took 211.87ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB 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 16:58:19,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6790e7fb-75db-4c67-8aaa-ef3763ffab28/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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