./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:04:16,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:04:16,135 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:04:16,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:04:16,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:04:16,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:04:16,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:04:16,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:04:16,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:04:16,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:04:16,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:04:16,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:04:16,165 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:04:16,165 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:04:16,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:04:16,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:04:16,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:04:16,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:04:16,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:04:16,166 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:04:16,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:04:16,166 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_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2024-11-13 21:04:16,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:04:16,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:04:16,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:04:16,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:04:16,467 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:04:16,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-13 21:04:18,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:04:18,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:04:18,766 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-13 21:04:18,777 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/data/8019fb624/02477a1325d0402d8d42e9e432b70d8e/FLAGe2a977da5 [2024-11-13 21:04:19,009 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/data/8019fb624/02477a1325d0402d8d42e9e432b70d8e [2024-11-13 21:04:19,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:04:19,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:04:19,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:04:19,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:04:19,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:04:19,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eeae314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19, skipping insertion in model container [2024-11-13 21:04:19,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:04:19,299 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_c36f0bcb-9ca2-4159-80af-b312b129ceb6/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-13 21:04:19,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:04:19,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:04:19,382 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_c36f0bcb-9ca2-4159-80af-b312b129ceb6/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-13 21:04:19,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:04:19,411 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:04:19,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19 WrapperNode [2024-11-13 21:04:19,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:04:19,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:04:19,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:04:19,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:04:19,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,467 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-13 21:04:19,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:04:19,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:04:19,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:04:19,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:04:19,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:04:19,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:04:19,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:04:19,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:04:19,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:19" (1/1) ... [2024-11-13 21:04:19,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:04:19,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:04:19,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:04:19,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:04:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:04:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:04:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:04:19,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:04:19,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:04:19,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:04:20,457 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-13 21:04:20,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:04:21,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:04:21,300 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:04:21,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:04:21 BoogieIcfgContainer [2024-11-13 21:04:21,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:04:21,301 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:04:21,301 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:04:21,311 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:04:21,311 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:04:21" (1/1) ... [2024-11-13 21:04:21,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:04:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:04:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:04:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:04:21,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-11-13 21:04:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-11-13 21:04:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:04:24,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-11-13 21:04:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-11-13 21:04:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:04:26,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-11-13 21:04:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-11-13 21:04:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:04:27,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-11-13 21:04:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-11-13 21:04:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:04:29,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-11-13 21:04:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-11-13 21:04:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:04:32,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-11-13 21:04:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-11-13 21:04:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:04:34,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-11-13 21:04:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-11-13 21:04:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:04:34,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-13 21:04:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-13 21:04:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:04:37,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 66 states and 120 transitions. [2024-11-13 21:04:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 120 transitions. [2024-11-13 21:04:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:04:40,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 69 states and 126 transitions. [2024-11-13 21:04:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 126 transitions. [2024-11-13 21:04:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:04:40,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 85 states and 163 transitions. [2024-11-13 21:04:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 163 transitions. [2024-11-13 21:04:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:04:48,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 99 states and 189 transitions. [2024-11-13 21:04:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 189 transitions. [2024-11-13 21:04:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:04:54,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 105 states and 201 transitions. [2024-11-13 21:04:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 201 transitions. [2024-11-13 21:04:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:04:57,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 123 states and 243 transitions. [2024-11-13 21:05:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 243 transitions. [2024-11-13 21:05:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:05:04,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 125 states and 247 transitions. [2024-11-13 21:05:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 247 transitions. [2024-11-13 21:05:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:05:06,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 139 states and 280 transitions. [2024-11-13 21:05:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 280 transitions. [2024-11-13 21:05:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:05:13,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 140 states and 281 transitions. [2024-11-13 21:05:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 281 transitions. [2024-11-13 21:05:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:05:14,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 142 states and 287 transitions. [2024-11-13 21:05:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 287 transitions. [2024-11-13 21:05:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:05:16,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 143 states and 288 transitions. [2024-11-13 21:05:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 288 transitions. [2024-11-13 21:05:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:05:18,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:18,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 162 states and 326 transitions. [2024-11-13 21:05:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 326 transitions. [2024-11-13 21:05:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:05:27,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 164 states and 329 transitions. [2024-11-13 21:05:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 329 transitions. [2024-11-13 21:05:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:05:30,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 168 states and 338 transitions. [2024-11-13 21:05:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 338 transitions. [2024-11-13 21:05:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:05:34,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 169 states and 340 transitions. [2024-11-13 21:05:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 340 transitions. [2024-11-13 21:05:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:05:38,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 180 states and 365 transitions. [2024-11-13 21:05:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 365 transitions. [2024-11-13 21:05:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:05:45,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 182 states and 372 transitions. [2024-11-13 21:05:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 372 transitions. [2024-11-13 21:05:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:05:46,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:05:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 183 states and 373 transitions. [2024-11-13 21:05:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 373 transitions. [2024-11-13 21:05:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:05:46,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 195 states and 398 transitions. [2024-11-13 21:05:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 398 transitions. [2024-11-13 21:05:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:05:56,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:56,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 194 states and 387 transitions. [2024-11-13 21:05:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 387 transitions. [2024-11-13 21:05:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:05:59,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 208 states and 442 transitions. [2024-11-13 21:06:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 442 transitions. [2024-11-13 21:06:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:06:11,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 222 states and 503 transitions. [2024-11-13 21:06:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 503 transitions. [2024-11-13 21:06:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:06:25,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 236 states and 561 transitions. [2024-11-13 21:06:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 561 transitions. [2024-11-13 21:06:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:06:41,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 249 states and 595 transitions. [2024-11-13 21:06:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 595 transitions. [2024-11-13 21:06:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:06:53,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 260 states and 620 transitions. [2024-11-13 21:07:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 620 transitions. [2024-11-13 21:07:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:07:05,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 21:07:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 264 states and 625 transitions. [2024-11-13 21:07:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 625 transitions. [2024-11-13 21:07:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:07:11,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 270 states and 633 transitions. [2024-11-13 21:07:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 633 transitions. [2024-11-13 21:07:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:07:19,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 21:07:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 276 states and 647 transitions. [2024-11-13 21:07:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 647 transitions. [2024-11-13 21:07:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:07:29,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 283 states and 668 transitions. [2024-11-13 21:07:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 668 transitions. [2024-11-13 21:07:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:07:43,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 293 states and 684 transitions. [2024-11-13 21:07:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 684 transitions. [2024-11-13 21:07:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:07:56,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 307 states and 714 transitions. [2024-11-13 21:08:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 714 transitions. [2024-11-13 21:08:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:08:14,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 316 states and 738 transitions. [2024-11-13 21:08:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 738 transitions. [2024-11-13 21:08:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:08:30,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 318 states and 750 transitions. [2024-11-13 21:08:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 750 transitions. [2024-11-13 21:08:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:08:34,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 323 states and 759 transitions. [2024-11-13 21:08:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 759 transitions. [2024-11-13 21:08:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:08:40,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 330 states and 781 transitions. [2024-11-13 21:08:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 781 transitions. [2024-11-13 21:08:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:08:54,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 330 states and 780 transitions. [2024-11-13 21:09:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 780 transitions. [2024-11-13 21:09:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:09:00,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 338 states and 802 transitions. [2024-11-13 21:09:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 802 transitions. [2024-11-13 21:09:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:09:11,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 348 states and 828 transitions. [2024-11-13 21:09:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 828 transitions. [2024-11-13 21:09:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:09:27,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 353 states and 847 transitions. [2024-11-13 21:09:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 847 transitions. [2024-11-13 21:09:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:09:36,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 355 states and 851 transitions. [2024-11-13 21:09:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 851 transitions. [2024-11-13 21:09:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:09:42,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 356 states and 858 transitions. [2024-11-13 21:09:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 858 transitions. [2024-11-13 21:09:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:09:44,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 359 states and 862 transitions. [2024-11-13 21:09:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 862 transitions. [2024-11-13 21:09:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:09:49,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 363 states and 877 transitions. [2024-11-13 21:09:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 877 transitions. [2024-11-13 21:09:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:09:55,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 364 states and 877 transitions. [2024-11-13 21:09:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 877 transitions. [2024-11-13 21:09:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:09:58,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 371 states and 901 transitions. [2024-11-13 21:10:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 901 transitions. [2024-11-13 21:10:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:10:17,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 375 states and 909 transitions. [2024-11-13 21:10:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 909 transitions. [2024-11-13 21:10:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:10:27,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 384 states and 933 transitions. [2024-11-13 21:10:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 933 transitions. [2024-11-13 21:10:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:10:39,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 386 states and 937 transitions. [2024-11-13 21:10:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 937 transitions. [2024-11-13 21:10:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:10:46,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 387 states and 939 transitions. [2024-11-13 21:10:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 939 transitions. [2024-11-13 21:10:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:10:50,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:50,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 391 states and 956 transitions. [2024-11-13 21:11:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 956 transitions. [2024-11-13 21:11:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:11:04,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:11:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 393 states and 957 transitions. [2024-11-13 21:11:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 957 transitions. [2024-11-13 21:11:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:11:09,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:11:09,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:11:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:11:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:11:11,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:11:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:11:12,198 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2024-11-13 21:11:12,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:11:12 ImpRootNode [2024-11-13 21:11:12,553 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:11:12,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:11:12,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:11:12,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:11:12,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:04:21" (3/4) ... [2024-11-13 21:11:12,557 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:11:12,792 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:11:12,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:11:12,793 INFO L158 Benchmark]: Toolchain (without parser) took 413780.10ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 118.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. [2024-11-13 21:11:12,794 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 167.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:11:12,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.92ms. Allocated memory is still 142.6MB. Free memory was 118.6MB in the beginning and 101.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:11:12,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 99.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:11:12,798 INFO L158 Benchmark]: Boogie Preprocessor took 44.14ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:11:12,798 INFO L158 Benchmark]: RCFGBuilder took 1787.09ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 63.3MB in the end (delta: 33.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2024-11-13 21:11:12,799 INFO L158 Benchmark]: CodeCheck took 411252.75ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 63.3MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-13 21:11:12,799 INFO L158 Benchmark]: Witness Printer took 238.12ms. Allocated memory is still 3.7GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:11:12,800 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: 410.9s, OverallIterations: 60, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29977 SdHoareTripleChecker+Valid, 213.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28032 mSDsluCounter, 11470 SdHoareTripleChecker+Invalid, 192.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10505 mSDsCounter, 10857 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87504 IncrementalHoareTripleChecker+Invalid, 98361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10857 mSolverCounterUnsat, 965 mSDtfsCounter, 87504 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18686 GetRequests, 16423 SyntacticMatches, 787 SemanticMatches, 1476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306555 ImplicationChecksByTransitivity, 320.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 103.3s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1779 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1672 ConstructedInterpolants, 0 QuantifiedInterpolants, 14297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 224/1081 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND TRUE \read(r121) [L245] COND TRUE \read(ep23) [L246] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND TRUE \read(ep21) [L285] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, i2=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, i2=1, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND TRUE (int )m3 > (int )max3 [L174] max3 = m3 [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, i2=2, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, i2=3, id1=125, id2=126, id3=124, m1=126, m2=124, m3=126, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] st1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND FALSE !((int )max3 == (int )id3) [L181] nl3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L555] reach_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 167.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.92ms. Allocated memory is still 142.6MB. Free memory was 118.6MB in the beginning and 101.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 99.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.14ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1787.09ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 63.3MB in the end (delta: 33.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * CodeCheck took 411252.75ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 63.3MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 238.12ms. Allocated memory is still 3.7GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:11:12,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c36f0bcb-9ca2-4159-80af-b312b129ceb6/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE