./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/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_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/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_54326a6b-f3cc-405c-90ed-cbff366cf98b/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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- 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:39:51,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:39:51,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:39:51,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:39:51,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:39:51,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:39:51,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:39:51,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:39:51,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:39:51,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:39:51,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:39:51,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:39:51,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:39:51,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:39:51,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:39:51,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:39:51,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:39:51,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:39:51,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:39:51,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:39:51,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:39:51,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:39:51,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:39:51,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:39:51,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:39:51,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:39:51,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:39:51,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:39:51,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:39:51,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:39:51,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:39:51,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:39:51,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:39:51,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:39:51,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:39:51,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:39:51,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:39:51,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:39:51,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:39:51,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:39:51,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:39:51,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:39:51,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:39:51,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:39:51,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:39:51,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:39:51,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:39:51,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:39:51,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:39:51,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:39:51,507 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:39:51,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:39:51,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:39:51,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:39:51,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:39:51,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:39:51,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:39:51,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:39:51,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:39:51,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:39:51,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:39:51,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:39:51,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:39:51,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:39:51,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:39:51,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:39:51,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:39:51,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:39:51,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:39:51,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:39:51,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:39:51,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:39:51,514 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:39:51,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:39:51,514 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:39:51,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:39:51,515 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_54326a6b-f3cc-405c-90ed-cbff366cf98b/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_54326a6b-f3cc-405c-90ed-cbff366cf98b/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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2022-11-25 15:39:51,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:39:51,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:39:51,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:39:51,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:39:51,912 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:39:51,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 15:39:55,423 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:39:55,830 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:39:55,831 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 15:39:55,846 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/data/f109e543f/bc4a3cf11a404fd5a5a12ed0fc826eb4/FLAG8e0fa35f0 [2022-11-25 15:39:55,864 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/data/f109e543f/bc4a3cf11a404fd5a5a12ed0fc826eb4 [2022-11-25 15:39:55,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:39:55,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:39:55,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:39:55,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:39:55,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:39:55,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:39:55" (1/1) ... [2022-11-25 15:39:55,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303a45ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:55, skipping insertion in model container [2022-11-25 15:39:55,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:39:55" (1/1) ... [2022-11-25 15:39:55,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:39:55,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:39:56,140 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_54326a6b-f3cc-405c-90ed-cbff366cf98b/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-25 15:39:56,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:39:56,502 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:39:56,515 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_54326a6b-f3cc-405c-90ed-cbff366cf98b/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-25 15:39:56,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:56,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:56,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:39:56,617 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:39:56,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56 WrapperNode [2022-11-25 15:39:56,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:39:56,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:39:56,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:39:56,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:39:56,627 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:39:56" (1/1) ... [2022-11-25 15:39:56,643 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:39:56" (1/1) ... [2022-11-25 15:39:56,671 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-25 15:39:56,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:39:56,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:39:56,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:39:56,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:39:56,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,701 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:39:56,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:39:56,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:39:56,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:39:56,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (1/1) ... [2022-11-25 15:39:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:39:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:39:56,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:39:56,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:39:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:39:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:39:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:39:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:39:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:39:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:39:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:39:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:39:56,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:39:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:39:56,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:39:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:39:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:39:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:39:56,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:39:56,829 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:39:57,084 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:39:57,087 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:39:57,527 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:39:57,840 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:39:57,840 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:39:57,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:57 BoogieIcfgContainer [2022-11-25 15:39:57,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:39:57,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:39:57,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:39:57,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:39:57,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:39:55" (1/3) ... [2022-11-25 15:39:57,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a845bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:39:57, skipping insertion in model container [2022-11-25 15:39:57,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:56" (2/3) ... [2022-11-25 15:39:57,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a845bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:39:57, skipping insertion in model container [2022-11-25 15:39:57,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:57" (3/3) ... [2022-11-25 15:39:57,864 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 15:39:57,873 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:39:57,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:39:57,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:39:57,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:39:57,952 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:39:57,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-25 15:39:58,108 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-25 15:39:58,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:58,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 15:39:58,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-25 15:39:58,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-25 15:39:58,127 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:39:58,153 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-25 15:39:58,173 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-25 15:39:58,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-11-25 15:39:58,231 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-25 15:39:58,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:58,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 15:39:58,238 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-11-25 15:40:05,720 INFO L134 LiptonReduction]: Checked pairs total: 5413 [2022-11-25 15:40:05,721 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-25 15:40:05,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:40:05,744 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;@3757c433, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:40:05,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 15:40:05,748 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-25 15:40:05,748 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:40:05,748 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:05,749 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:40:05,749 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:40:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 493210, now seen corresponding path program 1 times [2022-11-25 15:40:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:05,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085909847] [2022-11-25 15:40:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:06,173 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:40:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:06,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085909847] [2022-11-25 15:40:06,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085909847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:06,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:06,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:40:06,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230889423] [2022-11-25 15:40:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:06,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:06,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:06,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 218 [2022-11-25 15:40:06,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:40:06,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:06,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 218 [2022-11-25 15:40:06,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:06,544 INFO L130 PetriNetUnfolder]: 711/1166 cut-off events. [2022-11-25 15:40:06,544 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 15:40:06,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6090 event pairs, 111 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 871 conditions per place. [2022-11-25 15:40:06,561 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-11-25 15:40:06,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2022-11-25 15:40:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:40:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-11-25 15:40:06,586 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.518348623853211 [2022-11-25 15:40:06,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-11-25 15:40:06,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-11-25 15:40:06,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:06,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-11-25 15:40:06,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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:40:06,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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:40:06,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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:40:06,611 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 339 transitions. [2022-11-25 15:40:06,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2022-11-25 15:40:06,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:40:06,619 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-11-25 15:40:06,621 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-25 15:40:06,627 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-25 15:40:06,627 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-11-25 15:40:06,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:40:06,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:06,628 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:06,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:40:06,629 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:40:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash -92866549, now seen corresponding path program 1 times [2022-11-25 15:40:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:06,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586537681] [2022-11-25 15:40:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,184 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:40:07,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:07,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586537681] [2022-11-25 15:40:07,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586537681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:07,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:07,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501722423] [2022-11-25 15:40:07,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:07,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:07,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:07,259 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2022-11-25 15:40:07,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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:40:07,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:07,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2022-11-25 15:40:07,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:07,608 INFO L130 PetriNetUnfolder]: 527/861 cut-off events. [2022-11-25 15:40:07,608 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-25 15:40:07,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 861 events. 527/861 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3932 event pairs, 143 based on Foata normal form. 16/873 useless extension candidates. Maximal degree in co-relation 1775. Up to 609 conditions per place. [2022-11-25 15:40:07,614 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-11-25 15:40:07,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2022-11-25 15:40:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:40:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2022-11-25 15:40:07,616 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4724770642201835 [2022-11-25 15:40:07,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2022-11-25 15:40:07,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2022-11-25 15:40:07,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:07,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2022-11-25 15:40:07,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:40:07,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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:40:07,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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:40:07,621 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 309 transitions. [2022-11-25 15:40:07,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2022-11-25 15:40:07,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:07,623 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-11-25 15:40:07,623 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-25 15:40:07,624 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-25 15:40:07,624 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-11-25 15:40:07,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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:40:07,625 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:07,625 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:07,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:40:07,626 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:40:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1416102843, now seen corresponding path program 1 times [2022-11-25 15:40:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:07,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694360856] [2022-11-25 15:40:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:08,038 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:40:08,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:08,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694360856] [2022-11-25 15:40:08,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694360856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:08,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:08,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841995707] [2022-11-25 15:40:08,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:08,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:08,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:08,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2022-11-25 15:40:08,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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:40:08,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:08,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2022-11-25 15:40:08,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:08,356 INFO L130 PetriNetUnfolder]: 498/805 cut-off events. [2022-11-25 15:40:08,356 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-11-25 15:40:08,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 805 events. 498/805 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3518 event pairs, 165 based on Foata normal form. 12/812 useless extension candidates. Maximal degree in co-relation 1740. Up to 634 conditions per place. [2022-11-25 15:40:08,368 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-11-25 15:40:08,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 137 flow [2022-11-25 15:40:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:40:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2022-11-25 15:40:08,372 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47553516819571867 [2022-11-25 15:40:08,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2022-11-25 15:40:08,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2022-11-25 15:40:08,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:08,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2022-11-25 15:40:08,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:40:08,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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:40:08,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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:40:08,378 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 311 transitions. [2022-11-25 15:40:08,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 137 flow [2022-11-25 15:40:08,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:08,382 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2022-11-25 15:40:08,382 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-11-25 15:40:08,384 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2022-11-25 15:40:08,384 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2022-11-25 15:40:08,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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:40:08,385 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:08,385 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:08,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:40:08,386 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:40:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash 899551318, now seen corresponding path program 1 times [2022-11-25 15:40:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:08,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461979306] [2022-11-25 15:40:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:08,617 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:40:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:08,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461979306] [2022-11-25 15:40:08,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461979306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:08,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:08,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433900112] [2022-11-25 15:40:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:08,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:08,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:08,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2022-11-25 15:40:08,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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:40:08,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:08,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2022-11-25 15:40:08,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:08,943 INFO L130 PetriNetUnfolder]: 810/1304 cut-off events. [2022-11-25 15:40:08,943 INFO L131 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-11-25 15:40:08,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2915 conditions, 1304 events. 810/1304 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6642 event pairs, 201 based on Foata normal form. 45/1339 useless extension candidates. Maximal degree in co-relation 2903. Up to 492 conditions per place. [2022-11-25 15:40:08,949 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 34 selfloop transitions, 3 changer transitions 5/44 dead transitions. [2022-11-25 15:40:08,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 201 flow [2022-11-25 15:40:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:40:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2022-11-25 15:40:08,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 15:40:08,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2022-11-25 15:40:08,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2022-11-25 15:40:08,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:08,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2022-11-25 15:40:08,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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:40:08,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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:40:08,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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:40:08,958 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 4 states and 436 transitions. [2022-11-25 15:40:08,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 201 flow [2022-11-25 15:40:08,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:08,960 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 70 flow [2022-11-25 15:40:08,961 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-11-25 15:40:08,961 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2022-11-25 15:40:08,962 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 70 flow [2022-11-25 15:40:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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:40:08,962 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:08,963 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:08,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:40:08,963 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:40:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1746240656, now seen corresponding path program 1 times [2022-11-25 15:40:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503172004] [2022-11-25 15:40:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:09,163 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:40:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:09,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503172004] [2022-11-25 15:40:09,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503172004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:09,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:09,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:09,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283335558] [2022-11-25 15:40:09,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:09,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:09,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:09,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2022-11-25 15:40:09,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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:40:09,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:09,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2022-11-25 15:40:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:09,452 INFO L130 PetriNetUnfolder]: 598/975 cut-off events. [2022-11-25 15:40:09,452 INFO L131 PetriNetUnfolder]: For 613/614 co-relation queries the response was YES. [2022-11-25 15:40:09,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 975 events. 598/975 cut-off events. For 613/614 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4319 event pairs, 172 based on Foata normal form. 36/1003 useless extension candidates. Maximal degree in co-relation 2236. Up to 354 conditions per place. [2022-11-25 15:40:09,459 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 28 selfloop transitions, 3 changer transitions 5/38 dead transitions. [2022-11-25 15:40:09,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 179 flow [2022-11-25 15:40:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:40:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2022-11-25 15:40:09,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49311926605504586 [2022-11-25 15:40:09,463 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 430 transitions. [2022-11-25 15:40:09,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions. [2022-11-25 15:40:09,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:09,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions. [2022-11-25 15:40:09,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 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:40:09,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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:40:09,468 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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:40:09,469 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 70 flow. Second operand 4 states and 430 transitions. [2022-11-25 15:40:09,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 179 flow [2022-11-25 15:40:09,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 167 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 15:40:09,473 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 72 flow [2022-11-25 15:40:09,474 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-11-25 15:40:09,475 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2022-11-25 15:40:09,475 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 72 flow [2022-11-25 15:40:09,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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:40:09,476 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:09,476 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:40:09,477 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:40:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1253580737, now seen corresponding path program 1 times [2022-11-25 15:40:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:09,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094524892] [2022-11-25 15:40:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:10,364 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:40:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094524892] [2022-11-25 15:40:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094524892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295433564] [2022-11-25 15:40:10,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:10,393 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 218 [2022-11-25 15:40:10,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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:40:10,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:10,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 218 [2022-11-25 15:40:10,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:10,632 INFO L130 PetriNetUnfolder]: 372/601 cut-off events. [2022-11-25 15:40:10,632 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-11-25 15:40:10,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 601 events. 372/601 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2101 event pairs, 168 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 1473. Up to 555 conditions per place. [2022-11-25 15:40:10,636 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 31 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2022-11-25 15:40:10,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 192 flow [2022-11-25 15:40:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:40:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2022-11-25 15:40:10,640 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5057339449541285 [2022-11-25 15:40:10,640 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2022-11-25 15:40:10,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2022-11-25 15:40:10,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:10,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2022-11-25 15:40:10,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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:40:10,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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:40:10,645 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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:40:10,645 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 72 flow. Second operand 4 states and 441 transitions. [2022-11-25 15:40:10,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 192 flow [2022-11-25 15:40:10,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 173 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 15:40:10,649 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 84 flow [2022-11-25 15:40:10,650 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-11-25 15:40:10,650 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2022-11-25 15:40:10,651 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 84 flow [2022-11-25 15:40:10,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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:40:10,651 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:10,652 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:10,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:40:10,652 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:40:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2030386068, now seen corresponding path program 1 times [2022-11-25 15:40:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:10,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540188499] [2022-11-25 15:40:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:11,008 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:40:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540188499] [2022-11-25 15:40:11,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540188499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:11,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:11,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:40:11,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032788751] [2022-11-25 15:40:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:11,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:11,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2022-11-25 15:40:11,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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:40:11,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:11,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2022-11-25 15:40:11,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:11,283 INFO L130 PetriNetUnfolder]: 298/514 cut-off events. [2022-11-25 15:40:11,284 INFO L131 PetriNetUnfolder]: For 210/214 co-relation queries the response was YES. [2022-11-25 15:40:11,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 514 events. 298/514 cut-off events. For 210/214 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2093 event pairs, 63 based on Foata normal form. 49/548 useless extension candidates. Maximal degree in co-relation 1287. Up to 310 conditions per place. [2022-11-25 15:40:11,287 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 28 selfloop transitions, 4 changer transitions 20/56 dead transitions. [2022-11-25 15:40:11,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 286 flow [2022-11-25 15:40:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:40:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:40:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-11-25 15:40:11,291 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4908256880733945 [2022-11-25 15:40:11,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2022-11-25 15:40:11,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2022-11-25 15:40:11,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:11,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2022-11-25 15:40:11,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 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:40:11,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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:40:11,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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:40:11,297 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 84 flow. Second operand 5 states and 535 transitions. [2022-11-25 15:40:11,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 286 flow [2022-11-25 15:40:11,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:11,299 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 114 flow [2022-11-25 15:40:11,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=114, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-11-25 15:40:11,300 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2022-11-25 15:40:11,301 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 114 flow [2022-11-25 15:40:11,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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:40:11,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:11,301 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:11,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:40:11,302 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:40:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 28138960, now seen corresponding path program 1 times [2022-11-25 15:40:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:11,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641786924] [2022-11-25 15:40:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:11,579 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:40:11,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:11,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641786924] [2022-11-25 15:40:11,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641786924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:11,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:11,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:40:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772377390] [2022-11-25 15:40:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:11,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:40:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:40:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:11,600 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2022-11-25 15:40:11,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 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:40:11,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:11,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2022-11-25 15:40:11,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:11,833 INFO L130 PetriNetUnfolder]: 152/294 cut-off events. [2022-11-25 15:40:11,833 INFO L131 PetriNetUnfolder]: For 218/222 co-relation queries the response was YES. [2022-11-25 15:40:11,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 294 events. 152/294 cut-off events. For 218/222 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1049 event pairs, 29 based on Foata normal form. 29/317 useless extension candidates. Maximal degree in co-relation 927. Up to 107 conditions per place. [2022-11-25 15:40:11,836 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 34 selfloop transitions, 7 changer transitions 16/61 dead transitions. [2022-11-25 15:40:11,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 366 flow [2022-11-25 15:40:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:40:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:40:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2022-11-25 15:40:11,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48853211009174313 [2022-11-25 15:40:11,840 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2022-11-25 15:40:11,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2022-11-25 15:40:11,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:11,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2022-11-25 15:40:11,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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:40:11,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 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:40:11,847 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 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:40:11,847 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 114 flow. Second operand 6 states and 639 transitions. [2022-11-25 15:40:11,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 366 flow [2022-11-25 15:40:11,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 360 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:40:11,853 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 164 flow [2022-11-25 15:40:11,854 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-11-25 15:40:11,858 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2022-11-25 15:40:11,858 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 164 flow [2022-11-25 15:40:11,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 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:40:11,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:11,859 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:40:11,860 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:40:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2023185255, now seen corresponding path program 1 times [2022-11-25 15:40:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451295687] [2022-11-25 15:40:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:12,344 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:40:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:12,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451295687] [2022-11-25 15:40:12,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451295687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:12,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:12,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:40:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053086832] [2022-11-25 15:40:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:12,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:12,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2022-11-25 15:40:12,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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:40:12,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:12,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2022-11-25 15:40:12,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:12,574 INFO L130 PetriNetUnfolder]: 98/198 cut-off events. [2022-11-25 15:40:12,576 INFO L131 PetriNetUnfolder]: For 295/299 co-relation queries the response was YES. [2022-11-25 15:40:12,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 198 events. 98/198 cut-off events. For 295/299 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 605 event pairs, 25 based on Foata normal form. 10/205 useless extension candidates. Maximal degree in co-relation 671. Up to 70 conditions per place. [2022-11-25 15:40:12,578 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 31 selfloop transitions, 10 changer transitions 8/53 dead transitions. [2022-11-25 15:40:12,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 361 flow [2022-11-25 15:40:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:40:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:40:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2022-11-25 15:40:12,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47706422018348627 [2022-11-25 15:40:12,583 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2022-11-25 15:40:12,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2022-11-25 15:40:12,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:12,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2022-11-25 15:40:12,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 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:40:12,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 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:40:12,590 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 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:40:12,590 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 164 flow. Second operand 7 states and 728 transitions. [2022-11-25 15:40:12,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 361 flow [2022-11-25 15:40:12,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 316 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-11-25 15:40:12,596 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 160 flow [2022-11-25 15:40:12,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-11-25 15:40:12,600 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2022-11-25 15:40:12,600 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 160 flow [2022-11-25 15:40:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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:40:12,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:12,604 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] [2022-11-25 15:40:12,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:40:12,606 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:40:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash 77859518, now seen corresponding path program 1 times [2022-11-25 15:40:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:12,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56635576] [2022-11-25 15:40:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:13,919 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:40:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:13,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56635576] [2022-11-25 15:40:13,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56635576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:13,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:13,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:40:13,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603879668] [2022-11-25 15:40:13,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:13,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:40:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:13,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:40:13,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:40:14,005 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2022-11-25 15:40:14,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 160 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:40:14,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:14,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2022-11-25 15:40:14,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:14,300 INFO L130 PetriNetUnfolder]: 111/226 cut-off events. [2022-11-25 15:40:14,300 INFO L131 PetriNetUnfolder]: For 346/352 co-relation queries the response was YES. [2022-11-25 15:40:14,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 226 events. 111/226 cut-off events. For 346/352 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 725 event pairs, 7 based on Foata normal form. 7/233 useless extension candidates. Maximal degree in co-relation 774. Up to 127 conditions per place. [2022-11-25 15:40:14,302 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 33 selfloop transitions, 7 changer transitions 18/60 dead transitions. [2022-11-25 15:40:14,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 448 flow [2022-11-25 15:40:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:40:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:40:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2022-11-25 15:40:14,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.481651376146789 [2022-11-25 15:40:14,306 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 630 transitions. [2022-11-25 15:40:14,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 630 transitions. [2022-11-25 15:40:14,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:14,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 630 transitions. [2022-11-25 15:40:14,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 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:40:14,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 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:40:14,313 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 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:40:14,313 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 160 flow. Second operand 6 states and 630 transitions. [2022-11-25 15:40:14,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 448 flow [2022-11-25 15:40:14,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 368 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-25 15:40:14,317 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 151 flow [2022-11-25 15:40:14,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-11-25 15:40:14,318 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-11-25 15:40:14,319 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 151 flow [2022-11-25 15:40:14,319 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:40:14,319 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:14,320 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] [2022-11-25 15:40:14,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:40:14,320 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:40:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1241245130, now seen corresponding path program 2 times [2022-11-25 15:40:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:14,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21604603] [2022-11-25 15:40:14,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:40:14,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:40:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:40:14,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:40:14,491 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:40:14,492 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 15:40:14,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 15:40:14,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 15:40:14,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 15:40:14,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 15:40:14,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 15:40:14,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:40:14,496 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:14,504 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:40:14,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:40:14,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:40:14 BasicIcfg [2022-11-25 15:40:14,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:40:14,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:40:14,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:40:14,574 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:40:14,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:57" (3/4) ... [2022-11-25 15:40:14,577 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:40:14,706 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:40:14,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:40:14,707 INFO L158 Benchmark]: Toolchain (without parser) took 18833.60ms. Allocated memory was 176.2MB in the beginning and 318.8MB in the end (delta: 142.6MB). Free memory was 146.6MB in the beginning and 211.2MB in the end (delta: -64.6MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,707 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 144.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:40:14,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.85ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 119.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.62ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 117.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,708 INFO L158 Benchmark]: Boogie Preprocessor took 39.58ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 115.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,709 INFO L158 Benchmark]: RCFGBuilder took 1130.28ms. Allocated memory is still 176.2MB. Free memory was 115.1MB in the beginning and 143.7MB in the end (delta: -28.6MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,710 INFO L158 Benchmark]: TraceAbstraction took 16727.50ms. Allocated memory was 176.2MB in the beginning and 318.8MB in the end (delta: 142.6MB). Free memory was 142.7MB in the beginning and 221.7MB in the end (delta: -79.0MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,710 INFO L158 Benchmark]: Witness Printer took 132.21ms. Allocated memory is still 318.8MB. Free memory was 221.7MB in the beginning and 211.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:40:14,713 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.28ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 144.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.85ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 119.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.62ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 117.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.58ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 115.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.28ms. Allocated memory is still 176.2MB. Free memory was 115.1MB in the beginning and 143.7MB in the end (delta: -28.6MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16727.50ms. Allocated memory was 176.2MB in the beginning and 318.8MB in the end (delta: 142.6MB). Free memory was 142.7MB in the beginning and 221.7MB in the end (delta: -79.0MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * Witness Printer took 132.21ms. Allocated memory is still 318.8MB. Free memory was 221.7MB in the beginning and 211.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 24 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5413 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2646, independent: 2468, independent conditional: 0, independent unconditional: 2468, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1522, independent: 1459, independent conditional: 0, independent unconditional: 1459, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1522, independent: 1432, independent conditional: 0, independent unconditional: 1432, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 684, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 643, dependent conditional: 0, dependent unconditional: 643, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2646, independent: 1009, independent conditional: 0, independent unconditional: 1009, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1522, unknown conditional: 0, unknown unconditional: 1522] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-3, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-2, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=-1, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 823]: 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: 821]: 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: 825]: 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, 142 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.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 749 IncrementalHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 38 mSDtfsCounter, 749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=8, InterpolantAutomatonStates: 45, 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.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009 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:40:14,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54326a6b-f3cc-405c-90ed-cbff366cf98b/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