./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/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_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/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_a7fc69f2-bdb2-4d18-a9f1-908651093e12/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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:58:43,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:58:43,309 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:58:43,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:58:43,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:58:43,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:58:43,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:58:43,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:58:43,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:58:43,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:58:43,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:58:43,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:58:43,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:58:43,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:58:43,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:58:43,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:58:43,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:58:43,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:58:43,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:58:43,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:58:43,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:58:43,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:58:43,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:58:43,375 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:58:43,375 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:58:43,376 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:58:43,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:58:43,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:58:43,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:58:43,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:58:43,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:58:43,378 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:58:43,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:58:43,379 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_a7fc69f2-bdb2-4d18-a9f1-908651093e12/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_a7fc69f2-bdb2-4d18-a9f1-908651093e12/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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2024-11-08 22:58:43,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:58:43,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:58:43,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:58:43,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:58:43,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:58:43,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 22:58:46,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:58:46,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:58:46,451 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-11-08 22:58:46,465 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/data/5a8b3d2fe/5c2382978b244a4fa14775a3b1da5a8d/FLAG7a994d096 [2024-11-08 22:58:46,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/data/5a8b3d2fe/5c2382978b244a4fa14775a3b1da5a8d [2024-11-08 22:58:46,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:58:46,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:58:46,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:46,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:58:46,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:58:46,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:46" (1/1) ... [2024-11-08 22:58:46,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7621bb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:46, skipping insertion in model container [2024-11-08 22:58:46,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:46" (1/1) ... [2024-11-08 22:58:46,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:58:47,002 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_a7fc69f2-bdb2-4d18-a9f1-908651093e12/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-11-08 22:58:47,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:47,036 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:58:47,160 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_a7fc69f2-bdb2-4d18-a9f1-908651093e12/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-11-08 22:58:47,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:47,198 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:58:47,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47 WrapperNode [2024-11-08 22:58:47,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:47,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:47,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:58:47,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:58:47,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,299 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 497 [2024-11-08 22:58:47,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:47,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:58:47,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:58:47,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:58:47,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:58:47,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:58:47,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:58:47,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:58:47,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:47" (1/1) ... [2024-11-08 22:58:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:58:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:58:47,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:58:47,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:58:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:58:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:58:47,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:58:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:58:47,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:58:47,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:58:48,775 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-08 22:58:48,775 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:58:49,764 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:58:49,766 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:58:49,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:49 BoogieIcfgContainer [2024-11-08 22:58:49,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:58:49,768 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:58:49,768 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:58:49,782 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:58:49,782 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:49" (1/1) ... [2024-11-08 22:58:49,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-08 22:58:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-08 22:58:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 22:58:49,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:53,748 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 22:58:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-08 22:58:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-08 22:58:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:58:53,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:55,881 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 22:58:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-08 22:58:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-08 22:58:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:58:56,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:58,046 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 22:58:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:58:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-08 22:58:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-08 22:58:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:58:58,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:58:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:00,318 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 22:59:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-08 22:59:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-08 22:59:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:59:01,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:03,258 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 22:59:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-08 22:59:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-08 22:59:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:59:03,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,525 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 22:59:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-08 22:59:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-08 22:59:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:59:07,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:07,502 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 22:59:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-08 22:59:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-08 22:59:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:59:08,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:08,210 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 22:59:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-08 22:59:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-08 22:59:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:59:08,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:10,107 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 22:59:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-08 22:59:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-08 22:59:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:59:12,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:13,232 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 22:59:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 58 states and 101 transitions. [2024-11-08 22:59:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2024-11-08 22:59:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 22:59:13,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:59:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 74 states and 132 transitions. [2024-11-08 22:59:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2024-11-08 22:59:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:59:23,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:25,624 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 22:59:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 88 states and 162 transitions. [2024-11-08 22:59:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 162 transitions. [2024-11-08 22:59:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:59:30,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:32,703 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 22:59:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 89 states and 164 transitions. [2024-11-08 22:59:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 164 transitions. [2024-11-08 22:59:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:59:33,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:35,027 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 22:59:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 103 states and 204 transitions. [2024-11-08 22:59:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 204 transitions. [2024-11-08 22:59:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:59:40,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:42,619 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 22:59:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 106 states and 213 transitions. [2024-11-08 22:59:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 213 transitions. [2024-11-08 22:59:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:59:44,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:45,672 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 22:59:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 107 states and 215 transitions. [2024-11-08 22:59:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 215 transitions. [2024-11-08 22:59:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:59:46,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:47,908 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 22:59:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:59:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 121 states and 243 transitions. [2024-11-08 22:59:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 243 transitions. [2024-11-08 22:59:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:59:54,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:59:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:56,209 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:00:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:00:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 126 states and 265 transitions. [2024-11-08 23:00:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 265 transitions. [2024-11-08 23:00:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:00:01,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:00:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:00:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:00:02,256 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:00:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:00:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 128 states and 270 transitions. [2024-11-08 23:00:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 270 transitions. [2024-11-08 23:00:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:00:03,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:00:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:00:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:00:04,949 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:00:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:00:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 129 states and 273 transitions. [2024-11-08 23:00:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 273 transitions. [2024-11-08 23:00:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:00:05,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:00:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:00:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:00:08,225 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:00:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:00:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 130 states and 284 transitions. [2024-11-08 23:00:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 284 transitions. [2024-11-08 23:00:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:00:09,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:00:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:00:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:00:11,302 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:00:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:00:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 131 states and 287 transitions. [2024-11-08 23:00:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 287 transitions. [2024-11-08 23:00:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:00:11,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:00:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:00:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:00:13,120 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:00:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:00:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 132 states and 289 transitions. [2024-11-08 23:00:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 289 transitions. [2024-11-08 23:00:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:00:14,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:00:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:00:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:00:14,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:00:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:00:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:00:15,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:00:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:00:15,600 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 24 iterations. [2024-11-08 23:00:15,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:00:15 ImpRootNode [2024-11-08 23:00:15,774 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:00:15,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:00:15,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:00:15,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:00:15,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:49" (3/4) ... [2024-11-08 23:00:15,779 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:00:15,974 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:00:15,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:00:15,975 INFO L158 Benchmark]: Toolchain (without parser) took 89489.54ms. Allocated memory was 130.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 91.6MB in the beginning and 1.1GB in the end (delta: -983.2MB). Peak memory consumption was 397.3MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,976 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory was 77.7MB in the beginning and 77.7MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.13ms. Allocated memory is still 130.0MB. Free memory was 91.3MB in the beginning and 71.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.15ms. Allocated memory is still 130.0MB. Free memory was 71.5MB in the beginning and 67.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,977 INFO L158 Benchmark]: Boogie Preprocessor took 89.92ms. Allocated memory is still 130.0MB. Free memory was 67.8MB in the beginning and 64.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,978 INFO L158 Benchmark]: RCFGBuilder took 2371.43ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 64.9MB in the beginning and 83.0MB in the end (delta: -18.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,978 INFO L158 Benchmark]: CodeCheck took 86005.88ms. Allocated memory was 182.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 83.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 325.2MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,979 INFO L158 Benchmark]: Witness Printer took 200.04ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:00:15,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 85.8s, OverallIterations: 24, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3246 SdHoareTripleChecker+Valid, 37.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2509 mSDsluCounter, 1000 SdHoareTripleChecker+Invalid, 34.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 647 mSDsCounter, 1351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9349 IncrementalHoareTripleChecker+Invalid, 10700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1351 mSolverCounterUnsat, 353 mSDtfsCounter, 9349 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4013 GetRequests, 3417 SyntacticMatches, 180 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98919 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 2672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 26/81 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: 610]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=2, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 1 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND TRUE (int )m2 > (int )max2 [L146] max2 = m2 [L147] newmax = (_Bool)1 [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L482] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L509] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L608] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L610] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=0, id3=1, m1=1, m2=126, m3=0, max1=126, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory was 77.7MB in the beginning and 77.7MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.13ms. Allocated memory is still 130.0MB. Free memory was 91.3MB in the beginning and 71.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.15ms. Allocated memory is still 130.0MB. Free memory was 71.5MB in the beginning and 67.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.92ms. Allocated memory is still 130.0MB. Free memory was 67.8MB in the beginning and 64.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2371.43ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 64.9MB in the beginning and 83.0MB in the end (delta: -18.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * CodeCheck took 86005.88ms. Allocated memory was 182.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 83.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 325.2MB. Max. memory is 16.1GB. * Witness Printer took 200.04ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:00:16,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7fc69f2-bdb2-4d18-a9f1-908651093e12/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE