./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label45+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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/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_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/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_aa300c53-6e26-451b-a960-62a1f94c9abe/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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 22:06:33,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 22:06:33,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 22:06:33,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 22:06:33,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 22:06:33,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 22:06:33,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 22:06:33,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 22:06:33,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 22:06:33,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 22:06:33,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 22:06:33,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 22:06:33,363 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 22:06:33,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 22:06:33,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 22:06:33,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 22:06:33,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 22:06:33,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 22:06:33,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 22:06:33,366 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 22:06:33,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 22:06:33,368 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 22:06:33,368 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 22:06:33,369 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 22:06:33,369 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 22:06:33,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 22:06:33,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:06:33,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 22:06:33,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 22:06:33,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 22:06:33,371 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 22:06:33,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 22:06:33,372 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 22:06:33,372 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_aa300c53-6e26-451b-a960-62a1f94c9abe/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_aa300c53-6e26-451b-a960-62a1f94c9abe/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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2023-12-02 22:06:33,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 22:06:33,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 22:06:33,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 22:06:33,583 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 22:06:33,583 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 22:06:33,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2023-12-02 22:06:36,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 22:06:36,848 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 22:06:36,849 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2023-12-02 22:06:36,886 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/data/d55831cf6/04e22088c0ce45e7bd4fd1fb5c5db24c/FLAGe90e3225b [2023-12-02 22:06:36,899 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/data/d55831cf6/04e22088c0ce45e7bd4fd1fb5c5db24c [2023-12-02 22:06:36,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 22:06:36,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 22:06:36,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 22:06:36,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 22:06:36,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 22:06:36,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:06:36" (1/1) ... [2023-12-02 22:06:36,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4da7a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:36, skipping insertion in model container [2023-12-02 22:06:36,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:06:36" (1/1) ... [2023-12-02 22:06:37,122 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 22:06:38,873 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_aa300c53-6e26-451b-a960-62a1f94c9abe/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2023-12-02 22:06:38,899 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_aa300c53-6e26-451b-a960-62a1f94c9abe/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2023-12-02 22:06:39,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:06:39,041 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 22:06:40,007 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_aa300c53-6e26-451b-a960-62a1f94c9abe/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2023-12-02 22:06:40,013 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_aa300c53-6e26-451b-a960-62a1f94c9abe/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2023-12-02 22:06:40,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:06:40,094 INFO L206 MainTranslator]: Completed translation [2023-12-02 22:06:40,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40 WrapperNode [2023-12-02 22:06:40,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 22:06:40,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 22:06:40,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 22:06:40,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 22:06:40,103 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:06:40" (1/1) ... [2023-12-02 22:06:40,174 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:06:40" (1/1) ... [2023-12-02 22:06:40,502 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2023-12-02 22:06:40,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 22:06:40,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 22:06:40,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 22:06:40,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 22:06:40,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 22:06:40,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 22:06:40,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 22:06:40,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 22:06:40,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:06:40" (1/1) ... [2023-12-02 22:06:40,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:06:40,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 22:06:40,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/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:06:40,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/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:06:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 22:06:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-02 22:06:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-02 22:06:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-02 22:06:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-02 22:06:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-02 22:06:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-02 22:06:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-02 22:06:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-02 22:06:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-02 22:06:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-02 22:06:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-02 22:06:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-02 22:06:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 22:06:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-02 22:06:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-02 22:06:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 22:06:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 22:06:41,097 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 22:06:41,100 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 22:06:48,390 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 22:06:49,979 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 22:06:49,979 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 22:06:49,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:06:49 BoogieIcfgContainer [2023-12-02 22:06:49,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 22:06:49,983 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 22:06:49,983 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 22:06:49,991 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 22:06:49,991 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:06:49" (1/1) ... [2023-12-02 22:06:49,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 22:06:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2023-12-02 22:06:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2023-12-02 22:06:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:06:50,085 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:50,360 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:06:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2023-12-02 22:06:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2023-12-02 22:06:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:06:50,473 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:50,562 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:06:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2023-12-02 22:06:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2023-12-02 22:06:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:06:50,595 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:50,639 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:06:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2023-12-02 22:06:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2023-12-02 22:06:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 22:06:50,683 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:50,857 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:06:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2023-12-02 22:06:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2023-12-02 22:06:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 22:06:51,273 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:51,362 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:06:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2023-12-02 22:06:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2023-12-02 22:06:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 22:06:51,855 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:51,901 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:06:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2023-12-02 22:06:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2023-12-02 22:06:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 22:06:51,960 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:52,010 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:06:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2023-12-02 22:06:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2023-12-02 22:06:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 22:06:52,044 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:52,254 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:06:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2023-12-02 22:06:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2023-12-02 22:06:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 22:06:53,515 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:53,561 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:06:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2023-12-02 22:06:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2023-12-02 22:06:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 22:06:53,899 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:53,944 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:06:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2023-12-02 22:06:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2023-12-02 22:06:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 22:06:53,980 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:54,015 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:06:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2023-12-02 22:06:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2023-12-02 22:06:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 22:06:54,114 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:54,138 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:06:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2023-12-02 22:06:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2023-12-02 22:06:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 22:06:54,166 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:54,200 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:06:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2023-12-02 22:06:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2023-12-02 22:06:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 22:06:54,227 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:54,303 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:06:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2023-12-02 22:06:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2023-12-02 22:06:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 22:06:54,736 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:54,855 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:06:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2023-12-02 22:06:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2023-12-02 22:06:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 22:06:55,097 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:55,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:55,222 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:06:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1777 states and 3479 transitions. [2023-12-02 22:06:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 3479 transitions. [2023-12-02 22:06:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 22:06:55,257 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:55,422 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:06:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2023-12-02 22:06:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2023-12-02 22:06:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 22:06:55,465 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:55,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:55,510 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:06:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2023-12-02 22:06:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2023-12-02 22:06:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:06:55,618 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:55,662 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:06:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2023-12-02 22:06:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2023-12-02 22:06:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:06:55,723 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:55,940 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:06:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2023-12-02 22:06:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2023-12-02 22:06:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:06:56,369 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:56,528 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:06:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2023-12-02 22:06:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2023-12-02 22:06:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 22:06:57,512 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:57,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:57,565 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:06:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2023-12-02 22:06:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2023-12-02 22:06:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 22:06:58,054 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:58,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:58,106 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:06:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 1798 states and 3526 transitions. [2023-12-02 22:06:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2023-12-02 22:06:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 22:06:58,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:58,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:58,197 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:06:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2023-12-02 22:06:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2023-12-02 22:06:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 22:06:58,234 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:58,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:58,265 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:06:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1795 states and 3515 transitions. [2023-12-02 22:06:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3515 transitions. [2023-12-02 22:06:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 22:06:58,318 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:58,417 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:06:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2023-12-02 22:06:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2023-12-02 22:06:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 22:06:58,996 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:58,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:59,040 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:06:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2023-12-02 22:06:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2023-12-02 22:06:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 22:06:59,073 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:59,104 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:06:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:06:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2023-12-02 22:06:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2023-12-02 22:06:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 22:06:59,872 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:06:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:06:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:06:59,903 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:07:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2023-12-02 22:07:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2023-12-02 22:07:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:00,314 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:07:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-02 22:07:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-02 22:07:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:01,169 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:07:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-02 22:07:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-02 22:07:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:01,220 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:07:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-02 22:07:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-02 22:07:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:01,266 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:07:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-02 22:07:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-02 22:07:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:01,325 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:07:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-02 22:07:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-02 22:07:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:01,395 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 22:07:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-02 22:07:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-02 22:07:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 22:07:01,441 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,472 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:07:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 1829 states and 3578 transitions. [2023-12-02 22:07:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3578 transitions. [2023-12-02 22:07:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 22:07:01,818 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:01,843 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:07:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 1834 states and 3587 transitions. [2023-12-02 22:07:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3587 transitions. [2023-12-02 22:07:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 22:07:01,894 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:02,272 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:07:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1834 states and 3586 transitions. [2023-12-02 22:07:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3586 transitions. [2023-12-02 22:07:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-02 22:07:02,890 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:03,006 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:07:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 1836 states and 3588 transitions. [2023-12-02 22:07:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 3588 transitions. [2023-12-02 22:07:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 22:07:03,274 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:03,309 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:07:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 1843 states and 3602 transitions. [2023-12-02 22:07:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 3602 transitions. [2023-12-02 22:07:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 22:07:04,009 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:04,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:04,043 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:07:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 1847 states and 3608 transitions. [2023-12-02 22:07:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3608 transitions. [2023-12-02 22:07:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 22:07:04,525 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:04,552 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:07:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 1853 states and 3618 transitions. [2023-12-02 22:07:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3618 transitions. [2023-12-02 22:07:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 22:07:04,839 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:04,866 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:07:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1859 states and 3629 transitions. [2023-12-02 22:07:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3629 transitions. [2023-12-02 22:07:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:07:04,918 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:04,945 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:07:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 1861 states and 3632 transitions. [2023-12-02 22:07:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 3632 transitions. [2023-12-02 22:07:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:07:05,230 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:05,267 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:07:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 1866 states and 3641 transitions. [2023-12-02 22:07:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3641 transitions. [2023-12-02 22:07:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:07:05,413 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:05,453 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:07:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 1870 states and 3647 transitions. [2023-12-02 22:07:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 3647 transitions. [2023-12-02 22:07:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 22:07:05,820 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:06,023 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:07:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 1880 states and 3667 transitions. [2023-12-02 22:07:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 3667 transitions. [2023-12-02 22:07:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 22:07:06,944 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:07,202 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:07:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 1900 states and 3725 transitions. [2023-12-02 22:07:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3725 transitions. [2023-12-02 22:07:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 22:07:09,348 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:09,487 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:07:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 1910 states and 3746 transitions. [2023-12-02 22:07:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3746 transitions. [2023-12-02 22:07:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 22:07:10,544 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:07:10,580 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:07:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:07:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 1916 states and 3762 transitions. [2023-12-02 22:07:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3762 transitions. [2023-12-02 22:07:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 22:07:10,944 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:07:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:07:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:07:10,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:07:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:07:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:07:11,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:07:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:07:11,233 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 51 iterations. [2023-12-02 22:07:11,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:07:11,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:07:11,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:07:11,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 10:07:11 ImpRootNode [2023-12-02 22:07:11,338 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 22:07:11,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 22:07:11,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 22:07:11,339 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 22:07:11,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:06:49" (3/4) ... [2023-12-02 22:07:11,340 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 22:07:11,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:07:11,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:07:11,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 22:07:11,439 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 22:07:11,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 22:07:11,440 INFO L158 Benchmark]: Toolchain (without parser) took 34537.55ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 86.6MB in the beginning and 918.1MB in the end (delta: -831.5MB). Peak memory consumption was 224.4MB. Max. memory is 16.1GB. [2023-12-02 22:07:11,441 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 22:07:11,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3191.06ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 86.1MB in the beginning and 73.7MB in the end (delta: 12.4MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2023-12-02 22:07:11,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 406.96ms. Allocated memory was 207.6MB in the beginning and 268.4MB in the end (delta: 60.8MB). Free memory was 73.7MB in the beginning and 104.4MB in the end (delta: -30.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2023-12-02 22:07:11,442 INFO L158 Benchmark]: Boogie Preprocessor took 378.36ms. Allocated memory is still 268.4MB. Free memory was 104.4MB in the beginning and 83.3MB in the end (delta: 21.1MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2023-12-02 22:07:11,442 INFO L158 Benchmark]: RCFGBuilder took 9099.37ms. Allocated memory was 268.4MB in the beginning and 734.0MB in the end (delta: 465.6MB). Free memory was 83.3MB in the beginning and 382.0MB in the end (delta: -298.7MB). Peak memory consumption was 431.8MB. Max. memory is 16.1GB. [2023-12-02 22:07:11,442 INFO L158 Benchmark]: CodeCheck took 21355.67ms. Allocated memory was 734.0MB in the beginning and 1.2GB in the end (delta: 478.2MB). Free memory was 382.0MB in the beginning and 929.6MB in the end (delta: -547.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 22:07:11,442 INFO L158 Benchmark]: Witness Printer took 100.90ms. Allocated memory is still 1.2GB. Free memory was 929.6MB in the beginning and 918.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 22:07:11,444 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: 21.2s, OverallIterations: 51, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19320 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11453 mSDsluCounter, 27650 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17738 mSDsCounter, 6688 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23451 IncrementalHoareTripleChecker+Invalid, 30139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6688 mSolverCounterUnsat, 9912 mSDtfsCounter, 23451 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30781 GetRequests, 30256 SyntacticMatches, 173 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59106 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3301 NumberOfCodeBlocks, 3301 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3154 ConstructedInterpolants, 0 QuantifiedInterpolants, 5407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 41 PerfectInterpolantSequences, 1182/1227 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.20ms. Allocated memory is still 104.9MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3191.06ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 86.1MB in the beginning and 73.7MB in the end (delta: 12.4MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 406.96ms. Allocated memory was 207.6MB in the beginning and 268.4MB in the end (delta: 60.8MB). Free memory was 73.7MB in the beginning and 104.4MB in the end (delta: -30.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 378.36ms. Allocated memory is still 268.4MB. Free memory was 104.4MB in the beginning and 83.3MB in the end (delta: 21.1MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * RCFGBuilder took 9099.37ms. Allocated memory was 268.4MB in the beginning and 734.0MB in the end (delta: 465.6MB). Free memory was 83.3MB in the beginning and 382.0MB in the end (delta: -298.7MB). Peak memory consumption was 431.8MB. Max. memory is 16.1GB. * CodeCheck took 21355.67ms. Allocated memory was 734.0MB in the beginning and 1.2GB in the end (delta: 478.2MB). Free memory was 382.0MB in the beginning and 929.6MB in the end (delta: -547.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 100.90ms. Allocated memory is still 1.2GB. Free memory was 929.6MB in the beginning and 918.1MB in the end (delta: 11.5MB). 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:07:11,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa300c53-6e26-451b-a960-62a1f94c9abe/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