./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/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_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/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_8185bb8b-48ca-4d31-bc04-7a80daad710a/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 c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:40:19,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:40:20,041 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:40:20,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:40:20,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:40:20,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:40:20,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:40:20,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:40:20,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:40:20,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:40:20,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:40:20,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:40:20,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:40:20,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:40:20,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:40:20,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:40:20,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:40:20,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:40:20,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:40:20,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:40:20,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:40:20,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:40:20,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:40:20,091 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:40:20,092 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:40:20,092 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:40:20,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:40:20,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:40:20,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:40:20,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:40:20,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:40:20,094 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:40:20,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:40:20,094 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_8185bb8b-48ca-4d31-bc04-7a80daad710a/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_8185bb8b-48ca-4d31-bc04-7a80daad710a/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 -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2024-11-08 22:40:20,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:40:20,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:40:20,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:40:20,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:40:20,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:40:20,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 22:40:22,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:40:22,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:40:22,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-08 22:40:22,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/data/2527ec43a/835a639f58e545ec8792e4e9e34c91fc/FLAG46a136042 [2024-11-08 22:40:22,760 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/data/2527ec43a/835a639f58e545ec8792e4e9e34c91fc [2024-11-08 22:40:22,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:40:22,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:40:22,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:40:22,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:40:22,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:40:22,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:40:22" (1/1) ... [2024-11-08 22:40:22,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307d08db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:22, skipping insertion in model container [2024-11-08 22:40:22,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:40:22" (1/1) ... [2024-11-08 22:40:22,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:40:23,203 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_8185bb8b-48ca-4d31-bc04-7a80daad710a/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-08 22:40:23,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:40:23,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:40:23,305 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_8185bb8b-48ca-4d31-bc04-7a80daad710a/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-08 22:40:23,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:40:23,332 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:40:23,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23 WrapperNode [2024-11-08 22:40:23,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:40:23,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:40:23,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:40:23,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:40:23,344 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:40:23" (1/1) ... [2024-11-08 22:40:23,352 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:40:23" (1/1) ... [2024-11-08 22:40:23,397 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-08 22:40:23,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:40:23,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:40:23,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:40:23,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:40:23,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:40:23,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:40:23,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:40:23,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:40:23,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:40:23" (1/1) ... [2024-11-08 22:40:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:40:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:40:23,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/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:40:23,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/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:40:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:40:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:40:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:40:23,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:40:23,631 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:40:23,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:40:24,428 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-08 22:40:24,428 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:40:25,128 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:40:25,128 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 22:40:25,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:40:25 BoogieIcfgContainer [2024-11-08 22:40:25,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:40:25,129 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:40:25,129 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:40:25,139 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:40:25,140 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:40:25" (1/1) ... [2024-11-08 22:40:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:40:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2024-11-08 22:40:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2024-11-08 22:40:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:40:25,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:40:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 24 states and 39 transitions. [2024-11-08 22:40:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2024-11-08 22:40:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:40:27,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:29,364 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:40:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 48 transitions. [2024-11-08 22:40:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-08 22:40:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:40:29,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:30,956 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:40:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 33 states and 59 transitions. [2024-11-08 22:40:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2024-11-08 22:40:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:40:31,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:32,692 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:40:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2024-11-08 22:40:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2024-11-08 22:40:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:40:33,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:34,830 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:40:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2024-11-08 22:40:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2024-11-08 22:40:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:40:35,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:36,908 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:40:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 54 states and 101 transitions. [2024-11-08 22:40:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2024-11-08 22:40:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:40:38,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:38,111 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:40:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 55 states and 101 transitions. [2024-11-08 22:40:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 101 transitions. [2024-11-08 22:40:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:40:38,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:38,412 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:40:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-08 22:40:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-08 22:40:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:40:38,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:39,833 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:40:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 67 states and 121 transitions. [2024-11-08 22:40:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 121 transitions. [2024-11-08 22:40:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:40:41,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:41,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:41,966 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:40:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 70 states and 126 transitions. [2024-11-08 22:40:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 126 transitions. [2024-11-08 22:40:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:40:42,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:45,117 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:40:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 88 states and 164 transitions. [2024-11-08 22:40:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2024-11-08 22:40:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:40:49,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:51,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-11-08 22:40:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 103 states and 199 transitions. [2024-11-08 22:40:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 199 transitions. [2024-11-08 22:40:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:40:55,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:57,324 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:40:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 104 states and 204 transitions. [2024-11-08 22:40:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 204 transitions. [2024-11-08 22:40:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:40:57,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:59,577 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:41:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 124 states and 245 transitions. [2024-11-08 22:41:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 245 transitions. [2024-11-08 22:41:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:41:03,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:03,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:05,573 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:41:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 126 states and 250 transitions. [2024-11-08 22:41:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 250 transitions. [2024-11-08 22:41:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:41:06,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 141 states and 282 transitions. [2024-11-08 22:41:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 282 transitions. [2024-11-08 22:41:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:41:12,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 144 states and 292 transitions. [2024-11-08 22:41:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 292 transitions. [2024-11-08 22:41:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:41:15,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 145 states and 295 transitions. [2024-11-08 22:41:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 295 transitions. [2024-11-08 22:41:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:41:17,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 167 states and 338 transitions. [2024-11-08 22:41:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 338 transitions. [2024-11-08 22:41:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:41:27,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 172 states and 348 transitions. [2024-11-08 22:41:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 348 transitions. [2024-11-08 22:41:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:41:31,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 181 states and 369 transitions. [2024-11-08 22:41:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 369 transitions. [2024-11-08 22:41:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:41:40,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:41:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 212 states and 446 transitions. [2024-11-08 22:41:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 446 transitions. [2024-11-08 22:41:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:41:56,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 22:42:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 227 states and 492 transitions. [2024-11-08 22:42:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 492 transitions. [2024-11-08 22:42:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:42:07,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:42:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 228 states and 494 transitions. [2024-11-08 22:42:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 494 transitions. [2024-11-08 22:42:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:42:11,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:42:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 239 states and 515 transitions. [2024-11-08 22:42:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 515 transitions. [2024-11-08 22:42:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:42:21,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:42:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 255 states and 561 transitions. [2024-11-08 22:42:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 561 transitions. [2024-11-08 22:42:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:42:34,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:42:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 257 states and 565 transitions. [2024-11-08 22:42:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 565 transitions. [2024-11-08 22:42:37,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:42:37,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:42:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 259 states and 572 transitions. [2024-11-08 22:42:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 572 transitions. [2024-11-08 22:42:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:42:39,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:42:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 274 states and 604 transitions. [2024-11-08 22:42:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 604 transitions. [2024-11-08 22:42:55,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:42:55,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:43:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 284 states and 632 transitions. [2024-11-08 22:43:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 632 transitions. [2024-11-08 22:43:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:43:09,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:43:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 314 states and 685 transitions. [2024-11-08 22:43:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 685 transitions. [2024-11-08 22:43:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:43:26,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:43:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 323 states and 716 transitions. [2024-11-08 22:43:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 716 transitions. [2024-11-08 22:43:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:43:41,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:43:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 327 states and 732 transitions. [2024-11-08 22:43:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 732 transitions. [2024-11-08 22:43:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:43:47,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:43:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:43:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 333 states and 754 transitions. [2024-11-08 22:43:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 754 transitions. [2024-11-08 22:43:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:43:53,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:43:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:44:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:44:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 341 states and 786 transitions. [2024-11-08 22:44:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 786 transitions. [2024-11-08 22:44:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:44:04,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:44:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:44:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:44:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:44:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:44:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 361 states and 826 transitions. [2024-11-08 22:44:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 826 transitions. [2024-11-08 22:44:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 22:44:24,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:44:24,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:44:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:44:25,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:44:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:44:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:44:27,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:44:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:44:28,028 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 37 iterations. [2024-11-08 22:44:28,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:44:28 ImpRootNode [2024-11-08 22:44:28,223 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:44:28,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:44:28,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:44:28,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:44:28,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:40:25" (3/4) ... [2024-11-08 22:44:28,226 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:44:28,451 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:44:28,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:44:28,452 INFO L158 Benchmark]: Toolchain (without parser) took 245684.86ms. Allocated memory was 144.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 105.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 179.5MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,454 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 144.7MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:44:28,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.15ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 86.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 144.7MB. Free memory was 86.6MB in the beginning and 83.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,455 INFO L158 Benchmark]: Boogie Preprocessor took 39.93ms. Allocated memory is still 144.7MB. Free memory was 83.4MB in the beginning and 80.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,459 INFO L158 Benchmark]: RCFGBuilder took 1690.02ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 80.7MB in the beginning and 116.0MB in the end (delta: -35.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,459 INFO L158 Benchmark]: CodeCheck took 243094.34ms. Allocated memory was 207.6MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 114.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,459 INFO L158 Benchmark]: Witness Printer took 227.38ms. Allocated memory is still 2.6GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:44:28,462 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 242.9s, OverallIterations: 37, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12191 SdHoareTripleChecker+Valid, 86.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11019 mSDsluCounter, 8133 SdHoareTripleChecker+Invalid, 78.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5339 mSDsCounter, 4230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32032 IncrementalHoareTripleChecker+Invalid, 36262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4230 mSolverCounterUnsat, 2794 mSDtfsCounter, 32032 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11035 GetRequests, 9678 SyntacticMatches, 373 SemanticMatches, 984 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572555 ImplicationChecksByTransitivity, 171.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 74.7s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 8712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 115/563 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: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND TRUE \read(ep32) [L233] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND TRUE \read(ep21) [L285] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=0, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=0, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=1, id1=126, id2=127, id3=0, m1=126, m2=126, m3=1, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND TRUE (int )m3 > (int )max3 [L167] max3 = m3 [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND TRUE (int )m3 > (int )max3 [L174] max3 = m3 [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=2, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=2, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=3, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, i2=3, id1=126, id2=127, id3=0, m1=127, m2=0, m3=127, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] st1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND FALSE !((int )max3 == (int )id3) [L181] nl3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L555] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=127, id3=0, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 144.7MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.15ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 86.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 144.7MB. Free memory was 86.6MB in the beginning and 83.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.93ms. Allocated memory is still 144.7MB. Free memory was 83.4MB in the beginning and 80.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1690.02ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 80.7MB in the beginning and 116.0MB in the end (delta: -35.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * CodeCheck took 243094.34ms. Allocated memory was 207.6MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 114.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. * Witness Printer took 227.38ms. Allocated memory is still 2.6GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:44:28,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185bb8b-48ca-4d31-bc04-7a80daad710a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE