./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:37:41,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:37:41,588 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:37:41,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:37:41,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:37:41,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:37:41,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:37:41,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:37:41,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:37:41,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:37:41,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:37:41,626 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:37:41,626 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:37:41,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:37:41,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:37:41,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:37:41,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:37:41,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:37:41,630 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:37:41,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:37:41,630 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_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2024-11-25 03:37:41,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:37:41,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:37:41,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:37:41,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:37:41,939 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:37:41,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-11-25 03:37:44,857 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/data/a88d25245/15006b435d044d368835e2be92025325/FLAGd1b88bbb7 [2024-11-25 03:37:45,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:37:45,172 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-11-25 03:37:45,185 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/data/a88d25245/15006b435d044d368835e2be92025325/FLAGd1b88bbb7 [2024-11-25 03:37:45,429 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/data/a88d25245/15006b435d044d368835e2be92025325 [2024-11-25 03:37:45,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:37:45,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:37:45,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:37:45,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:37:45,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:37:45,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386efbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45, skipping insertion in model container [2024-11-25 03:37:45,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:37:45,798 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_9d9e995f-9d08-4292-a420-c07c253111f7/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-25 03:37:45,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:37:45,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:37:45,872 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_9d9e995f-9d08-4292-a420-c07c253111f7/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-25 03:37:45,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:37:45,889 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:37:45,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45 WrapperNode [2024-11-25 03:37:45,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:37:45,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:37:45,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:37:45,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:37:45,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,944 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 453 [2024-11-25 03:37:45,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:37:45,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:37:45,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:37:45,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:37:45,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:45,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:46,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:46,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:46,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:37:46,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:37:46,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:37:46,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:37:46,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:45" (1/1) ... [2024-11-25 03:37:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:37:46,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:37:46,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:37:46,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:37:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:37:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:37:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:37:46,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:37:46,211 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:37:46,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:37:47,050 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-25 03:37:47,050 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:37:47,995 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:37:47,995 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:37:47,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:47 BoogieIcfgContainer [2024-11-25 03:37:47,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:37:47,996 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:37:47,996 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:37:48,006 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:37:48,006 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:47" (1/1) ... [2024-11-25 03:37:48,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:37:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-25 03:37:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-25 03:37:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 03:37:48,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:37:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-25 03:37:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-25 03:37:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 03:37:51,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:37:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-25 03:37:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-25 03:37:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:37:52,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:37:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-25 03:37:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-25 03:37:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:37:54,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:37:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-25 03:37:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-25 03:37:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:37:56,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:37:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-25 03:37:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-25 03:37:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 03:37:58,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-25 03:38:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-25 03:38:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:38:00,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-25 03:38:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-25 03:38:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:38:01,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-25 03:38:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-25 03:38:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:38:01,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-25 03:38:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-25 03:38:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 03:38:04,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-25 03:38:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-25 03:38:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 03:38:05,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2024-11-25 03:38:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-25 03:38:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 03:38:11,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 83 states and 150 transitions. [2024-11-25 03:38:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2024-11-25 03:38:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:38:14,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 91 states and 182 transitions. [2024-11-25 03:38:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 182 transitions. [2024-11-25 03:38:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:38:18,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 92 states and 184 transitions. [2024-11-25 03:38:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 184 transitions. [2024-11-25 03:38:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:38:21,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 101 states and 207 transitions. [2024-11-25 03:38:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 207 transitions. [2024-11-25 03:38:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:38:25,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 106 states and 229 transitions. [2024-11-25 03:38:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 229 transitions. [2024-11-25 03:38:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:38:30,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 107 states and 231 transitions. [2024-11-25 03:38:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 231 transitions. [2024-11-25 03:38:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:38:31,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 108 states and 234 transitions. [2024-11-25 03:38:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 234 transitions. [2024-11-25 03:38:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 03:38:33,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 128 states and 278 transitions. [2024-11-25 03:38:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 278 transitions. [2024-11-25 03:38:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 03:38:42,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 136 states and 295 transitions. [2024-11-25 03:38:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 295 transitions. [2024-11-25 03:38:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 03:38:48,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 148 states and 320 transitions. [2024-11-25 03:38:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 320 transitions. [2024-11-25 03:38:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:38:57,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:38:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 145 states and 307 transitions. [2024-11-25 03:38:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 307 transitions. [2024-11-25 03:38:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 03:38:59,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:59,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 160 states and 354 transitions. [2024-11-25 03:39:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 354 transitions. [2024-11-25 03:39:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 03:39:12,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 174 states and 396 transitions. [2024-11-25 03:39:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 396 transitions. [2024-11-25 03:39:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:39:24,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 186 states and 431 transitions. [2024-11-25 03:39:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 431 transitions. [2024-11-25 03:39:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:39:36,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 195 states and 445 transitions. [2024-11-25 03:39:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 445 transitions. [2024-11-25 03:39:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:39:42,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:42,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 207 states and 475 transitions. [2024-11-25 03:39:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2024-11-25 03:39:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:39:53,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 208 states and 477 transitions. [2024-11-25 03:39:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 477 transitions. [2024-11-25 03:39:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:39:54,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:39:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:39:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 209 states and 479 transitions. [2024-11-25 03:39:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 479 transitions. [2024-11-25 03:39:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 03:39:56,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:39:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:39:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:39:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:40:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:40:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 225 states and 520 transitions. [2024-11-25 03:40:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 520 transitions. [2024-11-25 03:40:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 03:40:09,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:40:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:40:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:40:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:40:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:40:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 235 states and 543 transitions. [2024-11-25 03:40:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 543 transitions. [2024-11-25 03:40:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 03:40:18,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:40:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:40:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:40:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:40:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:40:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 238 states and 554 transitions. [2024-11-25 03:40:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 554 transitions. [2024-11-25 03:40:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:40:21,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:40:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:40:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:40:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:40:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:40:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 251 states and 587 transitions. [2024-11-25 03:40:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 587 transitions. [2024-11-25 03:40:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:40:39,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:40:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:40:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:40:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:40:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:40:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 260 states and 605 transitions. [2024-11-25 03:40:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 605 transitions. [2024-11-25 03:40:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:40:54,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:40:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:40:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:40:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 263 states and 610 transitions. [2024-11-25 03:41:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 610 transitions. [2024-11-25 03:41:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:41:00,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:41:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 265 states and 623 transitions. [2024-11-25 03:41:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 623 transitions. [2024-11-25 03:41:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:41:04,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:41:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 270 states and 633 transitions. [2024-11-25 03:41:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 633 transitions. [2024-11-25 03:41:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:41:14,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:41:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 271 states and 639 transitions. [2024-11-25 03:41:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 639 transitions. [2024-11-25 03:41:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:41:17,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:41:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 281 states and 653 transitions. [2024-11-25 03:41:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 653 transitions. [2024-11-25 03:41:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:41:32,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:41:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 289 states and 680 transitions. [2024-11-25 03:41:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 680 transitions. [2024-11-25 03:41:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:41:49,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:41:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:41:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:41:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 294 states and 692 transitions. [2024-11-25 03:41:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 692 transitions. [2024-11-25 03:41:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:41:58,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:41:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:41:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 301 states and 718 transitions. [2024-11-25 03:42:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 718 transitions. [2024-11-25 03:42:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:42:11,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 303 states and 721 transitions. [2024-11-25 03:42:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 721 transitions. [2024-11-25 03:42:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:42:15,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 306 states and 730 transitions. [2024-11-25 03:42:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 730 transitions. [2024-11-25 03:42:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:42:21,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 307 states and 733 transitions. [2024-11-25 03:42:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 733 transitions. [2024-11-25 03:42:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:42:25,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 308 states and 734 transitions. [2024-11-25 03:42:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 734 transitions. [2024-11-25 03:42:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:42:28,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 309 states and 735 transitions. [2024-11-25 03:42:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 735 transitions. [2024-11-25 03:42:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:42:31,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:42:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 315 states and 752 transitions. [2024-11-25 03:42:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 752 transitions. [2024-11-25 03:42:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:42:43,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 327 states and 790 transitions. [2024-11-25 03:43:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 790 transitions. [2024-11-25 03:43:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:43:00,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 328 states and 796 transitions. [2024-11-25 03:43:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 796 transitions. [2024-11-25 03:43:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:43:03,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:03,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 329 states and 801 transitions. [2024-11-25 03:43:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 801 transitions. [2024-11-25 03:43:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:43:09,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 333 states and 817 transitions. [2024-11-25 03:43:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 817 transitions. [2024-11-25 03:43:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:43:17,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 335 states and 820 transitions. [2024-11-25 03:43:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 820 transitions. [2024-11-25 03:43:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 03:43:21,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 346 states and 851 transitions. [2024-11-25 03:43:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 851 transitions. [2024-11-25 03:43:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:43:33,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:43:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 357 states and 887 transitions. [2024-11-25 03:43:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 887 transitions. [2024-11-25 03:43:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:43:58,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:44:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 362 states and 911 transitions. [2024-11-25 03:44:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 911 transitions. [2024-11-25 03:44:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:44:22,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:44:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 364 states and 919 transitions. [2024-11-25 03:44:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 919 transitions. [2024-11-25 03:44:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:44:29,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:44:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 365 states and 921 transitions. [2024-11-25 03:44:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 921 transitions. [2024-11-25 03:44:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:44:32,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:44:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 367 states and 933 transitions. [2024-11-25 03:44:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 933 transitions. [2024-11-25 03:44:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:44:44,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:45:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:45:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 372 states and 938 transitions. [2024-11-25 03:45:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 938 transitions. [2024-11-25 03:45:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 03:45:00,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:45:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:45:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:45:00,713 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:45:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:45:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:45:02,230 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:45:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:45:02,729 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 61 iterations. [2024-11-25 03:45:02,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:45:02 ImpRootNode [2024-11-25 03:45:02,862 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:45:02,863 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:45:02,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:45:02,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:45:02,864 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:47" (3/4) ... [2024-11-25 03:45:02,867 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 03:45:03,063 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 180. [2024-11-25 03:45:03,244 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:45:03,246 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:45:03,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:45:03,247 INFO L158 Benchmark]: Toolchain (without parser) took 437814.37ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 92.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-25 03:45:03,248 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:45:03,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.40ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 74.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 03:45:03,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 71.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:45:03,249 INFO L158 Benchmark]: Boogie Preprocessor took 71.70ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 69.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:45:03,249 INFO L158 Benchmark]: RCFGBuilder took 1977.94ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 52.1MB in the end (delta: 17.3MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-11-25 03:45:03,250 INFO L158 Benchmark]: CodeCheck took 434866.16ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 52.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-25 03:45:03,251 INFO L158 Benchmark]: Witness Printer took 383.28ms. Allocated memory is still 3.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:45:03,253 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: 434.7s, OverallIterations: 61, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30458 SdHoareTripleChecker+Valid, 213.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28411 mSDsluCounter, 11099 SdHoareTripleChecker+Invalid, 194.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10117 mSDsCounter, 11042 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88584 IncrementalHoareTripleChecker+Invalid, 99626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11042 mSolverCounterUnsat, 982 mSDtfsCounter, 88584 mSolverCounterSat, 1.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19195 GetRequests, 16794 SyntacticMatches, 997 SemanticMatches, 1404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267596 ImplicationChecksByTransitivity, 336.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 124.8s InterpolantComputationTime, 1898 NumberOfCodeBlocks, 1898 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1790 ConstructedInterpolants, 0 QuantifiedInterpolants, 17859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 10 PerfectInterpolantSequences, 216/1242 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: 567]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND TRUE \read(r131) [L255] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND TRUE \read(r211) [L268] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND TRUE \read(r211) [L284] COND TRUE \read(ep13) [L285] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND TRUE \read(r311) [L310] COND TRUE \read(ep12) [L311] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, 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] [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 1 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND TRUE \read(ep13) [L112] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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 TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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 FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=1, m2=0, m3=-2, max1=0, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L554] RET assert(c1) [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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 TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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 FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, 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] [L554] RET assert(c1) [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND FALSE !((int )r1 < 1) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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 TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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 FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=0, m3=0, max1=127, max2=1, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, 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] [L554] RET assert(c1) [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L567] reach_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.40ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 74.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 71.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.70ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 69.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1977.94ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 52.1MB in the end (delta: 17.3MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * CodeCheck took 434866.16ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 52.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 383.28ms. Allocated memory is still 3.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 03:45:03,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d9e995f-9d08-4292-a420-c07c253111f7/bin/ukojak-verify-ENZ3QT5qd3/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