./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:21:16,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:21:16,955 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:21:16,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:21:16,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:21:17,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:21:17,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:21:17,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:21:17,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:21:17,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:21:17,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:21:17,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:21:17,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:21:17,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:21:17,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:21:17,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:21:17,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:21:17,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:21:17,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:21:17,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:21:17,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:21:17,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:21:17,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:21:17,018 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:21:17,018 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:21:17,019 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:21:17,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:21:17,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:21:17,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:21:17,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:21:17,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:21:17,022 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:21:17,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:21:17,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2024-11-09 00:21:17,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:21:17,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:21:17,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:21:17,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:21:17,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:21:17,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-09 00:21:19,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:21:20,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:21:20,278 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2024-11-09 00:21:20,355 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/data/6bb8dfb38/faadf5e1699d43f895b0b6325e27a540/FLAG47e8efc22 [2024-11-09 00:21:20,370 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/data/6bb8dfb38/faadf5e1699d43f895b0b6325e27a540 [2024-11-09 00:21:20,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:21:20,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:21:20,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:20,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:21:20,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:21:20,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:20" (1/1) ... [2024-11-09 00:21:20,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cb6739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:20, skipping insertion in model container [2024-11-09 00:21:20,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:20" (1/1) ... [2024-11-09 00:21:20,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:21:22,974 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_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-11-09 00:21:23,007 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_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-11-09 00:21:23,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:23,223 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:21:24,491 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_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-11-09 00:21:24,495 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_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-11-09 00:21:24,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:24,570 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:21:24,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24 WrapperNode [2024-11-09 00:21:24,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:24,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:24,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:21:24,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:21:24,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,164 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-09 00:21:25,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:25,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:21:25,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:21:25,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:21:25,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:21:25,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:21:25,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:21:25,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:21:25,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:25,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:21:25,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:21:25,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:21:25,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:21:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:21:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-09 00:21:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-09 00:21:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-09 00:21:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-09 00:21:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-09 00:21:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-09 00:21:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-09 00:21:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-09 00:21:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-09 00:21:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-09 00:21:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-09 00:21:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-09 00:21:26,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:21:26,017 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-09 00:21:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-09 00:21:26,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:21:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:21:26,191 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:21:26,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:21:35,856 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-09 00:21:35,857 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:21:38,479 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:21:38,480 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 00:21:38,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:38 BoogieIcfgContainer [2024-11-09 00:21:38,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:21:38,481 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:21:38,481 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:21:38,491 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:21:38,492 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:38" (1/1) ... [2024-11-09 00:21:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2024-11-09 00:21:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2024-11-09 00:21:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:21:38,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:39,033 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-09 00:21:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2024-11-09 00:21:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2024-11-09 00:21:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:21:39,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:39,317 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-09 00:21:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2024-11-09 00:21:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2024-11-09 00:21:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:21:39,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:39,459 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-09 00:21:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2024-11-09 00:21:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2024-11-09 00:21:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 00:21:39,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:39,783 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-09 00:21:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2024-11-09 00:21:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2024-11-09 00:21:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 00:21:40,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:40,513 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-09 00:21:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2024-11-09 00:21:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2024-11-09 00:21:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:21:41,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:41,207 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-09 00:21:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2024-11-09 00:21:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2024-11-09 00:21:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:21:41,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:41,400 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-09 00:21:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2024-11-09 00:21:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2024-11-09 00:21:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 00:21:41,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:41,713 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-09 00:21:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2024-11-09 00:21:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2024-11-09 00:21:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 00:21:43,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:43,365 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-09 00:21:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2024-11-09 00:21:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2024-11-09 00:21:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 00:21:43,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:43,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:43,878 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-09 00:21:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2024-11-09 00:21:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2024-11-09 00:21:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 00:21:43,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:44,019 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-09 00:21:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2024-11-09 00:21:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2024-11-09 00:21:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 00:21:44,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:44,160 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-09 00:21:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2024-11-09 00:21:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2024-11-09 00:21:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 00:21:44,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:44,224 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-09 00:21:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2024-11-09 00:21:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2024-11-09 00:21:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 00:21:44,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:44,343 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-09 00:21:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2024-11-09 00:21:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2024-11-09 00:21:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:21:44,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:44,962 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-09 00:21:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2024-11-09 00:21:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2024-11-09 00:21:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 00:21:45,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,334 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-09 00:21:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1776 states and 3477 transitions. [2024-11-09 00:21:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 3477 transitions. [2024-11-09 00:21:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 00:21:45,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,472 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-09 00:21:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2024-11-09 00:21:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2024-11-09 00:21:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 00:21:45,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,546 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-09 00:21:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2024-11-09 00:21:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2024-11-09 00:21:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 00:21:45,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,704 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-09 00:21:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2024-11-09 00:21:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2024-11-09 00:21:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 00:21:45,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:45,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,942 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-09 00:21:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2024-11-09 00:21:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2024-11-09 00:21:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 00:21:46,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,608 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-09 00:21:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2024-11-09 00:21:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2024-11-09 00:21:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 00:21:47,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,843 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-09 00:21:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2024-11-09 00:21:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2024-11-09 00:21:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:21:48,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,522 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-09 00:21:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 1798 states and 3526 transitions. [2024-11-09 00:21:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2024-11-09 00:21:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:21:48,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,626 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-09 00:21:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2024-11-09 00:21:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2024-11-09 00:21:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:21:48,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,901 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-09 00:21:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1803 states and 3531 transitions. [2024-11-09 00:21:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3531 transitions. [2024-11-09 00:21:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:21:49,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:49,652 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-09 00:21:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2024-11-09 00:21:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2024-11-09 00:21:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 00:21:49,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:49,763 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-09 00:21:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2024-11-09 00:21:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2024-11-09 00:21:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:21:49,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:49,834 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-09 00:21:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2024-11-09 00:21:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2024-11-09 00:21:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:21:50,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:50,701 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-09 00:21:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2024-11-09 00:21:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2024-11-09 00:21:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:21:51,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:51,298 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-09 00:21:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 1817 states and 3554 transitions. [2024-11-09 00:21:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 3554 transitions. [2024-11-09 00:21:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 00:21:51,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:51,819 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-09 00:21:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 1822 states and 3563 transitions. [2024-11-09 00:21:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3563 transitions. [2024-11-09 00:21:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 00:21:51,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:52,346 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-09 00:21:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 1822 states and 3562 transitions. [2024-11-09 00:21:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3562 transitions. [2024-11-09 00:21:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 00:21:53,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:53,119 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-09 00:21:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 1839 states and 3597 transitions. [2024-11-09 00:21:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 3597 transitions. [2024-11-09 00:21:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 00:21:54,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:54,816 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-09 00:21:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 1843 states and 3603 transitions. [2024-11-09 00:21:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 3603 transitions. [2024-11-09 00:21:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:21:55,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:55,631 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-09 00:21:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 1845 states and 3605 transitions. [2024-11-09 00:21:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3605 transitions. [2024-11-09 00:21:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 00:21:55,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:56,027 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-09 00:21:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 1851 states and 3615 transitions. [2024-11-09 00:21:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3615 transitions. [2024-11-09 00:21:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 00:21:56,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:56,432 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-09 00:21:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 1857 states and 3626 transitions. [2024-11-09 00:21:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 3626 transitions. [2024-11-09 00:21:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:21:56,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:56,571 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-09 00:21:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1859 states and 3629 transitions. [2024-11-09 00:21:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3629 transitions. [2024-11-09 00:21:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:21:57,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:57,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:57,108 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-09 00:21:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 1864 states and 3638 transitions. [2024-11-09 00:21:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3638 transitions. [2024-11-09 00:21:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:21:57,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:57,381 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-09 00:21:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 1868 states and 3644 transitions. [2024-11-09 00:21:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3644 transitions. [2024-11-09 00:21:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:21:57,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:58,203 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-09 00:21:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 1878 states and 3664 transitions. [2024-11-09 00:21:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 3664 transitions. [2024-11-09 00:21:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:21:59,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:59,892 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-09 00:22:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 1898 states and 3721 transitions. [2024-11-09 00:22:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 3721 transitions. [2024-11-09 00:22:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 00:22:02,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:02,904 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-09 00:22:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 1908 states and 3742 transitions. [2024-11-09 00:22:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3742 transitions. [2024-11-09 00:22:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 00:22:04,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:04,291 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-09 00:22:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 1914 states and 3758 transitions. [2024-11-09 00:22:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 3758 transitions. [2024-11-09 00:22:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 00:22:04,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 00:22:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 1919 states and 3767 transitions. [2024-11-09 00:22:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3767 transitions. [2024-11-09 00:22:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 00:22:05,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 00:22:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 1924 states and 3775 transitions. [2024-11-09 00:22:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3775 transitions. [2024-11-09 00:22:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:22:05,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:05,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:22:05,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:22:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:22:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:22:05,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:22:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:22:05,894 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2024-11-09 00:22:05,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:22:05 ImpRootNode [2024-11-09 00:22:05,981 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:22:05,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:22:05,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:22:05,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:22:05,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:38" (3/4) ... [2024-11-09 00:22:05,984 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:22:06,112 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:22:06,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:22:06,117 INFO L158 Benchmark]: Toolchain (without parser) took 45738.38ms. Allocated memory was 138.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 63.9MB in the beginning and 1.0GB in the end (delta: -966.1MB). Peak memory consumption was 679.1MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,117 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:22:06,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4195.61ms. Allocated memory was 138.4MB in the beginning and 241.2MB in the end (delta: 102.8MB). Free memory was 63.9MB in the beginning and 129.3MB in the end (delta: -65.4MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 593.56ms. Allocated memory is still 241.2MB. Free memory was 129.3MB in the beginning and 92.7MB in the end (delta: 36.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,118 INFO L158 Benchmark]: Boogie Preprocessor took 698.02ms. Allocated memory was 241.2MB in the beginning and 482.3MB in the end (delta: 241.2MB). Free memory was 92.7MB in the beginning and 325.2MB in the end (delta: -232.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,119 INFO L158 Benchmark]: RCFGBuilder took 12615.80ms. Allocated memory was 482.3MB in the beginning and 1.1GB in the end (delta: 643.8MB). Free memory was 325.2MB in the beginning and 747.9MB in the end (delta: -422.7MB). Peak memory consumption was 680.5MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,119 INFO L158 Benchmark]: CodeCheck took 27500.05ms. Allocated memory was 1.1GB in the beginning and 1.8GB in the end (delta: 656.4MB). Free memory was 747.9MB in the beginning and 1.0GB in the end (delta: -295.7MB). Peak memory consumption was 360.7MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,119 INFO L158 Benchmark]: Witness Printer took 130.18ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:22:06,121 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: 27.4s, OverallIterations: 47, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17991 SdHoareTripleChecker+Valid, 36.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10653 mSDsluCounter, 25646 SdHoareTripleChecker+Invalid, 30.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16559 mSDsCounter, 5943 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21450 IncrementalHoareTripleChecker+Invalid, 27393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5943 mSolverCounterUnsat, 9087 mSDtfsCounter, 21450 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28503 GetRequests, 27975 SyntacticMatches, 178 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59136 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3027 NumberOfCodeBlocks, 3027 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2884 ConstructedInterpolants, 0 QuantifiedInterpolants, 4963 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 1094/1139 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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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 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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4195.61ms. Allocated memory was 138.4MB in the beginning and 241.2MB in the end (delta: 102.8MB). Free memory was 63.9MB in the beginning and 129.3MB in the end (delta: -65.4MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 593.56ms. Allocated memory is still 241.2MB. Free memory was 129.3MB in the beginning and 92.7MB in the end (delta: 36.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 698.02ms. Allocated memory was 241.2MB in the beginning and 482.3MB in the end (delta: 241.2MB). Free memory was 92.7MB in the beginning and 325.2MB in the end (delta: -232.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * RCFGBuilder took 12615.80ms. Allocated memory was 482.3MB in the beginning and 1.1GB in the end (delta: 643.8MB). Free memory was 325.2MB in the beginning and 747.9MB in the end (delta: -422.7MB). Peak memory consumption was 680.5MB. Max. memory is 16.1GB. * CodeCheck took 27500.05ms. Allocated memory was 1.1GB in the beginning and 1.8GB in the end (delta: 656.4MB). Free memory was 747.9MB in the beginning and 1.0GB in the end (delta: -295.7MB). Peak memory consumption was 360.7MB. Max. memory is 16.1GB. * Witness Printer took 130.18ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:22:06,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd9ca73-262f-4bd4-af3e-2040ce5fc0e8/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE