./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:44:54,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:44:54,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:44:54,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:44:54,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:44:54,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:44:54,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:44:54,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:44:54,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:44:54,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:44:54,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:44:54,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:44:54,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:44:54,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:44:54,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:44:54,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:44:54,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:44:54,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:44:54,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:44:54,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:44:54,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:44:54,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:44:54,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:44:54,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:44:54,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:44:54,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:44:54,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:44:54,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:44:54,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:44:54,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:44:54,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:44:54,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:44:54,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:44:54,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:44:54,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:44:54,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:44:54,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:44:54,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:44:54,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:44:54,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:44:54,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:44:54,497 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:44:54,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:44:54,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:44:54,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:44:54,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:44:54,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:44:54,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:44:54,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:44:54,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:44:54,552 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:44:54,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:44:54,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:44:54,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:44:54,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:44:54,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:44:54,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:44:54,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:44:54,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:44:54,556 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:44:54,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:44:54,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:44:54,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:44:54,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:44:54,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:44:54,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:44:54,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:54,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:44:54,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:44:54,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:44:54,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:44:54,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:44:54,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:44:54,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:44:54,562 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:44:54,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:44:54,562 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/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_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e [2022-11-25 15:44:54,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:44:54,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:44:54,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:44:54,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:44:54,988 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:44:54,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2022-11-25 15:44:58,282 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:44:58,566 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:44:58,573 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2022-11-25 15:44:58,593 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/data/4b02f74b9/afdd22650d78443ba0d9a2f75a8ff85d/FLAG5566da199 [2022-11-25 15:44:58,612 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/data/4b02f74b9/afdd22650d78443ba0d9a2f75a8ff85d [2022-11-25 15:44:58,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:44:58,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:44:58,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:58,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:44:58,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:44:58,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:58" (1/1) ... [2022-11-25 15:44:58,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee3b6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:58, skipping insertion in model container [2022-11-25 15:44:58,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:58" (1/1) ... [2022-11-25 15:44:58,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:44:58,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:44:58,908 WARN L237 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_4334277e-f116-41e9-8066-83db68739ebe/sv-benchmarks/c/pthread-wmm/mix032.oepc.i[945,958] [2022-11-25 15:44:59,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:59,289 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:44:59,306 WARN L237 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_4334277e-f116-41e9-8066-83db68739ebe/sv-benchmarks/c/pthread-wmm/mix032.oepc.i[945,958] [2022-11-25 15:44:59,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:59,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:59,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:59,473 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:44:59,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59 WrapperNode [2022-11-25 15:44:59,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:59,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:59,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:44:59,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:44:59,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,558 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-25 15:44:59,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:59,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:44:59,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:44:59,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:44:59,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,591 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:44:59,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:44:59,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:44:59,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:44:59,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (1/1) ... [2022-11-25 15:44:59,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:59,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:59,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:44:59,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:44:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:44:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:44:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:44:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:44:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:44:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:44:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:44:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:44:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:44:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:44:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:44:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:44:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:44:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:44:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:44:59,721 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:44:59,969 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:44:59,972 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:45:00,512 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:45:00,771 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:45:00,771 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:45:00,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:00 BoogieIcfgContainer [2022-11-25 15:45:00,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:45:00,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:45:00,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:45:00,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:45:00,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:44:58" (1/3) ... [2022-11-25 15:45:00,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5e9962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:00, skipping insertion in model container [2022-11-25 15:45:00,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:59" (2/3) ... [2022-11-25 15:45:00,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5e9962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:00, skipping insertion in model container [2022-11-25 15:45:00,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:00" (3/3) ... [2022-11-25 15:45:00,787 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2022-11-25 15:45:00,798 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:45:00,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:45:00,813 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:45:00,813 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:45:00,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:45:00,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-25 15:45:01,075 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-25 15:45:01,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:01,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-25 15:45:01,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-11-25 15:45:01,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-11-25 15:45:01,104 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:45:01,138 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2022-11-25 15:45:01,142 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2022-11-25 15:45:01,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2022-11-25 15:45:01,210 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-25 15:45:01,216 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:01,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-25 15:45:01,222 INFO L119 LiptonReduction]: Number of co-enabled transitions 2516 [2022-11-25 15:45:06,774 INFO L134 LiptonReduction]: Checked pairs total: 6537 [2022-11-25 15:45:06,775 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-25 15:45:06,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:45:06,798 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21726361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:45:06,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 15:45:06,802 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-25 15:45:06,802 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:06,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:06,803 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:45:06,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 521857, now seen corresponding path program 1 times [2022-11-25 15:45:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:06,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989776224] [2022-11-25 15:45:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:07,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989776224] [2022-11-25 15:45:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989776224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:07,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693735054] [2022-11-25 15:45:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:07,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:07,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:07,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:07,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 233 [2022-11-25 15:45:07,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:07,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:07,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 233 [2022-11-25 15:45:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:07,967 INFO L130 PetriNetUnfolder]: 1665/2628 cut-off events. [2022-11-25 15:45:07,968 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-25 15:45:07,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5117 conditions, 2628 events. 1665/2628 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14315 event pairs, 273 based on Foata normal form. 0/2507 useless extension candidates. Maximal degree in co-relation 5106. Up to 1969 conditions per place. [2022-11-25 15:45:07,988 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 37 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2022-11-25 15:45:07,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2022-11-25 15:45:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2022-11-25 15:45:08,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5350500715307582 [2022-11-25 15:45:08,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2022-11-25 15:45:08,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2022-11-25 15:45:08,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:08,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2022-11-25 15:45:08,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,045 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 374 transitions. [2022-11-25 15:45:08,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2022-11-25 15:45:08,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:45:08,053 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2022-11-25 15:45:08,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-11-25 15:45:08,059 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-11-25 15:45:08,060 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2022-11-25 15:45:08,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:08,060 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:08,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:45:08,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1576055261, now seen corresponding path program 1 times [2022-11-25 15:45:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:08,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974958288] [2022-11-25 15:45:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:08,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974958288] [2022-11-25 15:45:08,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974958288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:08,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:08,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380682433] [2022-11-25 15:45:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:08,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:08,451 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 233 [2022-11-25 15:45:08,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:08,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 233 [2022-11-25 15:45:08,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:09,170 INFO L130 PetriNetUnfolder]: 2371/3506 cut-off events. [2022-11-25 15:45:09,170 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-11-25 15:45:09,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7310 conditions, 3506 events. 2371/3506 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15923 event pairs, 1191 based on Foata normal form. 180/3686 useless extension candidates. Maximal degree in co-relation 7300. Up to 2979 conditions per place. [2022-11-25 15:45:09,190 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2022-11-25 15:45:09,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2022-11-25 15:45:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-11-25 15:45:09,193 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48412017167381977 [2022-11-25 15:45:09,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2022-11-25 15:45:09,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2022-11-25 15:45:09,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:09,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2022-11-25 15:45:09,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,199 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 5 states and 564 transitions. [2022-11-25 15:45:09,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2022-11-25 15:45:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:09,201 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2022-11-25 15:45:09,202 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-11-25 15:45:09,202 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-11-25 15:45:09,203 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2022-11-25 15:45:09,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,203 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:09,204 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:09,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:45:09,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1889975779, now seen corresponding path program 1 times [2022-11-25 15:45:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:09,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693561799] [2022-11-25 15:45:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:09,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693561799] [2022-11-25 15:45:09,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693561799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:09,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:09,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990191946] [2022-11-25 15:45:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:09,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:09,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:09,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2022-11-25 15:45:09,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:09,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2022-11-25 15:45:09,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:10,761 INFO L130 PetriNetUnfolder]: 2195/3238 cut-off events. [2022-11-25 15:45:10,761 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2022-11-25 15:45:10,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7995 conditions, 3238 events. 2195/3238 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14617 event pairs, 470 based on Foata normal form. 168/3406 useless extension candidates. Maximal degree in co-relation 7982. Up to 2125 conditions per place. [2022-11-25 15:45:10,780 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 58 selfloop transitions, 13 changer transitions 33/104 dead transitions. [2022-11-25 15:45:10,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 104 transitions, 537 flow [2022-11-25 15:45:10,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:45:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:45:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions. [2022-11-25 15:45:10,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47854077253218885 [2022-11-25 15:45:10,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions. [2022-11-25 15:45:10,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions. [2022-11-25 15:45:10,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:10,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions. [2022-11-25 15:45:10,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:10,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:10,791 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:10,791 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 8 states and 892 transitions. [2022-11-25 15:45:10,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 104 transitions, 537 flow [2022-11-25 15:45:10,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 526 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:10,808 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 189 flow [2022-11-25 15:45:10,808 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=189, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-25 15:45:10,810 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-11-25 15:45:10,810 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 189 flow [2022-11-25 15:45:10,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:10,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:10,811 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:10,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:45:10,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1032453474, now seen corresponding path program 1 times [2022-11-25 15:45:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982300111] [2022-11-25 15:45:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:11,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:11,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982300111] [2022-11-25 15:45:11,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982300111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:11,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:11,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842479969] [2022-11-25 15:45:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:11,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:11,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:11,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:11,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 233 [2022-11-25 15:45:11,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:11,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:11,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 233 [2022-11-25 15:45:11,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:11,597 INFO L130 PetriNetUnfolder]: 1889/2804 cut-off events. [2022-11-25 15:45:11,597 INFO L131 PetriNetUnfolder]: For 3766/3766 co-relation queries the response was YES. [2022-11-25 15:45:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8925 conditions, 2804 events. 1889/2804 cut-off events. For 3766/3766 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12018 event pairs, 459 based on Foata normal form. 120/2924 useless extension candidates. Maximal degree in co-relation 8906. Up to 1777 conditions per place. [2022-11-25 15:45:11,620 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 49 selfloop transitions, 3 changer transitions 20/72 dead transitions. [2022-11-25 15:45:11,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 481 flow [2022-11-25 15:45:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-11-25 15:45:11,623 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48240343347639486 [2022-11-25 15:45:11,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2022-11-25 15:45:11,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2022-11-25 15:45:11,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:11,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2022-11-25 15:45:11,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:11,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:11,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:11,629 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 189 flow. Second operand 5 states and 562 transitions. [2022-11-25 15:45:11,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 481 flow [2022-11-25 15:45:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 466 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:45:11,645 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 191 flow [2022-11-25 15:45:11,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-11-25 15:45:11,646 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-11-25 15:45:11,647 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 191 flow [2022-11-25 15:45:11,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:11,647 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:11,647 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:11,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:45:11,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash -103360285, now seen corresponding path program 1 times [2022-11-25 15:45:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:11,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622837553] [2022-11-25 15:45:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:11,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:11,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622837553] [2022-11-25 15:45:11,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622837553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:11,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:11,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743791631] [2022-11-25 15:45:11,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:11,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:11,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2022-11-25 15:45:11,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:11,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:11,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2022-11-25 15:45:11,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:12,035 INFO L130 PetriNetUnfolder]: 636/1067 cut-off events. [2022-11-25 15:45:12,035 INFO L131 PetriNetUnfolder]: For 1615/1623 co-relation queries the response was YES. [2022-11-25 15:45:12,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 1067 events. 636/1067 cut-off events. For 1615/1623 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4744 event pairs, 137 based on Foata normal form. 78/1139 useless extension candidates. Maximal degree in co-relation 3450. Up to 785 conditions per place. [2022-11-25 15:45:12,045 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 44 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-11-25 15:45:12,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 340 flow [2022-11-25 15:45:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2022-11-25 15:45:12,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5150214592274678 [2022-11-25 15:45:12,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2022-11-25 15:45:12,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2022-11-25 15:45:12,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:12,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2022-11-25 15:45:12,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,051 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 191 flow. Second operand 3 states and 360 transitions. [2022-11-25 15:45:12,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 340 flow [2022-11-25 15:45:12,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 328 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:12,055 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 195 flow [2022-11-25 15:45:12,056 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-11-25 15:45:12,056 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-11-25 15:45:12,057 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 195 flow [2022-11-25 15:45:12,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:12,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:45:12,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -815149038, now seen corresponding path program 1 times [2022-11-25 15:45:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:12,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202055072] [2022-11-25 15:45:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202055072] [2022-11-25 15:45:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202055072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904809059] [2022-11-25 15:45:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:12,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:12,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:12,229 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2022-11-25 15:45:12,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:12,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2022-11-25 15:45:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:12,420 INFO L130 PetriNetUnfolder]: 320/587 cut-off events. [2022-11-25 15:45:12,420 INFO L131 PetriNetUnfolder]: For 699/703 co-relation queries the response was YES. [2022-11-25 15:45:12,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 587 events. 320/587 cut-off events. For 699/703 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2454 event pairs, 88 based on Foata normal form. 56/639 useless extension candidates. Maximal degree in co-relation 2020. Up to 248 conditions per place. [2022-11-25 15:45:12,425 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 55 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2022-11-25 15:45:12,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 439 flow [2022-11-25 15:45:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:45:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:45:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2022-11-25 15:45:12,428 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5160944206008584 [2022-11-25 15:45:12,428 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2022-11-25 15:45:12,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2022-11-25 15:45:12,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:12,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2022-11-25 15:45:12,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,433 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 195 flow. Second operand 4 states and 481 transitions. [2022-11-25 15:45:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 439 flow [2022-11-25 15:45:12,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:12,436 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 231 flow [2022-11-25 15:45:12,437 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-11-25 15:45:12,438 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-11-25 15:45:12,438 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 231 flow [2022-11-25 15:45:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,438 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:12,439 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:12,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:45:12,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1540980333, now seen corresponding path program 1 times [2022-11-25 15:45:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:12,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543793394] [2022-11-25 15:45:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:12,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543793394] [2022-11-25 15:45:12,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543793394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:12,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:12,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044357353] [2022-11-25 15:45:12,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:12,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:12,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:12,723 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2022-11-25 15:45:12,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:12,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2022-11-25 15:45:12,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:12,921 INFO L130 PetriNetUnfolder]: 278/501 cut-off events. [2022-11-25 15:45:12,921 INFO L131 PetriNetUnfolder]: For 876/880 co-relation queries the response was YES. [2022-11-25 15:45:12,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 501 events. 278/501 cut-off events. For 876/880 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2084 event pairs, 84 based on Foata normal form. 13/510 useless extension candidates. Maximal degree in co-relation 1774. Up to 248 conditions per place. [2022-11-25 15:45:12,927 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 52 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2022-11-25 15:45:12,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 463 flow [2022-11-25 15:45:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-11-25 15:45:12,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5047210300429185 [2022-11-25 15:45:12,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2022-11-25 15:45:12,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2022-11-25 15:45:12,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:12,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2022-11-25 15:45:12,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,936 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 231 flow. Second operand 5 states and 588 transitions. [2022-11-25 15:45:12,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 463 flow [2022-11-25 15:45:12,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 423 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:12,943 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 223 flow [2022-11-25 15:45:12,943 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-11-25 15:45:12,944 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-11-25 15:45:12,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 223 flow [2022-11-25 15:45:12,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,945 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:12,945 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:12,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:45:12,946 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash 20178204, now seen corresponding path program 1 times [2022-11-25 15:45:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:12,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225095402] [2022-11-25 15:45:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:13,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:13,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225095402] [2022-11-25 15:45:13,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225095402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:13,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:13,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:13,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984035899] [2022-11-25 15:45:13,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:13,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:13,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:13,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:13,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:13,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2022-11-25 15:45:13,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:13,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:13,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2022-11-25 15:45:13,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:14,187 INFO L130 PetriNetUnfolder]: 475/883 cut-off events. [2022-11-25 15:45:14,188 INFO L131 PetriNetUnfolder]: For 1700/1704 co-relation queries the response was YES. [2022-11-25 15:45:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 883 events. 475/883 cut-off events. For 1700/1704 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4235 event pairs, 63 based on Foata normal form. 1/882 useless extension candidates. Maximal degree in co-relation 3171. Up to 323 conditions per place. [2022-11-25 15:45:14,195 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 53 selfloop transitions, 17 changer transitions 34/106 dead transitions. [2022-11-25 15:45:14,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 106 transitions, 796 flow [2022-11-25 15:45:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:45:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:45:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 904 transitions. [2022-11-25 15:45:14,198 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48497854077253216 [2022-11-25 15:45:14,199 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 904 transitions. [2022-11-25 15:45:14,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 904 transitions. [2022-11-25 15:45:14,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:14,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 904 transitions. [2022-11-25 15:45:14,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,207 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,207 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 223 flow. Second operand 8 states and 904 transitions. [2022-11-25 15:45:14,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 106 transitions, 796 flow [2022-11-25 15:45:14,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 106 transitions, 678 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-11-25 15:45:14,215 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 292 flow [2022-11-25 15:45:14,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2022-11-25 15:45:14,219 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-11-25 15:45:14,219 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 292 flow [2022-11-25 15:45:14,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,220 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:14,220 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:14,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:45:14,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash -827323520, now seen corresponding path program 2 times [2022-11-25 15:45:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:14,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236386799] [2022-11-25 15:45:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:15,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236386799] [2022-11-25 15:45:15,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236386799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:15,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:15,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:45:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780824227] [2022-11-25 15:45:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:15,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:45:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:45:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:45:15,712 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2022-11-25 15:45:15,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 292 flow. Second operand has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:15,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:15,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2022-11-25 15:45:15,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:16,201 INFO L130 PetriNetUnfolder]: 378/778 cut-off events. [2022-11-25 15:45:16,201 INFO L131 PetriNetUnfolder]: For 1660/1694 co-relation queries the response was YES. [2022-11-25 15:45:16,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 778 events. 378/778 cut-off events. For 1660/1694 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3947 event pairs, 85 based on Foata normal form. 34/809 useless extension candidates. Maximal degree in co-relation 3087. Up to 304 conditions per place. [2022-11-25 15:45:16,215 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 58 selfloop transitions, 16 changer transitions 37/116 dead transitions. [2022-11-25 15:45:16,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 116 transitions, 873 flow [2022-11-25 15:45:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:45:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:45:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 912 transitions. [2022-11-25 15:45:16,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4892703862660944 [2022-11-25 15:45:16,219 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 912 transitions. [2022-11-25 15:45:16,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 912 transitions. [2022-11-25 15:45:16,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:16,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 912 transitions. [2022-11-25 15:45:16,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,228 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,228 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 292 flow. Second operand 8 states and 912 transitions. [2022-11-25 15:45:16,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 116 transitions, 873 flow [2022-11-25 15:45:16,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 116 transitions, 867 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:16,240 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 447 flow [2022-11-25 15:45:16,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2022-11-25 15:45:16,242 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2022-11-25 15:45:16,242 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 447 flow [2022-11-25 15:45:16,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,245 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:16,245 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:16,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:45:16,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1601260420, now seen corresponding path program 3 times [2022-11-25 15:45:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:16,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958396601] [2022-11-25 15:45:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:16,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:16,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958396601] [2022-11-25 15:45:16,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958396601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:16,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:16,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782180693] [2022-11-25 15:45:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:16,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2022-11-25 15:45:16,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:16,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2022-11-25 15:45:16,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:16,996 INFO L130 PetriNetUnfolder]: 527/1010 cut-off events. [2022-11-25 15:45:16,996 INFO L131 PetriNetUnfolder]: For 3557/3557 co-relation queries the response was YES. [2022-11-25 15:45:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4557 conditions, 1010 events. 527/1010 cut-off events. For 3557/3557 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5253 event pairs, 98 based on Foata normal form. 1/1011 useless extension candidates. Maximal degree in co-relation 4534. Up to 481 conditions per place. [2022-11-25 15:45:17,003 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 37 selfloop transitions, 3 changer transitions 73/113 dead transitions. [2022-11-25 15:45:17,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 113 transitions, 1022 flow [2022-11-25 15:45:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2022-11-25 15:45:17,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4610668301655426 [2022-11-25 15:45:17,006 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2022-11-25 15:45:17,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2022-11-25 15:45:17,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:17,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2022-11-25 15:45:17,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,013 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,014 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 447 flow. Second operand 7 states and 752 transitions. [2022-11-25 15:45:17,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 113 transitions, 1022 flow [2022-11-25 15:45:17,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 1004 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:17,034 INFO L231 Difference]: Finished difference. Result has 69 places, 34 transitions, 210 flow [2022-11-25 15:45:17,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2022-11-25 15:45:17,036 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2022-11-25 15:45:17,037 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 34 transitions, 210 flow [2022-11-25 15:45:17,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,038 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:17,038 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:17,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:45:17,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1993551568, now seen corresponding path program 4 times [2022-11-25 15:45:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:17,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545818668] [2022-11-25 15:45:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:17,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:45:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:17,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:45:17,216 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:45:17,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 15:45:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 15:45:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 15:45:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 15:45:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 15:45:17,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 15:45:17,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:45:17,221 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:17,229 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:45:17,229 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:45:17,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:45:17 BasicIcfg [2022-11-25 15:45:17,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:45:17,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:45:17,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:45:17,373 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:45:17,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:00" (3/4) ... [2022-11-25 15:45:17,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:45:17,499 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:45:17,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:45:17,500 INFO L158 Benchmark]: Toolchain (without parser) took 18883.40ms. Allocated memory was 174.1MB in the beginning and 339.7MB in the end (delta: 165.7MB). Free memory was 125.9MB in the beginning and 282.0MB in the end (delta: -156.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 15:45:17,501 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:17,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 855.23ms. Allocated memory is still 174.1MB. Free memory was 125.9MB in the beginning and 98.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:17,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.89ms. Allocated memory is still 174.1MB. Free memory was 98.6MB in the beginning and 95.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:45:17,502 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 174.1MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:17,502 INFO L158 Benchmark]: RCFGBuilder took 1176.01ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 94.5MB in the beginning and 194.5MB in the end (delta: -100.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:17,503 INFO L158 Benchmark]: TraceAbstraction took 16595.15ms. Allocated memory was 234.9MB in the beginning and 339.7MB in the end (delta: 104.9MB). Free memory was 193.4MB in the beginning and 294.7MB in the end (delta: -101.3MB). Peak memory consumption was 162.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:17,503 INFO L158 Benchmark]: Witness Printer took 127.06ms. Allocated memory is still 339.7MB. Free memory was 294.7MB in the beginning and 282.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 15:45:17,505 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 855.23ms. Allocated memory is still 174.1MB. Free memory was 125.9MB in the beginning and 98.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.89ms. Allocated memory is still 174.1MB. Free memory was 98.6MB in the beginning and 95.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 174.1MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1176.01ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 94.5MB in the beginning and 194.5MB in the end (delta: -100.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16595.15ms. Allocated memory was 234.9MB in the beginning and 339.7MB in the end (delta: 104.9MB). Free memory was 193.4MB in the beginning and 294.7MB in the end (delta: -101.3MB). Peak memory consumption was 162.3MB. Max. memory is 16.1GB. * Witness Printer took 127.06ms. Allocated memory is still 339.7MB. Free memory was 294.7MB in the beginning and 282.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 129 PlacesBefore, 36 PlacesAfterwards, 121 TransitionsBefore, 27 TransitionsAfterwards, 2516 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 6537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3731, independent: 3539, independent conditional: 0, independent unconditional: 3539, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1876, independent: 1829, independent conditional: 0, independent unconditional: 1829, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1876, independent: 1810, independent conditional: 0, independent unconditional: 1810, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 368, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3731, independent: 1710, independent conditional: 0, independent unconditional: 1710, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1876, unknown conditional: 0, unknown unconditional: 1876] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 200, Positive conditional cache size: 0, Positive unconditional cache size: 200, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t849, ((void *)0), P0, ((void *)0))=-3, t849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t850, ((void *)0), P1, ((void *)0))=-2, t849={5:0}, t850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t851, ((void *)0), P2, ((void *)0))=-1, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L811] 3 a = 1 [L814] 3 __unbuffered_p2_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 539 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1465 IncrementalHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 39 mSDtfsCounter, 1465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=9, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 15:45:17,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4334277e-f116-41e9-8066-83db68739ebe/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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