./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:39:27,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:39:27,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:39:27,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:39:27,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:39:27,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:39:27,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:39:27,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:39:27,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:39:27,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:39:27,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:39:27,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:39:27,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:39:27,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:39:27,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:39:27,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:39:27,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:39:27,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:39:27,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:39:27,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:39:27,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:39:27,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:39:27,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:39:27,957 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:39:27,957 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:39:27,957 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:39:27,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:39:27,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:39:27,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:39:27,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:39:27,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:39:27,959 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:39:27,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:39:27,959 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_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d [2024-11-13 21:39:28,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:39:28,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:39:28,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:39:28,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:39:28,315 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:39:28,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-13 21:39:30,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:39:30,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:39:30,879 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-13 21:39:30,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/data/9c53fd502/0076eb16663042e1b793e2d89d5c2e47/FLAGb3ecdec99 [2024-11-13 21:39:30,923 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/data/9c53fd502/0076eb16663042e1b793e2d89d5c2e47 [2024-11-13 21:39:30,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:39:30,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:39:30,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:39:30,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:39:30,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:39:30,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:39:30" (1/1) ... [2024-11-13 21:39:30,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27088a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:30, skipping insertion in model container [2024-11-13 21:39:30,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:39:30" (1/1) ... [2024-11-13 21:39:30,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:39:31,304 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_cdd7a078-538d-4a27-a08a-21914c733ae8/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-13 21:39:31,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:39:31,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:39:31,438 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_cdd7a078-538d-4a27-a08a-21914c733ae8/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-13 21:39:31,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:39:31,469 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:39:31,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31 WrapperNode [2024-11-13 21:39:31,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:39:31,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:39:31,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:39:31,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:39:31,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,556 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-13 21:39:31,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:39:31,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:39:31,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:39:31,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:39:31,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:39:31,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:39:31,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:39:31,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:39:31,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:39:31" (1/1) ... [2024-11-13 21:39:31,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:39:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:39:31,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:39:31,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:39:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:39:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:39:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:39:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:39:31,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:39:31,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:39:32,781 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-13 21:39:32,781 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:39:33,662 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:39:33,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:39:33,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:39:33 BoogieIcfgContainer [2024-11-13 21:39:33,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:39:33,666 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:39:33,666 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:39:33,680 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:39:33,680 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:39:33" (1/1) ... [2024-11-13 21:39:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:39:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:39:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:39:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:39:33,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-11-13 21:39:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-11-13 21:39:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:39:37,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-11-13 21:39:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-11-13 21:39:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:39:39,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-11-13 21:39:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-11-13 21:39:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:39:41,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-11-13 21:39:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-11-13 21:39:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:39:43,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 38 states and 70 transitions. [2024-11-13 21:39:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 70 transitions. [2024-11-13 21:39:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:39:46,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 44 states and 83 transitions. [2024-11-13 21:39:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 83 transitions. [2024-11-13 21:39:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:39:48,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 45 states and 83 transitions. [2024-11-13 21:39:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2024-11-13 21:39:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:39:49,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 46 states and 84 transitions. [2024-11-13 21:39:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2024-11-13 21:39:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:39:49,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-13 21:39:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-13 21:39:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:39:53,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:39:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:39:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 59 states and 108 transitions. [2024-11-13 21:39:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 108 transitions. [2024-11-13 21:39:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:39:54,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:39:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:39:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:39:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 75 states and 139 transitions. [2024-11-13 21:40:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 139 transitions. [2024-11-13 21:40:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:40:02,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 87 states and 170 transitions. [2024-11-13 21:40:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 170 transitions. [2024-11-13 21:40:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:40:08,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 100 states and 201 transitions. [2024-11-13 21:40:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 201 transitions. [2024-11-13 21:40:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:40:15,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 102 states and 206 transitions. [2024-11-13 21:40:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 206 transitions. [2024-11-13 21:40:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:40:18,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 103 states and 210 transitions. [2024-11-13 21:40:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 210 transitions. [2024-11-13 21:40:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:40:20,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 110 states and 234 transitions. [2024-11-13 21:40:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 234 transitions. [2024-11-13 21:40:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:40:26,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:26,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 111 states and 239 transitions. [2024-11-13 21:40:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 239 transitions. [2024-11-13 21:40:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:40:28,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 114 states and 249 transitions. [2024-11-13 21:40:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 249 transitions. [2024-11-13 21:40:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:40:31,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 119 states and 269 transitions. [2024-11-13 21:40:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 269 transitions. [2024-11-13 21:40:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:40:36,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 134 states and 295 transitions. [2024-11-13 21:40:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 295 transitions. [2024-11-13 21:40:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:40:41,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 154 states and 342 transitions. [2024-11-13 21:40:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 342 transitions. [2024-11-13 21:40:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:40:51,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:51,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:40:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:40:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 159 states and 355 transitions. [2024-11-13 21:40:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 355 transitions. [2024-11-13 21:40:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:40:55,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:40:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:40:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:40:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 164 states and 365 transitions. [2024-11-13 21:41:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 365 transitions. [2024-11-13 21:41:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:41:00,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:00,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 178 states and 416 transitions. [2024-11-13 21:41:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 416 transitions. [2024-11-13 21:41:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:41:13,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 192 states and 467 transitions. [2024-11-13 21:41:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 467 transitions. [2024-11-13 21:41:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:41:25,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 204 states and 492 transitions. [2024-11-13 21:41:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 492 transitions. [2024-11-13 21:41:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:41:36,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 215 states and 510 transitions. [2024-11-13 21:41:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 510 transitions. [2024-11-13 21:41:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:41:47,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 216 states and 513 transitions. [2024-11-13 21:41:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 513 transitions. [2024-11-13 21:41:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:41:50,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 230 states and 540 transitions. [2024-11-13 21:41:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 540 transitions. [2024-11-13 21:41:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:41:59,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 241 states and 557 transitions. [2024-11-13 21:42:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 557 transitions. [2024-11-13 21:42:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:42:08,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:08,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 253 states and 583 transitions. [2024-11-13 21:42:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 583 transitions. [2024-11-13 21:42:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:42:20,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:20,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:23,863 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-13 21:42:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 263 states and 599 transitions. [2024-11-13 21:42:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 599 transitions. [2024-11-13 21:42:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:42:31,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:34,541 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-13 21:42:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 266 states and 612 transitions. [2024-11-13 21:42:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 612 transitions. [2024-11-13 21:42:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:42:38,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 267 states and 616 transitions. [2024-11-13 21:42:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 616 transitions. [2024-11-13 21:42:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:42:41,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 268 states and 616 transitions. [2024-11-13 21:42:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 616 transitions. [2024-11-13 21:42:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:42:43,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 269 states and 620 transitions. [2024-11-13 21:42:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 620 transitions. [2024-11-13 21:42:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:42:45,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 280 states and 652 transitions. [2024-11-13 21:42:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 652 transitions. [2024-11-13 21:42:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:42:58,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 286 states and 667 transitions. [2024-11-13 21:43:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 667 transitions. [2024-11-13 21:43:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:43:02,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 292 states and 689 transitions. [2024-11-13 21:43:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 689 transitions. [2024-11-13 21:43:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:43:13,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 293 states and 689 transitions. [2024-11-13 21:43:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 689 transitions. [2024-11-13 21:43:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:43:15,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 304 states and 709 transitions. [2024-11-13 21:43:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 709 transitions. [2024-11-13 21:43:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:43:32,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:32,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 305 states and 714 transitions. [2024-11-13 21:43:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 714 transitions. [2024-11-13 21:43:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:43:36,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 313 states and 734 transitions. [2024-11-13 21:43:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 734 transitions. [2024-11-13 21:43:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:43:51,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:44:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 320 states and 764 transitions. [2024-11-13 21:44:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 764 transitions. [2024-11-13 21:44:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:44:04,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:44:08,563 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-13 21:44:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 326 states and 789 transitions. [2024-11-13 21:44:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 789 transitions. [2024-11-13 21:44:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:44:20,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:44:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:44:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 328 states and 793 transitions. [2024-11-13 21:44:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 793 transitions. [2024-11-13 21:44:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:44:27,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:44:30,139 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-13 21:44:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 340 states and 821 transitions. [2024-11-13 21:44:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 821 transitions. [2024-11-13 21:44:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:44:43,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:44:48,748 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-13 21:45:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:45:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 347 states and 842 transitions. [2024-11-13 21:45:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 842 transitions. [2024-11-13 21:45:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:45:01,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:45:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:45:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:45:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:45:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:45:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 354 states and 864 transitions. [2024-11-13 21:45:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 864 transitions. [2024-11-13 21:45:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:45:12,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:45:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:45:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:45:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:45:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:45:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 355 states and 869 transitions. [2024-11-13 21:45:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 869 transitions. [2024-11-13 21:45:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:45:15,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:45:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:45:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:45:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:45:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:45:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 378 states and 918 transitions. [2024-11-13 21:45:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 918 transitions. [2024-11-13 21:45:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:45:41,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:45:41,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:45:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:45:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:45:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:45:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 383 states and 930 transitions. [2024-11-13 21:45:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 930 transitions. [2024-11-13 21:45:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:45:51,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:45:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:45:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:45:54,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-13 21:45:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:45:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 386 states and 936 transitions. [2024-11-13 21:45:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 936 transitions. [2024-11-13 21:45:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:45:59,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:45:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:46:01,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:46:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:46:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:46:02,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:46:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:46:03,399 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 54 iterations. [2024-11-13 21:46:03,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:46:03 ImpRootNode [2024-11-13 21:46:03,771 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:46:03,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:46:03,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:46:03,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:46:03,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:39:33" (3/4) ... [2024-11-13 21:46:03,777 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:46:03,995 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:46:03,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:46:03,996 INFO L158 Benchmark]: Toolchain (without parser) took 393065.18ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 92.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 283.9MB. Max. memory is 16.1GB. [2024-11-13 21:46:03,996 INFO L158 Benchmark]: CDTParser took 1.23ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:46:03,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.93ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:46:03,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.37ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:46:03,998 INFO L158 Benchmark]: Boogie Preprocessor took 41.49ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 69.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:46:03,998 INFO L158 Benchmark]: RCFGBuilder took 2065.01ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 52.7MB in the end (delta: 17.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-11-13 21:46:03,999 INFO L158 Benchmark]: CodeCheck took 390105.24ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 52.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 788.9MB. Max. memory is 16.1GB. [2024-11-13 21:46:04,000 INFO L158 Benchmark]: Witness Printer took 223.40ms. Allocated memory is still 2.7GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:46:04,001 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: 389.7s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23428 SdHoareTripleChecker+Valid, 185.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21639 mSDsluCounter, 7580 SdHoareTripleChecker+Invalid, 165.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6717 mSDsCounter, 8437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70013 IncrementalHoareTripleChecker+Invalid, 78450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8437 mSolverCounterUnsat, 863 mSDtfsCounter, 70013 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17400 GetRequests, 15320 SyntacticMatches, 730 SemanticMatches, 1350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100772 ImplicationChecksByTransitivity, 289.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 114.7s InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1579 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1478 ConstructedInterpolants, 0 QuantifiedInterpolants, 13835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 10 PerfectInterpolantSequences, 169/950 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND FALSE !(\read(r231)) [L300] COND TRUE \read(r211) [L301] COND TRUE \read(ep13) [L302] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, i2=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] 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=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] 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=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] 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=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, i2=1, id1=0, id2=127, id3=126, m1=-1, m2=1, m3=-2, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L89] newmax = (_Bool)1 [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, i2=2, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND FALSE !(\read(newmax2)) [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, i2=3, id1=0, id2=127, id3=126, m1=126, m2=0, m3=0, max1=127, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND TRUE (int )m3 > (int )max3 [L190] max3 = m3 [L191] newmax = (_Bool)1 [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND FALSE !((int )max3 == (int )id3) [L207] nl3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L600] reach_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=127, id3=126, m1=-1, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.93ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.37ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.49ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 69.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2065.01ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 52.7MB in the end (delta: 17.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * CodeCheck took 390105.24ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 52.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 788.9MB. Max. memory is 16.1GB. * Witness Printer took 223.40ms. Allocated memory is still 2.7GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:46:04,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdd7a078-538d-4a27-a08a-21914c733ae8/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE