./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:34:31,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:34:31,496 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:34:31,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:34:31,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:34:31,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:34:31,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:34:31,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:34:31,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:34:31,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:34:31,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:34:31,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:34:31,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:34:31,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:34:31,522 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:34:31,522 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:34:31,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:34:31,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:34:31,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:34:31,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:34:31,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:34:31,523 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:34:31,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:34:31,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f [2024-12-06 04:34:31,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:34:31,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:34:31,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:34:31,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:34:31,772 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:34:31,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-12-06 04:34:34,415 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/data/556d29e46/a76beaf9bec44f49a1ed9a2e2a5a6aa8/FLAG41531f3db [2024-12-06 04:34:34,638 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:34:34,638 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-12-06 04:34:34,646 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/data/556d29e46/a76beaf9bec44f49a1ed9a2e2a5a6aa8/FLAG41531f3db [2024-12-06 04:34:35,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/data/556d29e46/a76beaf9bec44f49a1ed9a2e2a5a6aa8 [2024-12-06 04:34:35,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:34:35,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:34:35,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:34:35,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:34:35,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:34:35,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc43e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35, skipping insertion in model container [2024-12-06 04:34:35,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:34:35,218 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_23c8ae59-c843-4c30-a021-b1e2490b9d90/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c[14373,14386] [2024-12-06 04:34:35,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:34:35,232 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:34:35,285 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_23c8ae59-c843-4c30-a021-b1e2490b9d90/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c[14373,14386] [2024-12-06 04:34:35,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:34:35,298 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:34:35,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35 WrapperNode [2024-12-06 04:34:35,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:34:35,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:34:35,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:34:35,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:34:35,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,344 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-12-06 04:34:35,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:34:35,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:34:35,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:34:35,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:34:35,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:34:35,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:34:35,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:34:35,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:34:35,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:35" (1/1) ... [2024-12-06 04:34:35,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:34:35,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:34:35,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:34:35,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:34:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:34:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:34:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:34:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:34:35,535 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:34:35,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:34:36,043 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-12-06 04:34:36,043 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:34:36,621 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:34:36,622 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 04:34:36,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:36 BoogieIcfgContainer [2024-12-06 04:34:36,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:34:36,623 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:34:36,623 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:34:36,634 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:34:36,634 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:36" (1/1) ... [2024-12-06 04:34:36,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:34:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 04:34:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 04:34:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:34:36,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-06 04:34:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-06 04:34:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:34:39,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-06 04:34:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-06 04:34:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:34:40,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-06 04:34:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-06 04:34:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:34:41,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-06 04:34:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-06 04:34:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:34:43,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 38 states and 70 transitions. [2024-12-06 04:34:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 70 transitions. [2024-12-06 04:34:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:34:44,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 44 states and 83 transitions. [2024-12-06 04:34:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 83 transitions. [2024-12-06 04:34:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:34:46,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 45 states and 83 transitions. [2024-12-06 04:34:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2024-12-06 04:34:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:34:46,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 55 states and 102 transitions. [2024-12-06 04:34:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2024-12-06 04:34:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:34:48,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 64 states and 118 transitions. [2024-12-06 04:34:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 118 transitions. [2024-12-06 04:34:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:34:51,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 67 states and 124 transitions. [2024-12-06 04:34:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 124 transitions. [2024-12-06 04:34:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:34:51,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:34:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:34:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 83 states and 158 transitions. [2024-12-06 04:34:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 158 transitions. [2024-12-06 04:34:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:34:57,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:34:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:34:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:34:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 97 states and 194 transitions. [2024-12-06 04:35:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 194 transitions. [2024-12-06 04:35:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:35:01,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 98 states and 197 transitions. [2024-12-06 04:35:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 197 transitions. [2024-12-06 04:35:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:35:03,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 111 states and 225 transitions. [2024-12-06 04:35:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 225 transitions. [2024-12-06 04:35:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:35:08,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 123 states and 256 transitions. [2024-12-06 04:35:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 256 transitions. [2024-12-06 04:35:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:35:13,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 125 states and 265 transitions. [2024-12-06 04:35:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 265 transitions. [2024-12-06 04:35:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:35:15,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 133 states and 290 transitions. [2024-12-06 04:35:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 290 transitions. [2024-12-06 04:35:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:35:19,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 135 states and 300 transitions. [2024-12-06 04:35:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 300 transitions. [2024-12-06 04:35:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:35:22,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 140 states and 318 transitions. [2024-12-06 04:35:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 318 transitions. [2024-12-06 04:35:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:35:27,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 141 states and 321 transitions. [2024-12-06 04:35:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 321 transitions. [2024-12-06 04:35:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:35:28,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 142 states and 324 transitions. [2024-12-06 04:35:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 324 transitions. [2024-12-06 04:35:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:35:30,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:30,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:35:30,541 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:35:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:35:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:35:31,091 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:35:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:35:31,370 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 22 iterations. [2024-12-06 04:35:31,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:35:31 ImpRootNode [2024-12-06 04:35:31,442 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:35:31,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:35:31,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:35:31,443 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:35:31,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:36" (3/4) ... [2024-12-06 04:35:31,445 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 04:35:31,546 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 118. [2024-12-06 04:35:31,638 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:35:31,639 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:35:31,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:35:31,640 INFO L158 Benchmark]: Toolchain (without parser) took 56632.82ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 92.3MB in the beginning and 744.4MB in the end (delta: -652.1MB). Peak memory consumption was 430.0MB. Max. memory is 16.1GB. [2024-12-06 04:35:31,640 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:35:31,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.67ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 74.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:35:31,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.42ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 71.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:35:31,641 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:35:31,641 INFO L158 Benchmark]: RCFGBuilder took 1238.93ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 69.4MB in the beginning and 139.1MB in the end (delta: -69.7MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-12-06 04:35:31,641 INFO L158 Benchmark]: CodeCheck took 54819.48ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 981.5MB). Free memory was 139.1MB in the beginning and 761.2MB in the end (delta: -622.1MB). Peak memory consumption was 361.5MB. Max. memory is 16.1GB. [2024-12-06 04:35:31,642 INFO L158 Benchmark]: Witness Printer took 195.86ms. Allocated memory is still 1.2GB. Free memory was 761.2MB in the beginning and 744.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:35:31,644 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: 54.7s, OverallIterations: 22, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2915 SdHoareTripleChecker+Valid, 22.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2254 mSDsluCounter, 1005 SdHoareTripleChecker+Invalid, 20.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 644 mSDsCounter, 1240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8854 IncrementalHoareTripleChecker+Invalid, 10094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1240 mSolverCounterUnsat, 361 mSDtfsCounter, 8854 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3694 GetRequests, 3107 SyntacticMatches, 135 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117666 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 2846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 22/67 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND FALSE !(\read(r211)) [L287] COND TRUE \read(r231) [L288] COND TRUE \read(ep31) [L289] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=125, id2=127, id3=124, m1=126, m2=124, m3=123, max1=125, max2=127, max3=124, 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=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 1 [L102] COND TRUE (int )max1 == (int )id1 [L103] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND TRUE (int )m3 > (int )max3 [L190] max3 = m3 [L191] newmax = (_Bool)1 [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND TRUE (int )m3 > (int )max3 [L198] max3 = m3 [L199] newmax = (_Bool)1 [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L472] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L499] tmp = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L600] reach_error() VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=124, m1=124, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=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.28ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.67ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 74.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.42ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 71.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1238.93ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 69.4MB in the beginning and 139.1MB in the end (delta: -69.7MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * CodeCheck took 54819.48ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 981.5MB). Free memory was 139.1MB in the beginning and 761.2MB in the end (delta: -622.1MB). Peak memory consumption was 361.5MB. Max. memory is 16.1GB. * Witness Printer took 195.86ms. Allocated memory is still 1.2GB. Free memory was 761.2MB in the beginning and 744.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 04:35:31,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23c8ae59-c843-4c30-a021-b1e2490b9d90/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE