./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.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_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/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_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/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_5bf541f7-0461-4834-9fd3-90062a033ad3/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 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:56:10,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:56:10,194 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:56:10,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:56:10,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:56:10,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:56:10,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:56:10,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:56:10,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:56:10,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:56:10,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:56:10,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:56:10,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:56:10,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:56:10,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:56:10,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:56:10,219 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:56:10,219 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:56:10,219 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:56:10,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:56:10,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:56:10,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:56:10,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:56:10,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:56:10,220 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:56:10,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:56:10,220 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_5bf541f7-0461-4834-9fd3-90062a033ad3/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 -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2024-12-05 23:56:10,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:56:10,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:56:10,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:56:10,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:56:10,437 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:56:10,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-12-05 23:56:13,032 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/data/a3d52d438/3f9e1bd0bb534faf9a570229d1af6194/FLAG39cfca381 [2024-12-05 23:56:13,252 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:56:13,252 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-12-05 23:56:13,259 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/data/a3d52d438/3f9e1bd0bb534faf9a570229d1af6194/FLAG39cfca381 [2024-12-05 23:56:13,609 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/data/a3d52d438/3f9e1bd0bb534faf9a570229d1af6194 [2024-12-05 23:56:13,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:56:13,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:56:13,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:56:13,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:56:13,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:56:13,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e00910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13, skipping insertion in model container [2024-12-05 23:56:13,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:56:13,845 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_5bf541f7-0461-4834-9fd3-90062a033ad3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-12-05 23:56:13,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:56:13,858 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:56:13,905 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_5bf541f7-0461-4834-9fd3-90062a033ad3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-12-05 23:56:13,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:56:13,920 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:56:13,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13 WrapperNode [2024-12-05 23:56:13,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:56:13,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:56:13,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:56:13,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:56:13,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,964 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-12-05 23:56:13,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:56:13,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:56:13,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:56:13,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:56:13,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:13,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:56:14,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:56:14,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:56:14,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:56:14,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:56:13" (1/1) ... [2024-12-05 23:56:14,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:56:14,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:56:14,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:56:14,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:56:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:56:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:56:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:56:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:56:14,149 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:56:14,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:56:14,658 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-12-05 23:56:14,658 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:56:15,276 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:56:15,276 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-05 23:56:15,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:56:15 BoogieIcfgContainer [2024-12-05 23:56:15,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:56:15,277 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:56:15,277 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:56:15,287 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:56:15,287 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:56:15" (1/1) ... [2024-12-05 23:56:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:56:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-05 23:56:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-05 23:56:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 23:56:15,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:17,525 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-05 23:56:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-05 23:56:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-05 23:56:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:56:17,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:18,709 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-05 23:56:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-05 23:56:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-05 23:56:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 23:56:19,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:19,876 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-05 23:56:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-05 23:56:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-05 23:56:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 23:56:20,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:56:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-05 23:56:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-05 23:56:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-05 23:56:21,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:22,677 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-05 23:56:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 38 states and 70 transitions. [2024-12-05 23:56:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 70 transitions. [2024-12-05 23:56:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:56:23,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:23,627 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-05 23:56:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 44 states and 83 transitions. [2024-12-05 23:56:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 83 transitions. [2024-12-05 23:56:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 23:56:24,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:24,593 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-05 23:56:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 45 states and 83 transitions. [2024-12-05 23:56:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2024-12-05 23:56:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:56:24,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:25,451 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-05 23:56:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 55 states and 102 transitions. [2024-12-05 23:56:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2024-12-05 23:56:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:56:26,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:27,194 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-05 23:56:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 64 states and 118 transitions. [2024-12-05 23:56:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 118 transitions. [2024-12-05 23:56:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:56:28,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:28,740 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-05 23:56:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 67 states and 124 transitions. [2024-12-05 23:56:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 124 transitions. [2024-12-05 23:56:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 23:56:28,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:30,830 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-05 23:56:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 83 states and 158 transitions. [2024-12-05 23:56:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 158 transitions. [2024-12-05 23:56:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:56:34,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:34,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:35,559 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-05 23:56:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 97 states and 193 transitions. [2024-12-05 23:56:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 193 transitions. [2024-12-05 23:56:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:56:39,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:40,284 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-05 23:56:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 111 states and 216 transitions. [2024-12-05 23:56:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 216 transitions. [2024-12-05 23:56:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:56:43,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:44,464 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-05 23:56:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 114 states and 225 transitions. [2024-12-05 23:56:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 225 transitions. [2024-12-05 23:56:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:56:45,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:46,727 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-05 23:56:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 116 states and 234 transitions. [2024-12-05 23:56:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 234 transitions. [2024-12-05 23:56:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:56:47,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:48,790 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-05 23:56:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 124 states and 256 transitions. [2024-12-05 23:56:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 256 transitions. [2024-12-05 23:56:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:56:51,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:52,655 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-05 23:56:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 126 states and 264 transitions. [2024-12-05 23:56:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 264 transitions. [2024-12-05 23:56:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:56:53,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:56:54,690 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-05 23:56:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:56:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 143 states and 291 transitions. [2024-12-05 23:56:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 291 transitions. [2024-12-05 23:56:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 23:56:59,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:56:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:56:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:01,721 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-05 23:57:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 162 states and 334 transitions. [2024-12-05 23:57:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 334 transitions. [2024-12-05 23:57:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 23:57:08,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:09,289 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-05 23:57:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 169 states and 356 transitions. [2024-12-05 23:57:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 356 transitions. [2024-12-05 23:57:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 23:57:12,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:13,537 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-05 23:57:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 180 states and 380 transitions. [2024-12-05 23:57:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 380 transitions. [2024-12-05 23:57:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 23:57:16,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:19,192 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-05 23:57:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 188 states and 395 transitions. [2024-12-05 23:57:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 395 transitions. [2024-12-05 23:57:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 23:57:22,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:57:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 189 states and 396 transitions. [2024-12-05 23:57:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 396 transitions. [2024-12-05 23:57:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 23:57:23,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:24,943 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-05 23:57:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 193 states and 404 transitions. [2024-12-05 23:57:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 404 transitions. [2024-12-05 23:57:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 23:57:27,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:29,312 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-05 23:57:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 207 states and 454 transitions. [2024-12-05 23:57:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 454 transitions. [2024-12-05 23:57:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 23:57:36,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:37,882 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-05 23:57:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 222 states and 493 transitions. [2024-12-05 23:57:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 493 transitions. [2024-12-05 23:57:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:57:44,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:45,707 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-05 23:57:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 234 states and 520 transitions. [2024-12-05 23:57:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 520 transitions. [2024-12-05 23:57:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:57:52,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:57:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:57:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 239 states and 531 transitions. [2024-12-05 23:57:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 531 transitions. [2024-12-05 23:57:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 23:57:57,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:57:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:57:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:57:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:58:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 250 states and 554 transitions. [2024-12-05 23:58:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 554 transitions. [2024-12-05 23:58:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:58:07,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:12,036 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-05 23:58:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 260 states and 580 transitions. [2024-12-05 23:58:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 580 transitions. [2024-12-05 23:58:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:58:22,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:24,133 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-05 23:58:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 262 states and 590 transitions. [2024-12-05 23:58:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 590 transitions. [2024-12-05 23:58:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:58:26,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:28,119 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-05 23:58:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 265 states and 601 transitions. [2024-12-05 23:58:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 601 transitions. [2024-12-05 23:58:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 23:58:30,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:31,917 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-05 23:58:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 266 states and 606 transitions. [2024-12-05 23:58:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 606 transitions. [2024-12-05 23:58:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:58:32,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:35,294 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-05 23:58:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 277 states and 636 transitions. [2024-12-05 23:58:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 636 transitions. [2024-12-05 23:58:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:58:46,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:48,129 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-05 23:58:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:58:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 282 states and 655 transitions. [2024-12-05 23:58:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 655 transitions. [2024-12-05 23:58:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:58:52,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:58:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:58:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:58:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:59:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 287 states and 679 transitions. [2024-12-05 23:59:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 679 transitions. [2024-12-05 23:59:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:59:05,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:06,476 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-05 23:59:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 289 states and 684 transitions. [2024-12-05 23:59:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 684 transitions. [2024-12-05 23:59:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:59:08,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:08,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:09,592 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-05 23:59:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 290 states and 685 transitions. [2024-12-05 23:59:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 685 transitions. [2024-12-05 23:59:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 23:59:10,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:12,168 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-05 23:59:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 292 states and 696 transitions. [2024-12-05 23:59:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 696 transitions. [2024-12-05 23:59:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:59:13,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:15,730 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-05 23:59:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 295 states and 708 transitions. [2024-12-05 23:59:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 708 transitions. [2024-12-05 23:59:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:59:20,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:21,201 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-05 23:59:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 300 states and 725 transitions. [2024-12-05 23:59:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 725 transitions. [2024-12-05 23:59:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:59:26,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:27,304 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-05 23:59:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 301 states and 727 transitions. [2024-12-05 23:59:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 727 transitions. [2024-12-05 23:59:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:59:28,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:28,998 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-05 23:59:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 305 states and 744 transitions. [2024-12-05 23:59:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 744 transitions. [2024-12-05 23:59:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:59:32,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:33,520 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-05 23:59:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 307 states and 752 transitions. [2024-12-05 23:59:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 752 transitions. [2024-12-05 23:59:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 23:59:35,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:36,325 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-05 23:59:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 308 states and 754 transitions. [2024-12-05 23:59:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 754 transitions. [2024-12-05 23:59:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:59:37,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:40,816 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-05 23:59:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 326 states and 801 transitions. [2024-12-05 23:59:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 801 transitions. [2024-12-05 23:59:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:59:55,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:59:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-05 23:59:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:59:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 327 states and 802 transitions. [2024-12-05 23:59:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 802 transitions. [2024-12-05 23:59:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 23:59:55,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:59:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:59:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:00,757 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 00:00:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 333 states and 812 transitions. [2024-12-06 00:00:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 812 transitions. [2024-12-06 00:00:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:08,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:12,566 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 00:00:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 335 states and 821 transitions. [2024-12-06 00:00:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 821 transitions. [2024-12-06 00:00:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:15,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:19,577 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 00:00:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 336 states and 823 transitions. [2024-12-06 00:00:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 823 transitions. [2024-12-06 00:00:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:21,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:23,752 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 00:00:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 337 states and 825 transitions. [2024-12-06 00:00:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 825 transitions. [2024-12-06 00:00:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:25,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:29,096 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 00:00:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 339 states and 834 transitions. [2024-12-06 00:00:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 834 transitions. [2024-12-06 00:00:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:32,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:33,961 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 00:00:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 341 states and 837 transitions. [2024-12-06 00:00:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 837 transitions. [2024-12-06 00:00:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:35,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:00:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 342 states and 840 transitions. [2024-12-06 00:00:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 840 transitions. [2024-12-06 00:00:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:00:39,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:42,480 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 00:00:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 358 states and 868 transitions. [2024-12-06 00:00:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 868 transitions. [2024-12-06 00:00:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 00:00:51,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:00:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:00:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:00:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 358 states and 867 transitions. [2024-12-06 00:00:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 867 transitions. [2024-12-06 00:00:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 00:00:51,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:00:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:00:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:00:52,081 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 00:00:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:00:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:00:53,530 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 00:00:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:00:54,098 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 57 iterations. [2024-12-06 00:00:54,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:00:54 ImpRootNode [2024-12-06 00:00:54,191 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:00:54,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:00:54,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:00:54,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:00:54,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:56:15" (3/4) ... [2024-12-06 00:00:54,194 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 00:00:54,288 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 188. [2024-12-06 00:00:54,383 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:00:54,384 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:00:54,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:00:54,384 INFO L158 Benchmark]: Toolchain (without parser) took 280772.68ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 115.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 795.6MB. Max. memory is 16.1GB. [2024-12-06 00:00:54,385 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:00:54,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.27ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 98.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 00:00:54,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.38ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:00:54,385 INFO L158 Benchmark]: Boogie Preprocessor took 34.48ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:00:54,386 INFO L158 Benchmark]: RCFGBuilder took 1276.35ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 99.0MB in the end (delta: -5.9MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2024-12-06 00:00:54,386 INFO L158 Benchmark]: CodeCheck took 278913.58ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 99.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 750.0MB. Max. memory is 16.1GB. [2024-12-06 00:00:54,386 INFO L158 Benchmark]: Witness Printer took 192.23ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 00:00:54,388 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: 278.8s, OverallIterations: 57, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27153 SdHoareTripleChecker+Valid, 158.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25163 mSDsluCounter, 9448 SdHoareTripleChecker+Invalid, 143.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8387 mSDsCounter, 8752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77434 IncrementalHoareTripleChecker+Invalid, 86186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8752 mSolverCounterUnsat, 1061 mSDtfsCounter, 77434 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18707 GetRequests, 16572 SyntacticMatches, 847 SemanticMatches, 1288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023575 ImplicationChecksByTransitivity, 201.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 87.3s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1652 ConstructedInterpolants, 0 QuantifiedInterpolants, 15409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 13 PerfectInterpolantSequences, 268/1151 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: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND FALSE !(\read(r121)) [L261] COND TRUE \read(r131) [L262] COND TRUE \read(ep32) [L263] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND FALSE !(\read(r231)) [L300] COND TRUE \read(r211) [L301] COND TRUE \read(ep13) [L302] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND TRUE \read(r321) [L324] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=0, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 1 [L111] COND FALSE !(\read(ep12)) [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND TRUE \read(ep32) [L219] COND TRUE \read(newmax3) [L220] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=1, id1=125, id2=127, id3=126, m1=-2, m2=0, m3=124, max1=125, max2=127, max3=126, 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=125, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L89] newmax = (_Bool)1 [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND FALSE !(\read(ep12)) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=2, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND FALSE !((int )r1 < 1) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND FALSE !(\read(newmax2)) [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND TRUE \read(ep32) [L219] COND FALSE !(\read(newmax3)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=3, id1=125, id2=127, id3=126, m1=126, m2=126, m3=125, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] nl1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND FALSE !(\read(ep12)) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L600] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=125, id2=127, id3=126, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.27ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 98.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.38ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.48ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1276.35ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 99.0MB in the end (delta: -5.9MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * CodeCheck took 278913.58ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 99.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 750.0MB. Max. memory is 16.1GB. * Witness Printer took 192.23ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB 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 00:00:54,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bf541f7-0461-4834-9fd3-90062a033ad3/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