./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_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_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/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_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/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_8aa28f26-30ad-481c-948e-16e15e3d2d92/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 f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:48:24,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:48:24,633 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:48:24,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:48:24,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:48:24,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:48:24,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:48:24,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:48:24,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:48:24,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:48:24,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:48:24,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:48:24,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:48:24,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:48:24,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:48:24,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:48:24,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:48:24,661 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:48:24,661 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:48:24,661 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:48:24,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:48:24,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:48:24,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:48:24,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:48:24,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:48:24,662 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:48:24,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:48:24,662 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_8aa28f26-30ad-481c-948e-16e15e3d2d92/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 -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2024-11-13 21:48:24,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:48:24,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:48:24,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:48:24,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:48:24,971 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:48:24,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 21:48:26,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:48:27,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:48:27,110 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-11-13 21:48:27,128 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/data/7b93d1c70/4e8527749c034b2e8a14d5ee84e81809/FLAG42f235fc6 [2024-11-13 21:48:27,149 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/data/7b93d1c70/4e8527749c034b2e8a14d5ee84e81809 [2024-11-13 21:48:27,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:48:27,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:48:27,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:48:27,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:48:27,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:48:27,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391300f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27, skipping insertion in model container [2024-11-13 21:48:27,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:48:27,484 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_8aa28f26-30ad-481c-948e-16e15e3d2d92/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-13 21:48:27,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:48:27,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:48:27,551 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_8aa28f26-30ad-481c-948e-16e15e3d2d92/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-13 21:48:27,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:48:27,569 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:48:27,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27 WrapperNode [2024-11-13 21:48:27,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:48:27,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:48:27,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:48:27,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:48:27,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,624 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 453 [2024-11-13 21:48:27,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:48:27,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:48:27,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:48:27,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:48:27,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:48:27,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:48:27,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:48:27,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:48:27,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:48:27" (1/1) ... [2024-11-13 21:48:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:48:27,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:48:27,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:48:27,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:48:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:48:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:48:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:48:27,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:48:27,878 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:48:27,880 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:48:28,629 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-13 21:48:28,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:48:29,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:48:29,537 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:48:29,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:48:29 BoogieIcfgContainer [2024-11-13 21:48:29,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:48:29,538 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:48:29,539 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:48:29,550 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:48:29,550 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:48:29" (1/1) ... [2024-11-13 21:48:29,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:48:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:48:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:48:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:48:29,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 21:48:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 21:48:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:48:32,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 21:48:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 21:48:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:48:34,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 21:48:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 21:48:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:48:35,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 21:48:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 21:48:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:48:37,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-13 21:48:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-13 21:48:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:48:40,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-13 21:48:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-13 21:48:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:48:43,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-13 21:48:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-13 21:48:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:48:43,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-13 21:48:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-13 21:48:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:48:44,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-13 21:48:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-13 21:48:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:48:47,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-13 21:48:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-13 21:48:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:48:48,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2024-11-13 21:48:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-13 21:48:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:48:55,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 83 states and 151 transitions. [2024-11-13 21:48:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 151 transitions. [2024-11-13 21:48:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:48:58,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 89 states and 169 transitions. [2024-11-13 21:49:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 169 transitions. [2024-11-13 21:49:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:49:02,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:02,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 97 states and 192 transitions. [2024-11-13 21:49:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 192 transitions. [2024-11-13 21:49:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:49:07,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:07,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 98 states and 196 transitions. [2024-11-13 21:49:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 196 transitions. [2024-11-13 21:49:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:49:09,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 105 states and 218 transitions. [2024-11-13 21:49:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 218 transitions. [2024-11-13 21:49:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:49:13,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 112 states and 240 transitions. [2024-11-13 21:49:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 240 transitions. [2024-11-13 21:49:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:49:18,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:18,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 114 states and 245 transitions. [2024-11-13 21:49:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 245 transitions. [2024-11-13 21:49:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:49:20,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 118 states and 259 transitions. [2024-11-13 21:49:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 259 transitions. [2024-11-13 21:49:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:49:23,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 119 states and 262 transitions. [2024-11-13 21:49:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 262 transitions. [2024-11-13 21:49:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:49:25,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 139 states and 297 transitions. [2024-11-13 21:49:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 297 transitions. [2024-11-13 21:49:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:49:35,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 144 states and 308 transitions. [2024-11-13 21:49:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 308 transitions. [2024-11-13 21:49:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:49:39,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 153 states and 326 transitions. [2024-11-13 21:49:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 326 transitions. [2024-11-13 21:49:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:49:47,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:47,855 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 21:49:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 153 states and 325 transitions. [2024-11-13 21:49:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 325 transitions. [2024-11-13 21:49:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:49:48,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:50:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 168 states and 382 transitions. [2024-11-13 21:50:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 382 transitions. [2024-11-13 21:50:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:50:01,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:50:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 179 states and 426 transitions. [2024-11-13 21:50:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 426 transitions. [2024-11-13 21:50:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:50:13,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:50:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 184 states and 438 transitions. [2024-11-13 21:50:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 438 transitions. [2024-11-13 21:50:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:50:20,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:22,591 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 21:50:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 193 states and 467 transitions. [2024-11-13 21:50:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 467 transitions. [2024-11-13 21:50:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:50:28,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:50:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 206 states and 494 transitions. [2024-11-13 21:50:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 494 transitions. [2024-11-13 21:50:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:50:44,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:50:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 207 states and 496 transitions. [2024-11-13 21:50:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 496 transitions. [2024-11-13 21:50:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:50:48,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:50:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 213 states and 525 transitions. [2024-11-13 21:50:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 525 transitions. [2024-11-13 21:50:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:50:57,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 222 states and 548 transitions. [2024-11-13 21:51:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 548 transitions. [2024-11-13 21:51:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:51:08,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 230 states and 568 transitions. [2024-11-13 21:51:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 568 transitions. [2024-11-13 21:51:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:51:15,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 235 states and 587 transitions. [2024-11-13 21:51:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 587 transitions. [2024-11-13 21:51:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:51:24,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 240 states and 599 transitions. [2024-11-13 21:51:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 599 transitions. [2024-11-13 21:51:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:51:30,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 246 states and 629 transitions. [2024-11-13 21:51:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 629 transitions. [2024-11-13 21:51:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:51:41,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 254 states and 646 transitions. [2024-11-13 21:51:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 646 transitions. [2024-11-13 21:51:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:51:50,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:51:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 256 states and 663 transitions. [2024-11-13 21:51:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 663 transitions. [2024-11-13 21:51:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:51:54,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 263 states and 678 transitions. [2024-11-13 21:52:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 678 transitions. [2024-11-13 21:52:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:52:03,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 268 states and 707 transitions. [2024-11-13 21:52:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 707 transitions. [2024-11-13 21:52:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:52:15,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 272 states and 715 transitions. [2024-11-13 21:52:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 715 transitions. [2024-11-13 21:52:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:52:26,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 275 states and 723 transitions. [2024-11-13 21:52:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 723 transitions. [2024-11-13 21:52:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:52:32,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 282 states and 748 transitions. [2024-11-13 21:52:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 748 transitions. [2024-11-13 21:52:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:52:42,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 284 states and 768 transitions. [2024-11-13 21:52:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 768 transitions. [2024-11-13 21:52:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:52:48,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:48,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 285 states and 781 transitions. [2024-11-13 21:52:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 781 transitions. [2024-11-13 21:52:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:52:52,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:52:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:52:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:52:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 289 states and 798 transitions. [2024-11-13 21:52:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 798 transitions. [2024-11-13 21:52:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:52:59,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:52:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:52:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 298 states and 821 transitions. [2024-11-13 21:53:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 821 transitions. [2024-11-13 21:53:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:53:12,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 302 states and 841 transitions. [2024-11-13 21:53:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 841 transitions. [2024-11-13 21:53:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:53:19,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 307 states and 853 transitions. [2024-11-13 21:53:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 853 transitions. [2024-11-13 21:53:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:53:28,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 308 states and 854 transitions. [2024-11-13 21:53:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 854 transitions. [2024-11-13 21:53:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:53:31,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:31,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 320 states and 891 transitions. [2024-11-13 21:53:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 891 transitions. [2024-11-13 21:53:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:53:48,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:53:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:53:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 329 states and 911 transitions. [2024-11-13 21:53:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 911 transitions. [2024-11-13 21:53:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:53:57,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:53:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:53:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:53:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 334 states and 929 transitions. [2024-11-13 21:54:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 929 transitions. [2024-11-13 21:54:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:54:06,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 346 states and 957 transitions. [2024-11-13 21:54:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 957 transitions. [2024-11-13 21:54:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:54:27,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:54:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:54:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 354 states and 981 transitions. [2024-11-13 21:54:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 981 transitions. [2024-11-13 21:54:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:54:51,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:54:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:54:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:54:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:55:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 363 states and 1002 transitions. [2024-11-13 21:55:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 1002 transitions. [2024-11-13 21:55:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:55:14,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:55:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:55:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:55:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 363 states and 1001 transitions. [2024-11-13 21:55:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 1001 transitions. [2024-11-13 21:55:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:55:16,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:55:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:55:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:55:17,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:55:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:55:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:55:19,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:55:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:55:20,797 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 58 iterations. [2024-11-13 21:55:20,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:55:20 ImpRootNode [2024-11-13 21:55:20,923 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:55:20,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:55:20,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:55:20,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:55:20,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:48:29" (3/4) ... [2024-11-13 21:55:20,926 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:55:21,083 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:55:21,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:55:21,084 INFO L158 Benchmark]: Toolchain (without parser) took 413931.40ms. Allocated memory was 117.4MB in the beginning and 922.7MB in the end (delta: 805.3MB). Free memory was 92.0MB in the beginning and 611.6MB in the end (delta: -519.6MB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. [2024-11-13 21:55:21,085 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:55:21,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.30ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:55:21,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.93ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:55:21,086 INFO L158 Benchmark]: Boogie Preprocessor took 36.47ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 69.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:55:21,086 INFO L158 Benchmark]: RCFGBuilder took 1875.51ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 50.5MB in the end (delta: 19.1MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-11-13 21:55:21,086 INFO L158 Benchmark]: CodeCheck took 411385.08ms. Allocated memory was 117.4MB in the beginning and 922.7MB in the end (delta: 805.3MB). Free memory was 50.5MB in the beginning and 627.6MB in the end (delta: -577.2MB). Peak memory consumption was 280.1MB. Max. memory is 16.1GB. [2024-11-13 21:55:21,087 INFO L158 Benchmark]: Witness Printer took 159.53ms. Allocated memory is still 922.7MB. Free memory was 627.6MB in the beginning and 611.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:55:21,088 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: 411.2s, OverallIterations: 58, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23129 SdHoareTripleChecker+Valid, 197.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21191 mSDsluCounter, 11701 SdHoareTripleChecker+Invalid, 178.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10770 mSDsCounter, 9403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72354 IncrementalHoareTripleChecker+Invalid, 81757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9403 mSolverCounterUnsat, 931 mSDtfsCounter, 72354 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19235 GetRequests, 17033 SyntacticMatches, 898 SemanticMatches, 1304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106186 ImplicationChecksByTransitivity, 311.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 112.0s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1638 ConstructedInterpolants, 0 QuantifiedInterpolants, 14577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 12 PerfectInterpolantSequences, 254/1085 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: 567]: 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] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND TRUE \read(ep23) [L259] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND TRUE \read(r231) [L271] COND TRUE \read(ep31) [L272] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND TRUE \read(r311) [L310] COND TRUE \read(ep12) [L311] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 1 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=127, m2=127, m3=-2, max1=48, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=48, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND FALSE !((int )r1 < 1) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=48, m3=49, max1=50, max2=49, max3=50, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=49, p31=0, p31_new=-1, p31_old=50, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=-1, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=-1, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=-1, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L567] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=48, id2=49, id3=50, m1=50, m2=-1, m3=49, max1=50, max2=49, max3=50, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.30ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.93ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.47ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 69.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1875.51ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 50.5MB in the end (delta: 19.1MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * CodeCheck took 411385.08ms. Allocated memory was 117.4MB in the beginning and 922.7MB in the end (delta: 805.3MB). Free memory was 50.5MB in the beginning and 627.6MB in the end (delta: -577.2MB). Peak memory consumption was 280.1MB. Max. memory is 16.1GB. * Witness Printer took 159.53ms. Allocated memory is still 922.7MB. Free memory was 627.6MB in the beginning and 611.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:55:21,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aa28f26-30ad-481c-948e-16e15e3d2d92/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