./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.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_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/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_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/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_423055d9-fe32-4c52-b580-6cd8904fc213/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 eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 22:24:58,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 22:24:58,897 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 22:24:58,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 22:24:58,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 22:24:58,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 22:24:58,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 22:24:58,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 22:24:58,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 22:24:58,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 22:24:58,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 22:24:58,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 22:24:58,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 22:24:58,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 22:24:58,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 22:24:58,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 22:24:58,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 22:24:58,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 22:24:58,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 22:24:58,932 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 22:24:58,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 22:24:58,934 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 22:24:58,934 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 22:24:58,935 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 22:24:58,935 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 22:24:58,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 22:24:58,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:24:58,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 22:24:58,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 22:24:58,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 22:24:58,938 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 22:24:58,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 22:24:58,938 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 22:24:58,939 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_423055d9-fe32-4c52-b580-6cd8904fc213/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_423055d9-fe32-4c52-b580-6cd8904fc213/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 -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2023-12-02 22:24:59,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 22:24:59,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 22:24:59,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 22:24:59,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 22:24:59,218 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 22:24:59,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2023-12-02 22:25:01,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 22:25:02,498 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 22:25:02,499 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2023-12-02 22:25:02,548 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/data/92111c903/565f80ff1efc43bcb937eac628f2e520/FLAGc2982b0c1 [2023-12-02 22:25:02,985 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/data/92111c903/565f80ff1efc43bcb937eac628f2e520 [2023-12-02 22:25:02,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 22:25:02,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 22:25:02,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 22:25:02,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 22:25:02,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 22:25:02,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:25:02" (1/1) ... [2023-12-02 22:25:02,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5937713b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:02, skipping insertion in model container [2023-12-02 22:25:02,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:25:02" (1/1) ... [2023-12-02 22:25:03,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 22:25:05,115 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_423055d9-fe32-4c52-b580-6cd8904fc213/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2023-12-02 22:25:05,143 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_423055d9-fe32-4c52-b580-6cd8904fc213/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2023-12-02 22:25:05,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:25:05,296 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 22:25:06,360 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_423055d9-fe32-4c52-b580-6cd8904fc213/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2023-12-02 22:25:06,363 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_423055d9-fe32-4c52-b580-6cd8904fc213/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2023-12-02 22:25:06,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:25:06,442 INFO L206 MainTranslator]: Completed translation [2023-12-02 22:25:06,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06 WrapperNode [2023-12-02 22:25:06,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 22:25:06,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 22:25:06,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 22:25:06,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 22:25:06,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:06,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:06,908 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2023-12-02 22:25:06,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 22:25:06,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 22:25:06,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 22:25:06,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 22:25:06,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:06,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:06,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:06,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:07,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:07,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:07,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:07,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:07,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 22:25:07,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 22:25:07,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 22:25:07,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 22:25:07,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:06" (1/1) ... [2023-12-02 22:25:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:25:07,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 22:25:07,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 22:25:07,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 22:25:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 22:25:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-02 22:25:07,488 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-02 22:25:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-02 22:25:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-02 22:25:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-02 22:25:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-02 22:25:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-02 22:25:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-02 22:25:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-02 22:25:07,490 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-02 22:25:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-02 22:25:07,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-02 22:25:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 22:25:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-02 22:25:07,490 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-02 22:25:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 22:25:07,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 22:25:07,595 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 22:25:07,598 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 22:25:15,143 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 22:25:16,983 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 22:25:16,983 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 22:25:16,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:25:16 BoogieIcfgContainer [2023-12-02 22:25:16,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 22:25:16,987 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 22:25:16,987 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 22:25:16,995 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 22:25:16,995 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:25:16" (1/1) ... [2023-12-02 22:25:17,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 22:25:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2023-12-02 22:25:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2023-12-02 22:25:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:25:17,095 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:17,367 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 22:25:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2023-12-02 22:25:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2023-12-02 22:25:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:25:17,467 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:17,544 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 22:25:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2023-12-02 22:25:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2023-12-02 22:25:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:25:17,573 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:17,618 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 22:25:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2023-12-02 22:25:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2023-12-02 22:25:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 22:25:17,665 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 22:25:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2023-12-02 22:25:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2023-12-02 22:25:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 22:25:18,250 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 22:25:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2023-12-02 22:25:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2023-12-02 22:25:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 22:25:18,848 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 22:25:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2023-12-02 22:25:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2023-12-02 22:25:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 22:25:18,945 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 22:25:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2023-12-02 22:25:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2023-12-02 22:25:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 22:25:19,014 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 22:25:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2023-12-02 22:25:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2023-12-02 22:25:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 22:25:20,375 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 22:25:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2023-12-02 22:25:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2023-12-02 22:25:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 22:25:20,794 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 22:25:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2023-12-02 22:25:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2023-12-02 22:25:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 22:25:20,863 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 22:25:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2023-12-02 22:25:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2023-12-02 22:25:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 22:25:20,985 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 22:25:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2023-12-02 22:25:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2023-12-02 22:25:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 22:25:21,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 22:25:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2023-12-02 22:25:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2023-12-02 22:25:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 22:25:21,089 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 22:25:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2023-12-02 22:25:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2023-12-02 22:25:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 22:25:21,712 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:25:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2023-12-02 22:25:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2023-12-02 22:25:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 22:25:22,030 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:22,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:25:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1777 states and 3479 transitions. [2023-12-02 22:25:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 3479 transitions. [2023-12-02 22:25:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 22:25:22,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 22:25:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2023-12-02 22:25:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2023-12-02 22:25:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 22:25:22,264 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 22:25:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2023-12-02 22:25:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2023-12-02 22:25:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:25:22,401 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 22:25:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2023-12-02 22:25:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2023-12-02 22:25:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:25:22,485 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 22:25:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2023-12-02 22:25:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2023-12-02 22:25:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:25:23,072 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 22:25:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2023-12-02 22:25:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2023-12-02 22:25:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:25:24,130 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 22:25:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2023-12-02 22:25:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2023-12-02 22:25:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 22:25:24,602 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 22:25:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 1798 states and 3526 transitions. [2023-12-02 22:25:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2023-12-02 22:25:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 22:25:24,679 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:24,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 22:25:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2023-12-02 22:25:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2023-12-02 22:25:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 22:25:24,790 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 22:25:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1795 states and 3515 transitions. [2023-12-02 22:25:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3515 transitions. [2023-12-02 22:25:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 22:25:24,858 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 22:25:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2023-12-02 22:25:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2023-12-02 22:25:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 22:25:25,565 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 22:25:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2023-12-02 22:25:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2023-12-02 22:25:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 22:25:25,638 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 22:25:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2023-12-02 22:25:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2023-12-02 22:25:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 22:25:26,468 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 22:25:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2023-12-02 22:25:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2023-12-02 22:25:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:25:26,949 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 22:25:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 1817 states and 3554 transitions. [2023-12-02 22:25:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 3554 transitions. [2023-12-02 22:25:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 22:25:27,411 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-02 22:25:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 1822 states and 3563 transitions. [2023-12-02 22:25:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3563 transitions. [2023-12-02 22:25:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 22:25:27,491 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 22:25:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 1822 states and 3562 transitions. [2023-12-02 22:25:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3562 transitions. [2023-12-02 22:25:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-02 22:25:28,457 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 22:25:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 1824 states and 3563 transitions. [2023-12-02 22:25:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 3563 transitions. [2023-12-02 22:25:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 22:25:28,767 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 22:25:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 1841 states and 3598 transitions. [2023-12-02 22:25:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3598 transitions. [2023-12-02 22:25:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 22:25:30,099 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 22:25:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 1845 states and 3604 transitions. [2023-12-02 22:25:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3604 transitions. [2023-12-02 22:25:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 22:25:30,617 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 22:25:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 1851 states and 3614 transitions. [2023-12-02 22:25:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3614 transitions. [2023-12-02 22:25:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 22:25:30,914 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 22:25:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 1857 states and 3625 transitions. [2023-12-02 22:25:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 3625 transitions. [2023-12-02 22:25:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:25:30,995 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 22:25:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 1859 states and 3628 transitions. [2023-12-02 22:25:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3628 transitions. [2023-12-02 22:25:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:25:31,369 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 22:25:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 1864 states and 3637 transitions. [2023-12-02 22:25:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3637 transitions. [2023-12-02 22:25:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:25:31,576 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 22:25:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 1868 states and 3643 transitions. [2023-12-02 22:25:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3643 transitions. [2023-12-02 22:25:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:25:32,025 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 22:25:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 1878 states and 3663 transitions. [2023-12-02 22:25:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 3663 transitions. [2023-12-02 22:25:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 22:25:33,119 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 22:25:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 1898 states and 3720 transitions. [2023-12-02 22:25:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 3720 transitions. [2023-12-02 22:25:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 22:25:35,530 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 22:25:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 1908 states and 3741 transitions. [2023-12-02 22:25:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3741 transitions. [2023-12-02 22:25:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 22:25:36,737 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:25:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 22:25:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:25:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 1914 states and 3757 transitions. [2023-12-02 22:25:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 3757 transitions. [2023-12-02 22:25:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 22:25:37,100 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:25:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:25:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:25:37,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:25:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:25:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:25:37,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:25:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:25:37,391 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 45 iterations. [2023-12-02 22:25:37,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:25:37,467 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:25:37,476 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:25:37,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 10:25:37 ImpRootNode [2023-12-02 22:25:37,496 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 22:25:37,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 22:25:37,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 22:25:37,497 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 22:25:37,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:25:16" (3/4) ... [2023-12-02 22:25:37,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 22:25:37,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:25:37,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:25:37,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:25:37,602 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 22:25:37,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 22:25:37,603 INFO L158 Benchmark]: Toolchain (without parser) took 34614.65ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 79.4MB in the beginning and 628.0MB in the end (delta: -548.6MB). Peak memory consumption was 596.3MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,604 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 22:25:37,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3453.71ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 79.4MB in the beginning and 96.9MB in the end (delta: -17.5MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 464.49ms. Allocated memory was 203.4MB in the beginning and 257.9MB in the end (delta: 54.5MB). Free memory was 96.9MB in the beginning and 122.1MB in the end (delta: -25.2MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,605 INFO L158 Benchmark]: Boogie Preprocessor took 498.05ms. Allocated memory is still 257.9MB. Free memory was 122.1MB in the beginning and 98.4MB in the end (delta: 23.7MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,606 INFO L158 Benchmark]: RCFGBuilder took 9577.92ms. Allocated memory was 257.9MB in the beginning and 956.3MB in the end (delta: 698.4MB). Free memory was 98.4MB in the beginning and 771.0MB in the end (delta: -672.6MB). Peak memory consumption was 496.0MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,606 INFO L158 Benchmark]: CodeCheck took 20509.17ms. Allocated memory was 956.3MB in the beginning and 1.3GB in the end (delta: 339.7MB). Free memory was 771.0MB in the beginning and 640.6MB in the end (delta: 130.4MB). Peak memory consumption was 470.1MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,607 INFO L158 Benchmark]: Witness Printer took 106.16ms. Allocated memory is still 1.3GB. Free memory was 640.6MB in the beginning and 628.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 22:25:37,609 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 8 procedures, 1718 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 45, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16531 SdHoareTripleChecker+Valid, 23.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9607 mSDsluCounter, 23367 SdHoareTripleChecker+Invalid, 20.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14826 mSDsCounter, 5453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19531 IncrementalHoareTripleChecker+Invalid, 24984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5453 mSolverCounterUnsat, 8541 mSDtfsCounter, 19531 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26607 GetRequests, 26092 SyntacticMatches, 173 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55563 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2851 NumberOfCodeBlocks, 2851 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2710 ConstructedInterpolants, 0 QuantifiedInterpolants, 4753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 35 PerfectInterpolantSequences, 972/1017 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) [L11429] COND FALSE !(T1_E == 0) [L11434] COND FALSE !(E_M == 0) [L11439] COND FALSE !(E_1 == 0) [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) [L11457] COND FALSE !(T1_E == 1) [L11462] COND FALSE !(E_M == 1) [L11467] COND FALSE !(E_1 == 1) [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE, EXPR \read(tmp_ndt_1) [L11390] EXPR m_st = 1 [L11391] CALL, EXPR master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET, EXPR master() [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3453.71ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 79.4MB in the beginning and 96.9MB in the end (delta: -17.5MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 464.49ms. Allocated memory was 203.4MB in the beginning and 257.9MB in the end (delta: 54.5MB). Free memory was 96.9MB in the beginning and 122.1MB in the end (delta: -25.2MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 498.05ms. Allocated memory is still 257.9MB. Free memory was 122.1MB in the beginning and 98.4MB in the end (delta: 23.7MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * RCFGBuilder took 9577.92ms. Allocated memory was 257.9MB in the beginning and 956.3MB in the end (delta: 698.4MB). Free memory was 98.4MB in the beginning and 771.0MB in the end (delta: -672.6MB). Peak memory consumption was 496.0MB. Max. memory is 16.1GB. * CodeCheck took 20509.17ms. Allocated memory was 956.3MB in the beginning and 1.3GB in the end (delta: 339.7MB). Free memory was 771.0MB in the beginning and 640.6MB in the end (delta: 130.4MB). Peak memory consumption was 470.1MB. Max. memory is 16.1GB. * Witness Printer took 106.16ms. Allocated memory is still 1.3GB. Free memory was 640.6MB in the beginning and 628.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 22:25:37,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423055d9-fe32-4c52-b580-6cd8904fc213/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