./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 23:23:42,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 23:23:42,254 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 23:23:42,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 23:23:42,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 23:23:42,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 23:23:42,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 23:23:42,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 23:23:42,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 23:23:42,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 23:23:42,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 23:23:42,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 23:23:42,286 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 23:23:42,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 23:23:42,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 23:23:42,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 23:23:42,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 23:23:42,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 23:23:42,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 23:23:42,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 23:23:42,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 23:23:42,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 23:23:42,290 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 23:23:42,291 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 23:23:42,291 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 23:23:42,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 23:23:42,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:23:42,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 23:23:42,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 23:23:42,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 23:23:42,293 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 23:23:42,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 23:23:42,294 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 23:23:42,294 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_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/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_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2023-12-02 23:23:42,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 23:23:42,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 23:23:42,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 23:23:42,547 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 23:23:42,547 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 23:23:42,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2023-12-02 23:23:45,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 23:23:45,442 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 23:23:45,443 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2023-12-02 23:23:45,455 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/data/e83a25ff9/f5eee2ef011345b3a0b7e027cba6b881/FLAGdea602c2c [2023-12-02 23:23:45,468 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/data/e83a25ff9/f5eee2ef011345b3a0b7e027cba6b881 [2023-12-02 23:23:45,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 23:23:45,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 23:23:45,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 23:23:45,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 23:23:45,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 23:23:45,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d01388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45, skipping insertion in model container [2023-12-02 23:23:45,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 23:23:45,748 WARN L240 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_43d879d6-416e-44de-aa9a-4884092498bf/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2023-12-02 23:23:45,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:23:45,764 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 23:23:45,819 WARN L240 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_43d879d6-416e-44de-aa9a-4884092498bf/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2023-12-02 23:23:45,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:23:45,836 INFO L206 MainTranslator]: Completed translation [2023-12-02 23:23:45,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45 WrapperNode [2023-12-02 23:23:45,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 23:23:45,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 23:23:45,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 23:23:45,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 23:23:45,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,892 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2023-12-02 23:23:45,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 23:23:45,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 23:23:45,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 23:23:45,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 23:23:45,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 23:23:45,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 23:23:45,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 23:23:45,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 23:23:45,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:23:45" (1/1) ... [2023-12-02 23:23:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:23:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 23:23:45,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 23:23:45,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 23:23:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 23:23:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 23:23:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 23:23:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 23:23:46,096 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 23:23:46,098 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 23:23:46,514 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 23:23:46,978 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 23:23:46,978 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 23:23:46,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:23:46 BoogieIcfgContainer [2023-12-02 23:23:46,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 23:23:46,980 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 23:23:46,981 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 23:23:46,989 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 23:23:46,989 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:23:46" (1/1) ... [2023-12-02 23:23:46,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 23:23:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-02 23:23:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-02 23:23:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 23:23:47,045 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2023-12-02 23:23:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2023-12-02 23:23:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 23:23:48,306 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2023-12-02 23:23:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2023-12-02 23:23:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 23:23:49,253 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2023-12-02 23:23:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2023-12-02 23:23:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 23:23:50,358 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2023-12-02 23:23:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2023-12-02 23:23:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 23:23:51,647 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 40 states and 75 transitions. [2023-12-02 23:23:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 75 transitions. [2023-12-02 23:23:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 23:23:53,180 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:53,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 46 states and 87 transitions. [2023-12-02 23:23:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 87 transitions. [2023-12-02 23:23:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 23:23:54,636 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 47 states and 88 transitions. [2023-12-02 23:23:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 88 transitions. [2023-12-02 23:23:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 23:23:54,881 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 48 states and 89 transitions. [2023-12-02 23:23:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2023-12-02 23:23:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 23:23:54,944 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 58 states and 107 transitions. [2023-12-02 23:23:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 107 transitions. [2023-12-02 23:23:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 23:23:57,063 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:23:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:23:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 61 states and 112 transitions. [2023-12-02 23:23:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2023-12-02 23:23:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 23:23:57,590 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:23:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:23:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:23:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 77 states and 151 transitions. [2023-12-02 23:24:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 151 transitions. [2023-12-02 23:24:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 23:24:03,097 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 93 states and 186 transitions. [2023-12-02 23:24:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2023-12-02 23:24:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 23:24:08,336 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 94 states and 188 transitions. [2023-12-02 23:24:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 188 transitions. [2023-12-02 23:24:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:24:09,817 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 108 states and 217 transitions. [2023-12-02 23:24:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 217 transitions. [2023-12-02 23:24:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:24:13,887 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 110 states and 224 transitions. [2023-12-02 23:24:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 224 transitions. [2023-12-02 23:24:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:24:15,252 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:15,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 111 states and 228 transitions. [2023-12-02 23:24:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 228 transitions. [2023-12-02 23:24:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:24:16,199 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 125 states and 256 transitions. [2023-12-02 23:24:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 256 transitions. [2023-12-02 23:24:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:24:20,930 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 128 states and 267 transitions. [2023-12-02 23:24:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 267 transitions. [2023-12-02 23:24:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:24:22,640 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 129 states and 269 transitions. [2023-12-02 23:24:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 269 transitions. [2023-12-02 23:24:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:24:23,621 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 130 states and 274 transitions. [2023-12-02 23:24:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 274 transitions. [2023-12-02 23:24:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:24,570 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 139 states and 297 transitions. [2023-12-02 23:24:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 297 transitions. [2023-12-02 23:24:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:30,577 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 144 states and 317 transitions. [2023-12-02 23:24:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 317 transitions. [2023-12-02 23:24:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:35,001 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 147 states and 329 transitions. [2023-12-02 23:24:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 329 transitions. [2023-12-02 23:24:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:38,161 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 162 states and 352 transitions. [2023-12-02 23:24:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 352 transitions. [2023-12-02 23:24:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:43,248 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 164 states and 359 transitions. [2023-12-02 23:24:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 359 transitions. [2023-12-02 23:24:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:46,115 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 168 states and 369 transitions. [2023-12-02 23:24:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 369 transitions. [2023-12-02 23:24:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:24:49,593 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 171 states and 378 transitions. [2023-12-02 23:24:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 378 transitions. [2023-12-02 23:24:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 23:24:52,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:24:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:24:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:24:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 191 states and 414 transitions. [2023-12-02 23:24:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 414 transitions. [2023-12-02 23:24:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 23:24:59,797 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:24:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:24:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 193 states and 420 transitions. [2023-12-02 23:25:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 420 transitions. [2023-12-02 23:25:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 23:25:00,862 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 201 states and 438 transitions. [2023-12-02 23:25:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 438 transitions. [2023-12-02 23:25:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 23:25:07,040 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 216 states and 498 transitions. [2023-12-02 23:25:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 498 transitions. [2023-12-02 23:25:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 23:25:20,114 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 231 states and 551 transitions. [2023-12-02 23:25:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 551 transitions. [2023-12-02 23:25:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:25:32,757 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 242 states and 570 transitions. [2023-12-02 23:25:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 570 transitions. [2023-12-02 23:25:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:25:42,150 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 253 states and 590 transitions. [2023-12-02 23:25:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 590 transitions. [2023-12-02 23:25:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:25:51,227 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:25:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:25:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 255 states and 594 transitions. [2023-12-02 23:25:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 594 transitions. [2023-12-02 23:25:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:25:53,731 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:25:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:25:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:25:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 258 states and 599 transitions. [2023-12-02 23:26:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 599 transitions. [2023-12-02 23:26:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:26:00,519 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 266 states and 611 transitions. [2023-12-02 23:26:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 611 transitions. [2023-12-02 23:26:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:26:08,760 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 268 states and 614 transitions. [2023-12-02 23:26:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 614 transitions. [2023-12-02 23:26:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:26:13,887 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 280 states and 634 transitions. [2023-12-02 23:26:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 634 transitions. [2023-12-02 23:26:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:26:29,155 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 290 states and 652 transitions. [2023-12-02 23:26:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 652 transitions. [2023-12-02 23:26:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:26:39,531 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 304 states and 681 transitions. [2023-12-02 23:26:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 681 transitions. [2023-12-02 23:26:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:26:50,373 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:26:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:26:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 313 states and 697 transitions. [2023-12-02 23:26:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 697 transitions. [2023-12-02 23:26:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:26:58,405 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:26:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:26:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:26:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 314 states and 700 transitions. [2023-12-02 23:27:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 700 transitions. [2023-12-02 23:27:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:27:00,304 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 315 states and 703 transitions. [2023-12-02 23:27:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 703 transitions. [2023-12-02 23:27:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:27:02,776 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 316 states and 703 transitions. [2023-12-02 23:27:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 703 transitions. [2023-12-02 23:27:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:04,635 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 331 states and 739 transitions. [2023-12-02 23:27:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 739 transitions. [2023-12-02 23:27:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:17,787 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 340 states and 756 transitions. [2023-12-02 23:27:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 756 transitions. [2023-12-02 23:27:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:26,046 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 350 states and 778 transitions. [2023-12-02 23:27:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 778 transitions. [2023-12-02 23:27:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:37,947 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 353 states and 787 transitions. [2023-12-02 23:27:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 787 transitions. [2023-12-02 23:27:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:42,710 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 354 states and 788 transitions. [2023-12-02 23:27:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 788 transitions. [2023-12-02 23:27:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:44,351 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 355 states and 789 transitions. [2023-12-02 23:27:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 789 transitions. [2023-12-02 23:27:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:27:46,160 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:27:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:27:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 363 states and 804 transitions. [2023-12-02 23:27:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 804 transitions. [2023-12-02 23:27:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 23:27:53,195 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:27:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:27:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:27:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:28:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:28:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 368 states and 822 transitions. [2023-12-02 23:28:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 822 transitions. [2023-12-02 23:28:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 23:28:04,520 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:28:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:28:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:28:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:28:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:28:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 377 states and 844 transitions. [2023-12-02 23:28:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 844 transitions. [2023-12-02 23:28:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 23:28:20,382 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:28:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:28:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:28:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:28:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:28:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 382 states and 864 transitions. [2023-12-02 23:28:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 864 transitions. [2023-12-02 23:28:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 23:28:33,603 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:28:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:28:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:28:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:28:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:28:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 385 states and 869 transitions. [2023-12-02 23:28:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 869 transitions. [2023-12-02 23:28:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:28:43,231 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:28:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:28:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:28:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:28:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:28:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 392 states and 892 transitions. [2023-12-02 23:28:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 892 transitions. [2023-12-02 23:28:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:28:53,675 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:28:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:28:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:28:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 399 states and 913 transitions. [2023-12-02 23:29:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 913 transitions. [2023-12-02 23:29:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:29:01,600 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 402 states and 919 transitions. [2023-12-02 23:29:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 919 transitions. [2023-12-02 23:29:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:29:06,199 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 406 states and 927 transitions. [2023-12-02 23:29:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 927 transitions. [2023-12-02 23:29:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:29:11,130 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 407 states and 933 transitions. [2023-12-02 23:29:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 933 transitions. [2023-12-02 23:29:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:29:12,922 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 408 states and 935 transitions. [2023-12-02 23:29:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 935 transitions. [2023-12-02 23:29:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 23:29:15,010 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 23:29:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 408 states and 934 transitions. [2023-12-02 23:29:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 934 transitions. [2023-12-02 23:29:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:29:15,676 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 415 states and 960 transitions. [2023-12-02 23:29:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 960 transitions. [2023-12-02 23:29:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:29:29,845 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:29,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 421 states and 971 transitions. [2023-12-02 23:29:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 971 transitions. [2023-12-02 23:29:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:29:37,596 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:29:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:29:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 442 states and 1018 transitions. [2023-12-02 23:29:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1018 transitions. [2023-12-02 23:29:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:29:58,190 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:29:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:29:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:29:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:30:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:30:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 443 states and 1020 transitions. [2023-12-02 23:30:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1020 transitions. [2023-12-02 23:30:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:30:00,811 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:30:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:30:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:30:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:30:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:30:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 445 states and 1025 transitions. [2023-12-02 23:30:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1025 transitions. [2023-12-02 23:30:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 23:30:04,877 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:30:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:30:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:30:05,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:30:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:30:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:30:05,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:30:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:30:05,973 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 69 iterations. [2023-12-02 23:30:06,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 11:30:06 ImpRootNode [2023-12-02 23:30:06,088 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 23:30:06,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 23:30:06,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 23:30:06,089 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 23:30:06,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:23:46" (3/4) ... [2023-12-02 23:30:06,090 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 23:30:06,202 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 23:30:06,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 23:30:06,202 INFO L158 Benchmark]: Toolchain (without parser) took 380730.90ms. Allocated memory was 138.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 92.5MB in the beginning and 1.1GB in the end (delta: -965.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-12-02 23:30:06,203 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 107.0MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 23:30:06,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.92ms. Allocated memory is still 138.4MB. Free memory was 92.5MB in the beginning and 99.6MB in the end (delta: -7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 23:30:06,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.51ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 96.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 23:30:06,203 INFO L158 Benchmark]: Boogie Preprocessor took 44.42ms. Allocated memory is still 138.4MB. Free memory was 96.6MB in the beginning and 93.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 23:30:06,204 INFO L158 Benchmark]: RCFGBuilder took 1041.05ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 93.6MB in the beginning and 126.8MB in the end (delta: -33.2MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2023-12-02 23:30:06,204 INFO L158 Benchmark]: CodeCheck took 379107.73ms. Allocated memory was 174.1MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 125.8MB in the beginning and 1.1GB in the end (delta: -948.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-12-02 23:30:06,204 INFO L158 Benchmark]: Witness Printer took 113.24ms. Allocated memory is still 2.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 23:30:06,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 379.0s, OverallIterations: 69, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37703 SdHoareTripleChecker+Valid, 229.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35378 mSDsluCounter, 11931 SdHoareTripleChecker+Invalid, 207.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10813 mSDsCounter, 14122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108431 IncrementalHoareTripleChecker+Invalid, 122553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14122 mSolverCounterUnsat, 1118 mSDtfsCounter, 108431 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23322 GetRequests, 20801 SyntacticMatches, 921 SemanticMatches, 1600 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567633 ImplicationChecksByTransitivity, 303.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 97.5s InterpolantComputationTime, 2068 NumberOfCodeBlocks, 2068 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1952 ConstructedInterpolants, 0 QuantifiedInterpolants, 20038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 11 PerfectInterpolantSequences, 259/1263 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L452] int c1 ; [L453] int i2 ; [L456] c1 = 0 [L457] ep12 = __VERIFIER_nondet_bool() [L458] ep13 = __VERIFIER_nondet_bool() [L459] ep21 = __VERIFIER_nondet_bool() [L460] ep23 = __VERIFIER_nondet_bool() [L461] ep31 = __VERIFIER_nondet_bool() [L462] ep32 = __VERIFIER_nondet_bool() [L463] id1 = __VERIFIER_nondet_char() [L464] r1 = __VERIFIER_nondet_char() [L465] st1 = __VERIFIER_nondet_char() [L466] nl1 = __VERIFIER_nondet_char() [L467] m1 = __VERIFIER_nondet_char() [L468] max1 = __VERIFIER_nondet_char() [L469] mode1 = __VERIFIER_nondet_bool() [L470] id2 = __VERIFIER_nondet_char() [L471] r2 = __VERIFIER_nondet_char() [L472] st2 = __VERIFIER_nondet_char() [L473] nl2 = __VERIFIER_nondet_char() [L474] m2 = __VERIFIER_nondet_char() [L475] max2 = __VERIFIER_nondet_char() [L476] mode2 = __VERIFIER_nondet_bool() [L477] id3 = __VERIFIER_nondet_char() [L478] r3 = __VERIFIER_nondet_char() [L479] st3 = __VERIFIER_nondet_char() [L480] nl3 = __VERIFIER_nondet_char() [L481] m3 = __VERIFIER_nondet_char() [L482] max3 = __VERIFIER_nondet_char() [L483] mode3 = __VERIFIER_nondet_bool() [L484] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND TRUE \read(r121) [L245] COND FALSE !(\read(ep23)) [L248] tmp___0 = 0 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND FALSE !(\read(r231)) [L264] tmp___1 = 0 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND FALSE !(\read(r211)) [L277] tmp___2 = 0 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND FALSE !(\read(ep21)) [L287] tmp___3 = 0 [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 (int )max1 == (int )id1 [L316] COND TRUE (int )max2 == (int )id2 [L317] COND TRUE (int )max3 == (int )id3 [L318] COND TRUE (int )st1 == 0 [L319] COND TRUE (int )st2 == 0 [L320] COND TRUE (int )st3 == 0 [L321] COND TRUE (int )nl1 == 0 [L322] COND TRUE (int )nl2 == 0 [L323] COND TRUE (int )nl3 == 0 [L324] COND TRUE (int )mode1 == 0 [L325] COND TRUE (int )mode2 == 0 [L326] COND TRUE (int )mode3 == 0 [L327] tmp___5 = 1 [L391] return (tmp___5); [L484] RET, EXPR init() [L484] i2 = init() [L485] COND FALSE !(!(i2)) [L486] p12_old = nomsg [L487] p12_new = nomsg [L488] p13_old = nomsg [L489] p13_new = nomsg [L490] p21_old = nomsg [L491] p21_new = nomsg [L492] p23_old = nomsg [L493] p23_new = nomsg [L494] p31_old = nomsg [L495] p31_new = nomsg [L496] p32_old = nomsg [L497] p32_new = nomsg [L498] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, i2=0, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, i2=1, id1=2, id2=0, id3=3, m1=3, m2=1, m3=4, max1=2, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND TRUE (int )m2 > (int )max2 [L124] max2 = m2 [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND TRUE (int )m2 > (int )max2 [L131] max2 = m2 [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, i2=2, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, i2=3, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [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 FALSE !((int )max2 == (int )id2) [L138] nl2 = (char)1 [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L399] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L445] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L531] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=3, m1=3, m2=3, m3=4, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 107.0MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.92ms. Allocated memory is still 138.4MB. Free memory was 92.5MB in the beginning and 99.6MB in the end (delta: -7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.51ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 96.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.42ms. Allocated memory is still 138.4MB. Free memory was 96.6MB in the beginning and 93.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.05ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 93.6MB in the beginning and 126.8MB in the end (delta: -33.2MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * CodeCheck took 379107.73ms. Allocated memory was 174.1MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 125.8MB in the beginning and 1.1GB in the end (delta: -948.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 113.24ms. Allocated memory is still 2.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 23:30:06,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43d879d6-416e-44de-aa9a-4884092498bf/bin/ukojak-verify-Qdu7aM0XO9/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