./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/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_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:53:59,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:53:59,113 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 01:53:59,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:53:59,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:53:59,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:53:59,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:53:59,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:53:59,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:53:59,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:53:59,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:53:59,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:53:59,141 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:53:59,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:53:59,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:53:59,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:53:59,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:53:59,142 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:53:59,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:53:59,142 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_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2024-12-06 01:53:59,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:53:59,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:53:59,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:53:59,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:53:59,400 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:53:59,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-12-06 01:54:01,978 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/data/1ee2a70b3/70f05f06076c4ed49b5e3538b06b6d48/FLAGc06942515 [2024-12-06 01:54:02,202 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:54:02,202 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-12-06 01:54:02,211 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/data/1ee2a70b3/70f05f06076c4ed49b5e3538b06b6d48/FLAGc06942515 [2024-12-06 01:54:02,563 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/data/1ee2a70b3/70f05f06076c4ed49b5e3538b06b6d48 [2024-12-06 01:54:02,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:54:02,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:54:02,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:54:02,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:54:02,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:54:02,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed0f21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02, skipping insertion in model container [2024-12-06 01:54:02,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:54:02,777 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_92b3fda9-5709-432b-a625-4c85cc1ddc2b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-12-06 01:54:02,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:54:02,791 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:54:02,835 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_92b3fda9-5709-432b-a625-4c85cc1ddc2b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-12-06 01:54:02,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:54:02,850 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:54:02,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02 WrapperNode [2024-12-06 01:54:02,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:54:02,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:54:02,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:54:02,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:54:02,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,890 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-12-06 01:54:02,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:54:02,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:54:02,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:54:02,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:54:02,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:54:02,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:54:02,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:54:02,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:54:02,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:54:02" (1/1) ... [2024-12-06 01:54:02,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:54:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:54:02,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:54:02,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:54:02,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:54:02,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:54:02,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:54:02,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:54:03,046 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:54:03,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:54:03,496 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-12-06 01:54:03,497 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:54:04,035 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:54:04,035 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 01:54:04,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:54:04 BoogieIcfgContainer [2024-12-06 01:54:04,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:54:04,036 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:54:04,036 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:54:04,046 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:54:04,046 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:54:04" (1/1) ... [2024-12-06 01:54:04,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:54:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 01:54:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 01:54:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 01:54:04,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-06 01:54:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-06 01:54:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 01:54:06,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-06 01:54:07,419 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-06 01:54:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 01:54:07,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-06 01:54:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-06 01:54:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 01:54:08,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-06 01:54:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-06 01:54:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 01:54:10,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-12-06 01:54:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-12-06 01:54:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 01:54:11,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-12-06 01:54:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-12-06 01:54:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 01:54:12,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-12-06 01:54:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-12-06 01:54:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 01:54:13,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-12-06 01:54:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-12-06 01:54:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 01:54:14,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 66 states and 120 transitions. [2024-12-06 01:54:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 120 transitions. [2024-12-06 01:54:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 01:54:16,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 69 states and 126 transitions. [2024-12-06 01:54:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 126 transitions. [2024-12-06 01:54:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 01:54:17,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 85 states and 167 transitions. [2024-12-06 01:54:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 167 transitions. [2024-12-06 01:54:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 01:54:22,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 99 states and 194 transitions. [2024-12-06 01:54:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 194 transitions. [2024-12-06 01:54:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 01:54:26,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 105 states and 206 transitions. [2024-12-06 01:54:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 206 transitions. [2024-12-06 01:54:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 01:54:28,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:28,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 123 states and 246 transitions. [2024-12-06 01:54:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 246 transitions. [2024-12-06 01:54:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 01:54:33,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 124 states and 249 transitions. [2024-12-06 01:54:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2024-12-06 01:54:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 01:54:34,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 126 states and 257 transitions. [2024-12-06 01:54:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 257 transitions. [2024-12-06 01:54:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 01:54:36,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 140 states and 287 transitions. [2024-12-06 01:54:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 287 transitions. [2024-12-06 01:54:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 01:54:41,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 142 states and 298 transitions. [2024-12-06 01:54:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 298 transitions. [2024-12-06 01:54:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 01:54:42,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 144 states and 303 transitions. [2024-12-06 01:54:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 303 transitions. [2024-12-06 01:54:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 01:54:44,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 145 states and 305 transitions. [2024-12-06 01:54:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 305 transitions. [2024-12-06 01:54:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:54:45,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 164 states and 342 transitions. [2024-12-06 01:54:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 342 transitions. [2024-12-06 01:54:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:54:52,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 167 states and 350 transitions. [2024-12-06 01:54:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 350 transitions. [2024-12-06 01:54:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:54:55,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 182 states and 375 transitions. [2024-12-06 01:55:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 375 transitions. [2024-12-06 01:55:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:55:00,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 183 states and 377 transitions. [2024-12-06 01:55:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 377 transitions. [2024-12-06 01:55:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:55:02,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 188 states and 393 transitions. [2024-12-06 01:55:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 393 transitions. [2024-12-06 01:55:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:55:06,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 189 states and 397 transitions. [2024-12-06 01:55:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 397 transitions. [2024-12-06 01:55:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:55:08,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 190 states and 399 transitions. [2024-12-06 01:55:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 399 transitions. [2024-12-06 01:55:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 01:55:10,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 198 states and 416 transitions. [2024-12-06 01:55:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 416 transitions. [2024-12-06 01:55:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 01:55:14,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 203 states and 429 transitions. [2024-12-06 01:55:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 429 transitions. [2024-12-06 01:55:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 01:55:17,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:55:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 204 states and 430 transitions. [2024-12-06 01:55:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 430 transitions. [2024-12-06 01:55:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 01:55:17,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 207 states and 436 transitions. [2024-12-06 01:55:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 436 transitions. [2024-12-06 01:55:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 01:55:22,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 216 states and 456 transitions. [2024-12-06 01:55:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 456 transitions. [2024-12-06 01:55:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 01:55:28,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 215 states and 444 transitions. [2024-12-06 01:55:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 444 transitions. [2024-12-06 01:55:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 01:55:31,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 230 states and 501 transitions. [2024-12-06 01:55:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 501 transitions. [2024-12-06 01:55:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 01:55:41,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:55:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 244 states and 567 transitions. [2024-12-06 01:55:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 567 transitions. [2024-12-06 01:55:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 01:55:53,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 258 states and 627 transitions. [2024-12-06 01:56:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 627 transitions. [2024-12-06 01:56:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:06,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 270 states and 659 transitions. [2024-12-06 01:56:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 659 transitions. [2024-12-06 01:56:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:15,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 282 states and 689 transitions. [2024-12-06 01:56:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 689 transitions. [2024-12-06 01:56:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:31,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 283 states and 699 transitions. [2024-12-06 01:56:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 699 transitions. [2024-12-06 01:56:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:35,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 288 states and 706 transitions. [2024-12-06 01:56:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 706 transitions. [2024-12-06 01:56:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:41,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 289 states and 710 transitions. [2024-12-06 01:56:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 710 transitions. [2024-12-06 01:56:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:43,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 295 states and 726 transitions. [2024-12-06 01:56:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 726 transitions. [2024-12-06 01:56:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:56:52,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:56:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 296 states and 727 transitions. [2024-12-06 01:56:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 727 transitions. [2024-12-06 01:56:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:56:54,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 310 states and 757 transitions. [2024-12-06 01:57:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 757 transitions. [2024-12-06 01:57:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:57:03,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:03,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 318 states and 770 transitions. [2024-12-06 01:57:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 770 transitions. [2024-12-06 01:57:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:57:13,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 319 states and 779 transitions. [2024-12-06 01:57:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 779 transitions. [2024-12-06 01:57:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:57:15,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:15,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 320 states and 780 transitions. [2024-12-06 01:57:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 780 transitions. [2024-12-06 01:57:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:57:17,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 334 states and 816 transitions. [2024-12-06 01:57:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 816 transitions. [2024-12-06 01:57:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:57:29,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 342 states and 837 transitions. [2024-12-06 01:57:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 837 transitions. [2024-12-06 01:57:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:57:41,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 343 states and 845 transitions. [2024-12-06 01:57:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 845 transitions. [2024-12-06 01:57:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:57:43,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 348 states and 858 transitions. [2024-12-06 01:57:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 858 transitions. [2024-12-06 01:57:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:57:48,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:48,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:57:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:57:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 350 states and 869 transitions. [2024-12-06 01:57:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 869 transitions. [2024-12-06 01:57:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:57:52,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:57:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:57:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:57:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:58:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:58:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 359 states and 886 transitions. [2024-12-06 01:58:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 886 transitions. [2024-12-06 01:58:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:58:01,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:58:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:58:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:58:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:58:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:58:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 366 states and 914 transitions. [2024-12-06 01:58:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 914 transitions. [2024-12-06 01:58:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:58:13,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:58:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:58:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:58:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:58:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:58:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 373 states and 935 transitions. [2024-12-06 01:58:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 935 transitions. [2024-12-06 01:58:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:58:22,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:58:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:58:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:58:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:58:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:58:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 391 states and 991 transitions. [2024-12-06 01:58:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 991 transitions. [2024-12-06 01:58:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:58:44,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:58:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:58:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:58:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:58:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:58:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 395 states and 1006 transitions. [2024-12-06 01:58:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1006 transitions. [2024-12-06 01:58:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:58:49,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:58:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:58:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:58:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:58:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:58:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 398 states and 1012 transitions. [2024-12-06 01:58:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1012 transitions. [2024-12-06 01:58:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:58:53,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:58:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:58:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:58:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 403 states and 1028 transitions. [2024-12-06 01:59:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1028 transitions. [2024-12-06 01:59:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:59:00,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 406 states and 1046 transitions. [2024-12-06 01:59:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1046 transitions. [2024-12-06 01:59:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:59:05,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 408 states and 1058 transitions. [2024-12-06 01:59:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1058 transitions. [2024-12-06 01:59:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:07,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 415 states and 1091 transitions. [2024-12-06 01:59:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1091 transitions. [2024-12-06 01:59:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:22,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 422 states and 1104 transitions. [2024-12-06 01:59:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1104 transitions. [2024-12-06 01:59:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:33,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 426 states and 1119 transitions. [2024-12-06 01:59:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1119 transitions. [2024-12-06 01:59:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:38,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 427 states and 1120 transitions. [2024-12-06 01:59:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1120 transitions. [2024-12-06 01:59:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:42,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 430 states and 1135 transitions. [2024-12-06 01:59:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1135 transitions. [2024-12-06 01:59:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:46,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:59:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:59:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 434 states and 1149 transitions. [2024-12-06 01:59:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1149 transitions. [2024-12-06 01:59:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:59:51,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:59:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:59:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:59:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:00:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:00:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 439 states and 1157 transitions. [2024-12-06 02:00:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1157 transitions. [2024-12-06 02:00:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 02:00:02,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:00:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:00:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:00:03,206 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 02:00:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:00:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:00:04,211 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 02:00:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:00:04,670 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 69 iterations. [2024-12-06 02:00:04,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:00:04 ImpRootNode [2024-12-06 02:00:04,755 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:00:04,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:00:04,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:00:04,756 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:00:04,757 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:54:04" (3/4) ... [2024-12-06 02:00:04,758 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 02:00:04,869 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 178. [2024-12-06 02:00:04,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:00:04,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:00:04,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:00:04,967 INFO L158 Benchmark]: Toolchain (without parser) took 362401.57ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 116.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 959.5MB. Max. memory is 16.1GB. [2024-12-06 02:00:04,967 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:00:04,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.14ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 99.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 02:00:04,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.87ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 96.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:00:04,968 INFO L158 Benchmark]: Boogie Preprocessor took 25.46ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:00:04,968 INFO L158 Benchmark]: RCFGBuilder took 1118.43ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 58.0MB in the end (delta: 36.5MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-12-06 02:00:04,969 INFO L158 Benchmark]: CodeCheck took 360719.28ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 57.2MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 876.5MB. Max. memory is 16.1GB. [2024-12-06 02:00:04,969 INFO L158 Benchmark]: Witness Printer took 210.36ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 02:00:04,971 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: 360.6s, OverallIterations: 69, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36114 SdHoareTripleChecker+Valid, 202.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33854 mSDsluCounter, 13960 SdHoareTripleChecker+Invalid, 181.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12842 mSDsCounter, 14088 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111828 IncrementalHoareTripleChecker+Invalid, 125916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14088 mSolverCounterUnsat, 1118 mSDtfsCounter, 111828 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21977 GetRequests, 19450 SyntacticMatches, 957 SemanticMatches, 1570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487028 ImplicationChecksByTransitivity, 276.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 96.9s InterpolantComputationTime, 2041 NumberOfCodeBlocks, 2041 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1925 ConstructedInterpolants, 0 QuantifiedInterpolants, 19940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 11 PerfectInterpolantSequences, 230/1218 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 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 TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND TRUE \read(r311) [L297] COND TRUE \read(ep12) [L298] 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=1, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, 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 TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [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 TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=2, id2=0, id3=127, m1=126, m2=-2, m3=1, max1=2, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, 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 TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [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 TRUE (int )m2 > (int )max2 [L124] max2 = m2 [L127] COND FALSE !(\read(ep32)) [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 TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, i2=2, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, 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 TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [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 TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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=1, ep21=0, ep23=1, ep31=1, ep32=0, i2=3, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=127, 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 TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [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 TRUE (int )m2 > (int )max2 [L124] max2 = m2 [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND FALSE !((int )max2 == (int )id2) [L138] nl2 = (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 TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [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 TRUE (int )max3 == (int )id3 [L179] st3 = (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=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L555] reach_error() VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.14ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 99.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.87ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 96.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.46ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1118.43ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 58.0MB in the end (delta: 36.5MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * CodeCheck took 360719.28ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 57.2MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 876.5MB. Max. memory is 16.1GB. * Witness Printer took 210.36ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 02:00:04,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92b3fda9-5709-432b-a625-4c85cc1ddc2b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE