./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm --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 cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:18:10,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:18:10,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:18:10,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:18:10,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:18:10,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:18:10,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:18:10,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:18:10,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:18:10,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:18:10,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:18:10,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:18:10,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:18:10,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:18:10,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:18:10,238 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:18:10,238 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:18:10,238 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:18:10,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:18:10,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:18:10,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:18:10,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:18:10,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:18:10,240 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:18:10,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:18:10,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm 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 -> cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 [2024-11-13 20:18:10,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:18:10,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:18:10,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:18:10,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:18:10,587 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:18:10,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-13 20:18:12,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:18:13,522 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:18:13,524 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2024-11-13 20:18:13,594 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/data/3c31eb697/0085477a1fda4842b3b95b85f144b347/FLAG6050e09b8 [2024-11-13 20:18:13,653 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/data/3c31eb697/0085477a1fda4842b3b95b85f144b347 [2024-11-13 20:18:13,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:18:13,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:18:13,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:18:13,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:18:13,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:18:13,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:18:13" (1/1) ... [2024-11-13 20:18:13,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2332eac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:13, skipping insertion in model container [2024-11-13 20:18:13,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:18:13" (1/1) ... [2024-11-13 20:18:13,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:18:15,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2024-11-13 20:18:15,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2024-11-13 20:18:16,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:18:16,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:18:17,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2024-11-13 20:18:17,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2024-11-13 20:18:17,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:18:17,267 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:18:17,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17 WrapperNode [2024-11-13 20:18:17,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:18:17,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:18:17,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:18:17,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:18:17,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:17,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:17,837 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-13 20:18:17,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:18:17,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:18:17,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:18:17,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:18:17,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:17,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:17,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:17,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:18,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:18,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:18,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:18,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:18,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:18:18,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:18:18,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:18:18,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:18:18,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:18:17" (1/1) ... [2024-11-13 20:18:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:18:18,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:18:18,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:18:18,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:18:18,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:18:18,563 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-13 20:18:18,563 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-13 20:18:18,563 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-13 20:18:18,564 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-13 20:18:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-13 20:18:18,564 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-13 20:18:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-13 20:18:18,564 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-13 20:18:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-13 20:18:18,564 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-13 20:18:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-13 20:18:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-13 20:18:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:18:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-13 20:18:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-13 20:18:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:18:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:18:18,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:18:18,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:18:30,248 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-13 20:18:30,248 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:18:32,643 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:18:32,645 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 20:18:32,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:18:32 BoogieIcfgContainer [2024-11-13 20:18:32,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:18:32,647 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:18:32,647 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:18:32,657 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:18:32,658 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:18:32" (1/1) ... [2024-11-13 20:18:32,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:18:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2024-11-13 20:18:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2024-11-13 20:18:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:18:32,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2024-11-13 20:18:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2024-11-13 20:18:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:18:33,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2024-11-13 20:18:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2024-11-13 20:18:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:18:33,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2024-11-13 20:18:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2024-11-13 20:18:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 20:18:33,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:18:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2024-11-13 20:18:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2024-11-13 20:18:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 20:18:34,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 20:18:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2024-11-13 20:18:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2024-11-13 20:18:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 20:18:35,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 20:18:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2024-11-13 20:18:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2024-11-13 20:18:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 20:18:35,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 20:18:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2024-11-13 20:18:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2024-11-13 20:18:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 20:18:35,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:18:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2024-11-13 20:18:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2024-11-13 20:18:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 20:18:37,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:18:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2024-11-13 20:18:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2024-11-13 20:18:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 20:18:37,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:18:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2024-11-13 20:18:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2024-11-13 20:18:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 20:18:37,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:18:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2024-11-13 20:18:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2024-11-13 20:18:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 20:18:38,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:18:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2024-11-13 20:18:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2024-11-13 20:18:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 20:18:38,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:18:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2024-11-13 20:18:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2024-11-13 20:18:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 20:18:38,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:18:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2024-11-13 20:18:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2024-11-13 20:18:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 20:18:39,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2024-11-13 20:18:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2024-11-13 20:18:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 20:18:39,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:18:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1776 states and 3477 transitions. [2024-11-13 20:18:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 3477 transitions. [2024-11-13 20:18:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 20:18:39,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2024-11-13 20:18:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2024-11-13 20:18:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 20:18:39,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 20:18:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2024-11-13 20:18:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2024-11-13 20:18:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:18:40,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:18:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2024-11-13 20:18:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2024-11-13 20:18:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:18:40,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:18:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2024-11-13 20:18:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2024-11-13 20:18:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:18:41,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:18:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2024-11-13 20:18:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2024-11-13 20:18:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:18:42,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:18:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2024-11-13 20:18:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2024-11-13 20:18:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 20:18:43,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:18:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 1798 states and 3526 transitions. [2024-11-13 20:18:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2024-11-13 20:18:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 20:18:43,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:18:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2024-11-13 20:18:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2024-11-13 20:18:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 20:18:43,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:18:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1803 states and 3531 transitions. [2024-11-13 20:18:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3531 transitions. [2024-11-13 20:18:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 20:18:44,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:18:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2024-11-13 20:18:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2024-11-13 20:18:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 20:18:45,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:18:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2024-11-13 20:18:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2024-11-13 20:18:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 20:18:45,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:18:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2024-11-13 20:18:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2024-11-13 20:18:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 20:18:46,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:18:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2024-11-13 20:18:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2024-11-13 20:18:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:18:46,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 20:18:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 20:18:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:18:48,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 20:18:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 20:18:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:18:48,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 20:18:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 20:18:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:18:48,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 20:18:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 20:18:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:18:48,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:18:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 20:18:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 20:18:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:18:48,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:18:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 1829 states and 3578 transitions. [2024-11-13 20:18:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3578 transitions. [2024-11-13 20:18:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 20:18:49,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 20:18:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 1834 states and 3587 transitions. [2024-11-13 20:18:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3587 transitions. [2024-11-13 20:18:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 20:18:49,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:18:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1834 states and 3586 transitions. [2024-11-13 20:18:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3586 transitions. [2024-11-13 20:18:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:18:50,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:18:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 1841 states and 3600 transitions. [2024-11-13 20:18:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3600 transitions. [2024-11-13 20:18:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:18:51,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:18:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 1845 states and 3606 transitions. [2024-11-13 20:18:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3606 transitions. [2024-11-13 20:18:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 20:18:52,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:18:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 1847 states and 3608 transitions. [2024-11-13 20:18:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3608 transitions. [2024-11-13 20:18:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:18:52,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:18:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 1853 states and 3618 transitions. [2024-11-13 20:18:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3618 transitions. [2024-11-13 20:18:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:18:52,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:18:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1859 states and 3629 transitions. [2024-11-13 20:18:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3629 transitions. [2024-11-13 20:18:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:18:52,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:18:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 1864 states and 3637 transitions. [2024-11-13 20:18:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3637 transitions. [2024-11-13 20:18:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:18:53,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 20:18:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 1870 states and 3646 transitions. [2024-11-13 20:18:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 3646 transitions. [2024-11-13 20:18:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:18:54,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:18:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 1880 states and 3666 transitions. [2024-11-13 20:18:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 3666 transitions. [2024-11-13 20:18:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:18:55,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:18:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 1900 states and 3723 transitions. [2024-11-13 20:18:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3723 transitions. [2024-11-13 20:18:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:18:58,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:19:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 1910 states and 3744 transitions. [2024-11-13 20:19:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3744 transitions. [2024-11-13 20:19:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:19:00,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:19:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 1916 states and 3760 transitions. [2024-11-13 20:19:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3760 transitions. [2024-11-13 20:19:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:19:00,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:19:00,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:19:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:19:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:19:01,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:19:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:19:01,327 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2024-11-13 20:19:01,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:19:01 ImpRootNode [2024-11-13 20:19:01,472 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:19:01,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:19:01,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:19:01,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:19:01,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:18:32" (3/4) ... [2024-11-13 20:19:01,477 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:19:01,619 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:19:01,620 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:19:01,621 INFO L158 Benchmark]: Toolchain (without parser) took 47963.68ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 57.6MB in the beginning and 1.0GB in the end (delta: -976.7MB). Peak memory consumption was 633.4MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,622 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:19:01,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3608.87ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 57.6MB in the beginning and 60.6MB in the end (delta: -3.1MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 568.26ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 60.6MB in the beginning and 205.6MB in the end (delta: -145.0MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,623 INFO L158 Benchmark]: Boogie Preprocessor took 641.08ms. Allocated memory is still 343.9MB. Free memory was 205.6MB in the beginning and 163.8MB in the end (delta: 41.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,624 INFO L158 Benchmark]: RCFGBuilder took 14165.28ms. Allocated memory was 343.9MB in the beginning and 973.1MB in the end (delta: 629.1MB). Free memory was 163.8MB in the beginning and 682.0MB in the end (delta: -518.3MB). Peak memory consumption was 592.5MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,625 INFO L158 Benchmark]: CodeCheck took 28825.23ms. Allocated memory was 973.1MB in the beginning and 1.7GB in the end (delta: 755.0MB). Free memory was 682.0MB in the beginning and 1.0GB in the end (delta: -365.6MB). Peak memory consumption was 385.2MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,626 INFO L158 Benchmark]: Witness Printer took 148.06ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:19:01,628 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: 28.6s, OverallIterations: 49, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18348 SdHoareTripleChecker+Valid, 39.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10843 mSDsluCounter, 26252 SdHoareTripleChecker+Invalid, 32.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16784 mSDsCounter, 6336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22168 IncrementalHoareTripleChecker+Invalid, 28504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6336 mSolverCounterUnsat, 9468 mSDtfsCounter, 22168 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29250 GetRequests, 28729 SyntacticMatches, 169 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59005 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3133 NumberOfCodeBlocks, 3133 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2988 ConstructedInterpolants, 0 QuantifiedInterpolants, 5168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 39 PerfectInterpolantSequences, 1091/1136 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, 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, 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, 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, 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, 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, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\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, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL 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 transmit1() [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, 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, 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, token=0] [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 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 master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL 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 transmit1() [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, 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, 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, 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, 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.44ms. Allocated memory is still 83.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3608.87ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 57.6MB in the beginning and 60.6MB in the end (delta: -3.1MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 568.26ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 60.6MB in the beginning and 205.6MB in the end (delta: -145.0MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 641.08ms. Allocated memory is still 343.9MB. Free memory was 205.6MB in the beginning and 163.8MB in the end (delta: 41.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * RCFGBuilder took 14165.28ms. Allocated memory was 343.9MB in the beginning and 973.1MB in the end (delta: 629.1MB). Free memory was 163.8MB in the beginning and 682.0MB in the end (delta: -518.3MB). Peak memory consumption was 592.5MB. Max. memory is 16.1GB. * CodeCheck took 28825.23ms. Allocated memory was 973.1MB in the beginning and 1.7GB in the end (delta: 755.0MB). Free memory was 682.0MB in the beginning and 1.0GB in the end (delta: -365.6MB). Peak memory consumption was 385.2MB. Max. memory is 16.1GB. * Witness Printer took 148.06ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:19:01,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a771d2-64f3-4191-aab1-b9c7b0f9e18a/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE