./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 06:21:39,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 06:21:39,130 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 06:21:39,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 06:21:39,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 06:21:39,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 06:21:39,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 06:21:39,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 06:21:39,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 06:21:39,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 06:21:39,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 06:21:39,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 06:21:39,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 06:21:39,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 06:21:39,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 06:21:39,157 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 06:21:39,157 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 06:21:39,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 06:21:39,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:21:39,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 06:21:39,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 06:21:39,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 06:21:39,158 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 06:21:39,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 06:21:39,158 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_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2024-12-06 06:21:39,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 06:21:39,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 06:21:39,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 06:21:39,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 06:21:39,416 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 06:21:39,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-12-06 06:21:42,116 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/data/87b54d89e/7cc4fc84bc15443fafdcb9dbc4668d08/FLAGb192b51df [2024-12-06 06:21:42,324 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 06:21:42,324 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-12-06 06:21:42,333 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/data/87b54d89e/7cc4fc84bc15443fafdcb9dbc4668d08/FLAGb192b51df [2024-12-06 06:21:42,347 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/data/87b54d89e/7cc4fc84bc15443fafdcb9dbc4668d08 [2024-12-06 06:21:42,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 06:21:42,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 06:21:42,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 06:21:42,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 06:21:42,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 06:21:42,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6031e901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42, skipping insertion in model container [2024-12-06 06:21:42,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 06:21:42,571 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_10d748ae-0161-4cb9-85fd-63ecc963c4f1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2024-12-06 06:21:42,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:21:42,583 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 06:21:42,629 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_10d748ae-0161-4cb9-85fd-63ecc963c4f1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2024-12-06 06:21:42,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:21:42,644 INFO L204 MainTranslator]: Completed translation [2024-12-06 06:21:42,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42 WrapperNode [2024-12-06 06:21:42,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 06:21:42,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 06:21:42,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 06:21:42,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 06:21:42,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,685 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-12-06 06:21:42,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 06:21:42,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 06:21:42,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 06:21:42,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 06:21:42,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 06:21:42,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 06:21:42,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 06:21:42,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 06:21:42,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:42" (1/1) ... [2024-12-06 06:21:42,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:21:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 06:21:42,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 06:21:42,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 06:21:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 06:21:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 06:21:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 06:21:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 06:21:42,848 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 06:21:42,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 06:21:43,386 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-12-06 06:21:43,386 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 06:21:43,973 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 06:21:43,974 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 06:21:43,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:43 BoogieIcfgContainer [2024-12-06 06:21:43,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 06:21:43,975 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 06:21:43,975 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 06:21:43,985 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 06:21:43,985 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:43" (1/1) ... [2024-12-06 06:21:43,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 06:21:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 06:21:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 06:21:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 06:21:44,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-06 06:21:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-06 06:21:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 06:21:45,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-06 06:21:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-06 06:21:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 06:21:46,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-06 06:21:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-06 06:21:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 06:21:48,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-06 06:21:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-06 06:21:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 06:21:49,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-12-06 06:21:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-12-06 06:21:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 06:21:51,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-12-06 06:21:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-12-06 06:21:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 06:21:52,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-12-06 06:21:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-12-06 06:21:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 06:21:52,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2024-12-06 06:21:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-12-06 06:21:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 06:21:52,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2024-12-06 06:21:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2024-12-06 06:21:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 06:21:54,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2024-12-06 06:21:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2024-12-06 06:21:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 06:21:55,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2024-12-06 06:21:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2024-12-06 06:21:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 06:21:59,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 91 states and 176 transitions. [2024-12-06 06:22:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 176 transitions. [2024-12-06 06:22:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 06:22:03,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 97 states and 200 transitions. [2024-12-06 06:22:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 200 transitions. [2024-12-06 06:22:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 06:22:07,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:07,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 115 states and 242 transitions. [2024-12-06 06:22:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 242 transitions. [2024-12-06 06:22:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 06:22:12,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 117 states and 250 transitions. [2024-12-06 06:22:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 250 transitions. [2024-12-06 06:22:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 06:22:14,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 118 states and 254 transitions. [2024-12-06 06:22:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 254 transitions. [2024-12-06 06:22:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 06:22:15,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 130 states and 288 transitions. [2024-12-06 06:22:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 288 transitions. [2024-12-06 06:22:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 06:22:20,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 138 states and 314 transitions. [2024-12-06 06:22:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 314 transitions. [2024-12-06 06:22:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 06:22:24,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 140 states and 321 transitions. [2024-12-06 06:22:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 321 transitions. [2024-12-06 06:22:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 06:22:26,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 142 states and 331 transitions. [2024-12-06 06:22:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 331 transitions. [2024-12-06 06:22:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 06:22:27,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 143 states and 334 transitions. [2024-12-06 06:22:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 334 transitions. [2024-12-06 06:22:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:28,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 162 states and 382 transitions. [2024-12-06 06:22:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 382 transitions. [2024-12-06 06:22:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:37,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 179 states and 416 transitions. [2024-12-06 06:22:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 416 transitions. [2024-12-06 06:22:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:44,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 180 states and 417 transitions. [2024-12-06 06:22:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 417 transitions. [2024-12-06 06:22:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:46,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 195 states and 445 transitions. [2024-12-06 06:22:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 445 transitions. [2024-12-06 06:22:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:52,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 198 states and 459 transitions. [2024-12-06 06:22:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 459 transitions. [2024-12-06 06:22:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:55,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 199 states and 460 transitions. [2024-12-06 06:22:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 460 transitions. [2024-12-06 06:22:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:57,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:57,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:22:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:22:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:22:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 200 states and 463 transitions. [2024-12-06 06:22:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 463 transitions. [2024-12-06 06:22:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:22:59,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:22:59,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:22:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 201 states and 466 transitions. [2024-12-06 06:23:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 466 transitions. [2024-12-06 06:23:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:23:02,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 202 states and 469 transitions. [2024-12-06 06:23:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 469 transitions. [2024-12-06 06:23:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 06:23:04,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 222 states and 512 transitions. [2024-12-06 06:23:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 512 transitions. [2024-12-06 06:23:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 06:23:11,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 225 states and 518 transitions. [2024-12-06 06:23:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 518 transitions. [2024-12-06 06:23:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 06:23:16,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 230 states and 534 transitions. [2024-12-06 06:23:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 534 transitions. [2024-12-06 06:23:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 06:23:20,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 244 states and 588 transitions. [2024-12-06 06:23:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 588 transitions. [2024-12-06 06:23:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 06:23:31,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 258 states and 649 transitions. [2024-12-06 06:23:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 649 transitions. [2024-12-06 06:23:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 06:23:44,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:23:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:23:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 271 states and 674 transitions. [2024-12-06 06:23:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 674 transitions. [2024-12-06 06:23:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 06:23:54,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:23:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:23:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:23:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 284 states and 703 transitions. [2024-12-06 06:24:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 703 transitions. [2024-12-06 06:24:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 06:24:07,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 285 states and 711 transitions. [2024-12-06 06:24:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 711 transitions. [2024-12-06 06:24:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 06:24:08,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:08,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 290 states and 719 transitions. [2024-12-06 06:24:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 719 transitions. [2024-12-06 06:24:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 06:24:11,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 300 states and 742 transitions. [2024-12-06 06:24:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 742 transitions. [2024-12-06 06:24:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 06:24:20,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 312 states and 774 transitions. [2024-12-06 06:24:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 774 transitions. [2024-12-06 06:24:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 06:24:30,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 321 states and 789 transitions. [2024-12-06 06:24:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 789 transitions. [2024-12-06 06:24:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 06:24:37,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 330 states and 804 transitions. [2024-12-06 06:24:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 804 transitions. [2024-12-06 06:24:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 06:24:44,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 331 states and 805 transitions. [2024-12-06 06:24:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 805 transitions. [2024-12-06 06:24:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 06:24:46,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:24:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:24:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 332 states and 812 transitions. [2024-12-06 06:24:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 812 transitions. [2024-12-06 06:24:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:24:48,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:24:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:24:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:24:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 342 states and 837 transitions. [2024-12-06 06:25:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 837 transitions. [2024-12-06 06:25:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:25:01,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 354 states and 861 transitions. [2024-12-06 06:25:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 861 transitions. [2024-12-06 06:25:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:25:21,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 356 states and 874 transitions. [2024-12-06 06:25:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 874 transitions. [2024-12-06 06:25:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:25:25,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 369 states and 898 transitions. [2024-12-06 06:25:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 898 transitions. [2024-12-06 06:25:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:25:35,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 384 states and 948 transitions. [2024-12-06 06:25:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 948 transitions. [2024-12-06 06:25:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:25:56,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:56,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 390 states and 959 transitions. [2024-12-06 06:26:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 959 transitions. [2024-12-06 06:26:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:26:04,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:04,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 405 states and 988 transitions. [2024-12-06 06:26:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 988 transitions. [2024-12-06 06:26:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 06:26:22,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 407 states and 992 transitions. [2024-12-06 06:26:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 992 transitions. [2024-12-06 06:26:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 06:26:31,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 411 states and 1003 transitions. [2024-12-06 06:26:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1003 transitions. [2024-12-06 06:26:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 06:26:41,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 413 states and 1020 transitions. [2024-12-06 06:26:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1020 transitions. [2024-12-06 06:26:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 06:26:45,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 415 states and 1034 transitions. [2024-12-06 06:26:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1034 transitions. [2024-12-06 06:26:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 06:26:49,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 421 states and 1064 transitions. [2024-12-06 06:26:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1064 transitions. [2024-12-06 06:26:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 06:26:57,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 429 states and 1093 transitions. [2024-12-06 06:27:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1093 transitions. [2024-12-06 06:27:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 06:27:06,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:06,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 430 states and 1099 transitions. [2024-12-06 06:27:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1099 transitions. [2024-12-06 06:27:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 06:27:08,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 433 states and 1108 transitions. [2024-12-06 06:27:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1108 transitions. [2024-12-06 06:27:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 06:27:14,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 435 states and 1112 transitions. [2024-12-06 06:27:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1112 transitions. [2024-12-06 06:27:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 06:27:19,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 448 states and 1150 transitions. [2024-12-06 06:27:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1150 transitions. [2024-12-06 06:27:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 06:27:38,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 452 states and 1171 transitions. [2024-12-06 06:27:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1171 transitions. [2024-12-06 06:27:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 06:27:52,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:27:52,725 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 06:27:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:27:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:27:53,892 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 06:27:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:27:54,275 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 64 iterations. [2024-12-06 06:27:54,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 06:27:54 ImpRootNode [2024-12-06 06:27:54,361 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 06:27:54,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 06:27:54,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 06:27:54,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 06:27:54,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:43" (3/4) ... [2024-12-06 06:27:54,364 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 06:27:54,457 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 177. [2024-12-06 06:27:54,558 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 06:27:54,558 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 06:27:54,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 06:27:54,559 INFO L158 Benchmark]: Toolchain (without parser) took 372208.92ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 115.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-12-06 06:27:54,559 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:27:54,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.47ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 98.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 06:27:54,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.40ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:27:54,560 INFO L158 Benchmark]: Boogie Preprocessor took 27.11ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 06:27:54,561 INFO L158 Benchmark]: RCFGBuilder took 1260.44ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 47.9MB in the end (delta: 45.4MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-12-06 06:27:54,561 INFO L158 Benchmark]: CodeCheck took 370386.63ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 47.9MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 927.8MB. Max. memory is 16.1GB. [2024-12-06 06:27:54,561 INFO L158 Benchmark]: Witness Printer took 196.32ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 06:27:54,563 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: 370.3s, OverallIterations: 64, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33840 SdHoareTripleChecker+Valid, 205.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31755 mSDsluCounter, 11345 SdHoareTripleChecker+Invalid, 184.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10312 mSDsCounter, 11474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102757 IncrementalHoareTripleChecker+Invalid, 114231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11474 mSolverCounterUnsat, 1033 mSDtfsCounter, 102757 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21460 GetRequests, 19115 SyntacticMatches, 789 SemanticMatches, 1556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475178 ImplicationChecksByTransitivity, 293.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 96.1s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1721 ConstructedInterpolants, 0 QuantifiedInterpolants, 18943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 10 PerfectInterpolantSequences, 193/1046 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 573]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] _Bool newmax1 ; [L57] char id2 ; [L58] char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] _Bool newmax2 ; [L65] char id3 ; [L66] char r3 ; [L67] char st3 ; [L68] char nl3 ; [L69] char m3 ; [L70] char max3 ; [L71] _Bool mode3 ; [L72] _Bool newmax3 ; [L491] int c1 ; [L492] int i2 ; [L495] c1 = 0 [L496] ep12 = __VERIFIER_nondet_bool() [L497] ep13 = __VERIFIER_nondet_bool() [L498] ep21 = __VERIFIER_nondet_bool() [L499] ep23 = __VERIFIER_nondet_bool() [L500] ep31 = __VERIFIER_nondet_bool() [L501] ep32 = __VERIFIER_nondet_bool() [L502] id1 = __VERIFIER_nondet_char() [L503] r1 = __VERIFIER_nondet_char() [L504] st1 = __VERIFIER_nondet_char() [L505] nl1 = __VERIFIER_nondet_char() [L506] m1 = __VERIFIER_nondet_char() [L507] max1 = __VERIFIER_nondet_char() [L508] mode1 = __VERIFIER_nondet_bool() [L509] newmax1 = __VERIFIER_nondet_bool() [L510] id2 = __VERIFIER_nondet_char() [L511] r2 = __VERIFIER_nondet_char() [L512] st2 = __VERIFIER_nondet_char() [L513] nl2 = __VERIFIER_nondet_char() [L514] m2 = __VERIFIER_nondet_char() [L515] max2 = __VERIFIER_nondet_char() [L516] mode2 = __VERIFIER_nondet_bool() [L517] newmax2 = __VERIFIER_nondet_bool() [L518] id3 = __VERIFIER_nondet_char() [L519] r3 = __VERIFIER_nondet_char() [L520] st3 = __VERIFIER_nondet_char() [L521] nl3 = __VERIFIER_nondet_char() [L522] m3 = __VERIFIER_nondet_char() [L523] max3 = __VERIFIER_nondet_char() [L524] mode3 = __VERIFIER_nondet_bool() [L525] newmax3 = __VERIFIER_nondet_bool() [L526] CALL, EXPR init() [L228] _Bool r121 ; [L229] _Bool r131 ; [L230] _Bool r211 ; [L231] _Bool r231 ; [L232] _Bool r311 ; [L233] _Bool r321 ; [L234] _Bool r122 ; [L235] int tmp ; [L236] _Bool r132 ; [L237] int tmp___0 ; [L238] _Bool r212 ; [L239] int tmp___1 ; [L240] _Bool r232 ; [L241] int tmp___2 ; [L242] _Bool r312 ; [L243] int tmp___3 ; [L244] _Bool r322 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L249] r121 = ep12 [L250] r131 = ep13 [L251] r211 = ep21 [L252] r231 = ep23 [L253] r311 = ep31 [L254] r321 = ep32 [L255] COND FALSE !(\read(r121)) [L258] COND TRUE \read(r131) [L259] COND FALSE !(\read(ep32)) [L262] tmp = 0 [L267] r122 = (_Bool )tmp [L268] COND TRUE \read(r131) [L269] tmp___0 = 1 [L280] r132 = (_Bool )tmp___0 [L281] COND FALSE !(\read(r211)) [L284] COND TRUE \read(r231) [L285] COND FALSE !(\read(ep31)) [L288] tmp___1 = 0 [L293] r212 = (_Bool )tmp___1 [L294] COND TRUE \read(r231) [L295] tmp___2 = 1 [L306] r232 = (_Bool )tmp___2 [L307] COND FALSE !(\read(r311)) [L310] COND FALSE !(\read(r321)) [L317] tmp___3 = 0 [L319] r312 = (_Bool )tmp___3 [L320] COND FALSE !(\read(r321)) [L323] COND FALSE !(\read(r311)) [L330] tmp___4 = 0 [L332] r322 = (_Bool )tmp___4 [L333] COND TRUE (int )id1 != (int )id2 [L334] COND TRUE (int )id1 != (int )id3 [L335] COND TRUE (int )id2 != (int )id3 [L336] COND TRUE (int )id1 >= 0 [L337] COND TRUE (int )id2 >= 0 [L338] COND TRUE (int )id3 >= 0 [L339] COND TRUE (int )r1 == 0 [L340] COND TRUE (int )r2 == 0 [L341] COND TRUE (int )r3 == 0 [L342] COND TRUE (int )max1 == (int )id1 [L343] COND TRUE (int )max2 == (int )id2 [L344] COND TRUE (int )max3 == (int )id3 [L345] COND TRUE (int )st1 == 0 [L346] COND TRUE (int )st2 == 0 [L347] COND TRUE (int )st3 == 0 [L348] COND TRUE (int )nl1 == 0 [L349] COND TRUE (int )nl2 == 0 [L350] COND TRUE (int )nl3 == 0 [L351] COND TRUE (int )mode1 == 0 [L352] COND TRUE (int )mode2 == 0 [L353] COND TRUE (int )mode3 == 0 [L354] COND TRUE \read(newmax1) [L355] COND TRUE \read(newmax2) [L356] COND TRUE \read(newmax3) [L357] tmp___5 = 1 [L430] return (tmp___5); [L526] RET, EXPR init() [L526] i2 = init() [L527] COND FALSE !(!(i2)) [L528] p12_old = nomsg [L529] p12_new = nomsg [L530] p13_old = nomsg [L531] p13_new = nomsg [L532] p21_old = nomsg [L533] p21_new = nomsg [L534] p23_old = nomsg [L535] p23_new = nomsg [L536] p31_old = nomsg [L537] p31_new = nomsg [L538] p32_old = nomsg [L539] p32_new = nomsg [L540] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND TRUE \read(ep13) [L114] COND TRUE \read(newmax1) [L115] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND TRUE \read(newmax2) [L166] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, i2=1, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND FALSE !((int )r2 == 2) [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND TRUE \read(ep13) [L184] m3 = p13_old [L185] p13_old = nomsg [L186] COND TRUE (int )m3 > (int )max3 [L187] max3 = m3 [L188] newmax = (_Bool)1 [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND TRUE (int )m3 > (int )max3 [L195] max3 = m3 [L196] newmax = (_Bool)1 [L199] newmax3 = newmax [L200] COND FALSE !((int )r3 == 2) [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, i2=2, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND TRUE \read(ep13) [L114] COND FALSE !(\read(newmax1)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND FALSE !(\read(newmax2)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, i2=3, id1=1, id2=2, id3=0, m1=2, m2=3, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND TRUE (int )r2 == 2 [L150] COND TRUE (int )max2 == (int )id2 [L151] st2 = (char)1 [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND TRUE \read(ep13) [L184] m3 = p13_old [L185] p13_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND TRUE (int )r3 == 2 [L201] COND FALSE !((int )max3 == (int )id3) [L204] nl3 = (char)1 [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L438] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L484] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L573] reach_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.47ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 98.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.40ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.11ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1260.44ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 47.9MB in the end (delta: 45.4MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * CodeCheck took 370386.63ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 47.9MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 927.8MB. Max. memory is 16.1GB. * Witness Printer took 196.32ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 06:27:54,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d748ae-0161-4cb9-85fd-63ecc963c4f1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE