./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk --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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:31:34,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:31:35,056 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:31:35,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:31:35,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:31:35,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:31:35,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:31:35,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:31:35,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:31:35,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:31:35,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:31:35,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:31:35,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:31:35,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:31:35,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:31:35,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:31:35,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:31:35,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:31:35,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:31:35,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:31:35,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:31:35,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:31:35,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:31:35,111 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:31:35,112 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:31:35,112 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:31:35,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:31:35,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:31:35,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:31:35,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:31:35,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:31:35,116 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:31:35,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:31:35,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk 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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2024-11-08 23:31:35,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:31:35,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:31:35,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:31:35,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:31:35,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:31:35,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 23:31:37,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:31:37,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:31:37,722 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-08 23:31:37,741 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/data/997c2ee62/bb2d586522d6433a87b384ee080e9abc/FLAG88a320210 [2024-11-08 23:31:37,763 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/data/997c2ee62/bb2d586522d6433a87b384ee080e9abc [2024-11-08 23:31:37,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:31:37,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:31:37,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:31:37,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:31:37,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:31:37,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:31:37" (1/1) ... [2024-11-08 23:31:37,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a74103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:37, skipping insertion in model container [2024-11-08 23:31:37,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:31:37" (1/1) ... [2024-11-08 23:31:37,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:31:38,131 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_4ae92045-44c2-48c4-9d65-b933d96c0aeb/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2024-11-08 23:31:38,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:31:38,156 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:31:38,221 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_4ae92045-44c2-48c4-9d65-b933d96c0aeb/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2024-11-08 23:31:38,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:31:38,246 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:31:38,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38 WrapperNode [2024-11-08 23:31:38,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:31:38,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:31:38,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:31:38,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:31:38,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,309 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2024-11-08 23:31:38,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:31:38,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:31:38,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:31:38,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:31:38,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:31:38,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:31:38,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:31:38,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:31:38,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:38" (1/1) ... [2024-11-08 23:31:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:31:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:31:38,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:31:38,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:31:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:31:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:31:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:31:38,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:31:38,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:31:38,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:31:39,181 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-08 23:31:39,181 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:31:39,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:31:39,900 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 23:31:39,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:39 BoogieIcfgContainer [2024-11-08 23:31:39,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:31:39,902 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:31:39,902 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:31:39,913 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:31:39,914 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:39" (1/1) ... [2024-11-08 23:31:39,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:31:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2024-11-08 23:31:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2024-11-08 23:31:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:31:39,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:42,213 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-08 23:31:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 24 states and 39 transitions. [2024-11-08 23:31:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2024-11-08 23:31:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:31:42,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:43,413 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-08 23:31:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 48 transitions. [2024-11-08 23:31:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-08 23:31:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:31:43,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:44,564 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-08 23:31:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 33 states and 59 transitions. [2024-11-08 23:31:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2024-11-08 23:31:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:31:45,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:45,941 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-08 23:31:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2024-11-08 23:31:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2024-11-08 23:31:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:31:46,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:46,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:47,673 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-08 23:31:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2024-11-08 23:31:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2024-11-08 23:31:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:31:48,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 54 states and 101 transitions. [2024-11-08 23:31:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2024-11-08 23:31:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:31:50,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:50,708 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-08 23:31:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 55 states and 101 transitions. [2024-11-08 23:31:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 101 transitions. [2024-11-08 23:31:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:31:50,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:51,024 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-08 23:31:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-08 23:31:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-08 23:31:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:31:51,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:52,077 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-08 23:31:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 67 states and 121 transitions. [2024-11-08 23:31:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 121 transitions. [2024-11-08 23:31:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:31:53,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:54,141 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-08 23:31:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 70 states and 126 transitions. [2024-11-08 23:31:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 126 transitions. [2024-11-08 23:31:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:31:54,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:56,755 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-08 23:32:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 88 states and 165 transitions. [2024-11-08 23:32:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2024-11-08 23:32:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:32:00,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:02,468 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-08 23:32:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 107 states and 207 transitions. [2024-11-08 23:32:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 207 transitions. [2024-11-08 23:32:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:32:07,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:08,559 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-08 23:32:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 108 states and 208 transitions. [2024-11-08 23:32:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 208 transitions. [2024-11-08 23:32:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:32:08,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:10,493 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-08 23:32:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 128 states and 250 transitions. [2024-11-08 23:32:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 250 transitions. [2024-11-08 23:32:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:32:16,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:16,996 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-08 23:32:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 129 states and 251 transitions. [2024-11-08 23:32:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 251 transitions. [2024-11-08 23:32:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:32:17,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:18,288 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-08 23:32:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 130 states and 255 transitions. [2024-11-08 23:32:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 255 transitions. [2024-11-08 23:32:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:32:18,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 145 states and 286 transitions. [2024-11-08 23:32:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 286 transitions. [2024-11-08 23:32:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:32:24,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 148 states and 295 transitions. [2024-11-08 23:32:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 295 transitions. [2024-11-08 23:32:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:32:26,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 150 states and 300 transitions. [2024-11-08 23:32:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 300 transitions. [2024-11-08 23:32:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:32:28,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 170 states and 339 transitions. [2024-11-08 23:32:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 339 transitions. [2024-11-08 23:32:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:32:38,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 189 states and 377 transitions. [2024-11-08 23:32:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 377 transitions. [2024-11-08 23:32:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:32:47,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 205 states and 403 transitions. [2024-11-08 23:32:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 403 transitions. [2024-11-08 23:32:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:32:54,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:32:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:32:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 209 states and 411 transitions. [2024-11-08 23:32:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 411 transitions. [2024-11-08 23:32:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:32:59,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:32:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 225 states and 443 transitions. [2024-11-08 23:33:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 443 transitions. [2024-11-08 23:33:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:33:07,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 226 states and 446 transitions. [2024-11-08 23:33:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 446 transitions. [2024-11-08 23:33:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:33:10,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 228 states and 448 transitions. [2024-11-08 23:33:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 448 transitions. [2024-11-08 23:33:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:33:13,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 247 states and 483 transitions. [2024-11-08 23:33:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 483 transitions. [2024-11-08 23:33:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:33:21,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 252 states and 499 transitions. [2024-11-08 23:33:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 499 transitions. [2024-11-08 23:33:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:33:25,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 261 states and 523 transitions. [2024-11-08 23:33:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 523 transitions. [2024-11-08 23:33:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:33:34,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 276 states and 587 transitions. [2024-11-08 23:33:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 587 transitions. [2024-11-08 23:33:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:33:46,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:33:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 281 states and 599 transitions. [2024-11-08 23:33:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 599 transitions. [2024-11-08 23:33:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 23:33:55,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 294 states and 624 transitions. [2024-11-08 23:34:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 624 transitions. [2024-11-08 23:34:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 23:34:04,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 23:34:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 299 states and 632 transitions. [2024-11-08 23:34:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 632 transitions. [2024-11-08 23:34:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:34:09,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 315 states and 672 transitions. [2024-11-08 23:34:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 672 transitions. [2024-11-08 23:34:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:34:22,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 328 states and 705 transitions. [2024-11-08 23:34:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 705 transitions. [2024-11-08 23:34:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:34:34,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 343 states and 751 transitions. [2024-11-08 23:34:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 751 transitions. [2024-11-08 23:34:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:34:48,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:34:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 351 states and 770 transitions. [2024-11-08 23:34:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 770 transitions. [2024-11-08 23:34:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:34:58,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 353 states and 773 transitions. [2024-11-08 23:35:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 773 transitions. [2024-11-08 23:35:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:35:06,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 368 states and 812 transitions. [2024-11-08 23:35:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 812 transitions. [2024-11-08 23:35:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:35:22,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 371 states and 827 transitions. [2024-11-08 23:35:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 827 transitions. [2024-11-08 23:35:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:35:29,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 386 states and 861 transitions. [2024-11-08 23:35:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 861 transitions. [2024-11-08 23:35:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:35:45,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 396 states and 885 transitions. [2024-11-08 23:35:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 885 transitions. [2024-11-08 23:35:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:35:56,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:35:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 398 states and 889 transitions. [2024-11-08 23:35:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 889 transitions. [2024-11-08 23:35:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:35:59,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:36:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:36:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 402 states and 905 transitions. [2024-11-08 23:36:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 905 transitions. [2024-11-08 23:36:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:36:11,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:36:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:36:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:36:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 407 states and 913 transitions. [2024-11-08 23:36:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 913 transitions. [2024-11-08 23:36:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:36:17,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:36:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:36:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:36:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 413 states and 937 transitions. [2024-11-08 23:36:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 937 transitions. [2024-11-08 23:36:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:36:32,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:36:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:36:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:36:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 431 states and 971 transitions. [2024-11-08 23:36:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 971 transitions. [2024-11-08 23:36:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:36:43,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:36:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:36:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:36:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 433 states and 977 transitions. [2024-11-08 23:36:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 977 transitions. [2024-11-08 23:36:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:36:46,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:36:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:36:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:36:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 442 states and 1003 transitions. [2024-11-08 23:36:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1003 transitions. [2024-11-08 23:36:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:36:59,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:36:59,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 445 states and 1009 transitions. [2024-11-08 23:37:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1009 transitions. [2024-11-08 23:37:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:37:07,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 447 states and 1020 transitions. [2024-11-08 23:37:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1020 transitions. [2024-11-08 23:37:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:37:09,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:09,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 452 states and 1039 transitions. [2024-11-08 23:37:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1039 transitions. [2024-11-08 23:37:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:37:16,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 454 states and 1044 transitions. [2024-11-08 23:37:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1044 transitions. [2024-11-08 23:37:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:37:18,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 458 states and 1057 transitions. [2024-11-08 23:37:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1057 transitions. [2024-11-08 23:37:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:37:28,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 460 states and 1062 transitions. [2024-11-08 23:37:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1062 transitions. [2024-11-08 23:37:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:37:35,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 466 states and 1084 transitions. [2024-11-08 23:37:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1084 transitions. [2024-11-08 23:37:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:37:42,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:42,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 468 states and 1089 transitions. [2024-11-08 23:37:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1089 transitions. [2024-11-08 23:37:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:37:45,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:37:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:37:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:37:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 473 states and 1106 transitions. [2024-11-08 23:37:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1106 transitions. [2024-11-08 23:37:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 23:37:51,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:37:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:37:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:37:52,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:37:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:37:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:37:53,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:37:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:37:53,638 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 59 iterations. [2024-11-08 23:37:53,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:37:53 ImpRootNode [2024-11-08 23:37:53,791 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:37:53,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:37:53,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:37:53,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:37:53,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:39" (3/4) ... [2024-11-08 23:37:53,793 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:37:53,997 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:37:53,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:37:53,999 INFO L158 Benchmark]: Toolchain (without parser) took 376232.17ms. Allocated memory was 132.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 77.1MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 713.4MB. Max. memory is 16.1GB. [2024-11-08 23:37:53,999 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 132.1MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:37:53,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.01ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 77.0MB in the beginning and 143.0MB in the end (delta: -66.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-08 23:37:54,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 178.3MB. Free memory was 143.0MB in the beginning and 139.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:37:54,000 INFO L158 Benchmark]: Boogie Preprocessor took 42.43ms. Allocated memory is still 178.3MB. Free memory was 139.6MB in the beginning and 137.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:37:54,001 INFO L158 Benchmark]: RCFGBuilder took 1547.77ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.7MB in the beginning and 150.9MB in the end (delta: -14.1MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-08 23:37:54,001 INFO L158 Benchmark]: CodeCheck took 373889.58ms. Allocated memory was 213.9MB in the beginning and 4.5GB in the end (delta: 4.2GB). Free memory was 150.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 685.8MB. Max. memory is 16.1GB. [2024-11-08 23:37:54,001 INFO L158 Benchmark]: Witness Printer took 206.52ms. Allocated memory is still 4.5GB. Free memory was 3.7GB in the beginning and 3.7GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:37:54,004 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 373.7s, OverallIterations: 59, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31787 SdHoareTripleChecker+Valid, 207.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29823 mSDsluCounter, 20081 SdHoareTripleChecker+Invalid, 187.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14089 mSDsCounter, 10230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83824 IncrementalHoareTripleChecker+Invalid, 94054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10230 mSolverCounterUnsat, 5992 mSDtfsCounter, 83824 mSolverCounterSat, 1.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20495 GetRequests, 18272 SyntacticMatches, 875 SemanticMatches, 1348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094038 ImplicationChecksByTransitivity, 288.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 94.3s InterpolantComputationTime, 1856 NumberOfCodeBlocks, 1856 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1746 ConstructedInterpolants, 0 QuantifiedInterpolants, 17622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 10 PerfectInterpolantSequences, 212/1124 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: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L452] int c1 ; [L453] int i2 ; [L456] c1 = 0 [L457] ep12 = __VERIFIER_nondet_bool() [L458] ep13 = __VERIFIER_nondet_bool() [L459] ep21 = __VERIFIER_nondet_bool() [L460] ep23 = __VERIFIER_nondet_bool() [L461] ep31 = __VERIFIER_nondet_bool() [L462] ep32 = __VERIFIER_nondet_bool() [L463] id1 = __VERIFIER_nondet_char() [L464] r1 = __VERIFIER_nondet_char() [L465] st1 = __VERIFIER_nondet_char() [L466] nl1 = __VERIFIER_nondet_char() [L467] m1 = __VERIFIER_nondet_char() [L468] max1 = __VERIFIER_nondet_char() [L469] mode1 = __VERIFIER_nondet_bool() [L470] id2 = __VERIFIER_nondet_char() [L471] r2 = __VERIFIER_nondet_char() [L472] st2 = __VERIFIER_nondet_char() [L473] nl2 = __VERIFIER_nondet_char() [L474] m2 = __VERIFIER_nondet_char() [L475] max2 = __VERIFIER_nondet_char() [L476] mode2 = __VERIFIER_nondet_bool() [L477] id3 = __VERIFIER_nondet_char() [L478] r3 = __VERIFIER_nondet_char() [L479] st3 = __VERIFIER_nondet_char() [L480] nl3 = __VERIFIER_nondet_char() [L481] m3 = __VERIFIER_nondet_char() [L482] max3 = __VERIFIER_nondet_char() [L483] mode3 = __VERIFIER_nondet_bool() [L484] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND FALSE !(\read(ep32)) [L235] tmp = 0 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND FALSE !(\read(r231)) [L264] tmp___1 = 0 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND FALSE !(\read(r211)) [L277] tmp___2 = 0 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND FALSE !(\read(r321)) [L290] tmp___3 = 0 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND FALSE !(\read(r311)) [L303] tmp___4 = 0 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE (int )max1 == (int )id1 [L316] COND TRUE (int )max2 == (int )id2 [L317] COND TRUE (int )max3 == (int )id3 [L318] COND TRUE (int )st1 == 0 [L319] COND TRUE (int )st2 == 0 [L320] COND TRUE (int )st3 == 0 [L321] COND TRUE (int )nl1 == 0 [L322] COND TRUE (int )nl2 == 0 [L323] COND TRUE (int )nl3 == 0 [L324] COND TRUE (int )mode1 == 0 [L325] COND TRUE (int )mode2 == 0 [L326] COND TRUE (int )mode3 == 0 [L327] tmp___5 = 1 [L391] return (tmp___5); [L484] RET, EXPR init() [L484] i2 = init() [L485] COND FALSE !(!(i2)) [L486] p12_old = nomsg [L487] p12_new = nomsg [L488] p13_old = nomsg [L489] p13_new = nomsg [L490] p21_old = nomsg [L491] p21_new = nomsg [L492] p23_old = nomsg [L493] p23_new = nomsg [L494] p31_old = nomsg [L495] p31_new = nomsg [L496] p32_old = nomsg [L497] p32_new = nomsg [L498] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=1, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L499] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=1, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=2, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=2, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=3, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L499] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=3, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, 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] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L399] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L445] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L531] reach_error() VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=125, id2=124, id3=126, m1=126, m2=127, m3=125, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 132.1MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.01ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 77.0MB in the beginning and 143.0MB in the end (delta: -66.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 178.3MB. Free memory was 143.0MB in the beginning and 139.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.43ms. Allocated memory is still 178.3MB. Free memory was 139.6MB in the beginning and 137.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1547.77ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.7MB in the beginning and 150.9MB in the end (delta: -14.1MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * CodeCheck took 373889.58ms. Allocated memory was 213.9MB in the beginning and 4.5GB in the end (delta: 4.2GB). Free memory was 150.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 685.8MB. Max. memory is 16.1GB. * Witness Printer took 206.52ms. Allocated memory is still 4.5GB. Free memory was 3.7GB in the beginning and 3.7GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:37:54,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ae92045-44c2-48c4-9d65-b933d96c0aeb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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