./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_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_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/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_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/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_a910000e-8fed-46aa-8307-5b3171af9e5d/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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- 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 16:59:13,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:59:13,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:59:13,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:59:13,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:59:13,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:59:13,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:59:13,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:59:13,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:59:13,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:59:13,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:59:13,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:59:13,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:59:13,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:59:13,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:59:13,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:59:13,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:59:13,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:59:13,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:59:13,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:59:13,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:59:13,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:59:13,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:59:13,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:59:13,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:59:13,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:59:13,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:59:13,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:59:13,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:59:13,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:59:13,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:59:13,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:59:14,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:59:14,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:59:14,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:59:14,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:59:14,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:59:14,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:59:14,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:59:14,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:59:14,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:59:14,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:59:14,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:59:14,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:59:14,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:59:14,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:59:14,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:59:14,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:59:14,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:59:14,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:59:14,074 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:59:14,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:59:14,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:59:14,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:59:14,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:59:14,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:59:14,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:59:14,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:59:14,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:59:14,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:59:14,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:59:14,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:59:14,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:59:14,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:59:14,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:59:14,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:59:14,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:59:14,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:59:14,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:59:14,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:59:14,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:59:14,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:59:14,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:59:14,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:59:14,080 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:59:14,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:59:14,080 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_a910000e-8fed-46aa-8307-5b3171af9e5d/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_a910000e-8fed-46aa-8307-5b3171af9e5d/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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2022-11-25 16:59:14,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:59:14,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:59:14,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:59:14,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:59:14,433 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:59:14,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-11-25 16:59:17,389 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:59:17,763 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:59:17,771 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-11-25 16:59:17,805 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/data/f1ea6f40f/fb0947c8da0e484cac16dcfbc3ae4f69/FLAG90b543e72 [2022-11-25 16:59:17,840 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/data/f1ea6f40f/fb0947c8da0e484cac16dcfbc3ae4f69 [2022-11-25 16:59:17,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:59:17,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:59:17,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:59:17,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:59:17,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:59:17,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:59:17" (1/1) ... [2022-11-25 16:59:17,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5874306b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:17, skipping insertion in model container [2022-11-25 16:59:17,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:59:17" (1/1) ... [2022-11-25 16:59:17,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:59:17,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:59:18,102 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_a910000e-8fed-46aa-8307-5b3171af9e5d/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-11-25 16:59:18,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:59:18,389 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:59:18,406 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_a910000e-8fed-46aa-8307-5b3171af9e5d/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-11-25 16:59:18,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:59:18,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:59:18,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:59:18,564 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:59:18,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18 WrapperNode [2022-11-25 16:59:18,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:59:18,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:59:18,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:59:18,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:59:18,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,637 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 16:59:18,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:59:18,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:59:18,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:59:18,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:59:18,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,687 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:59:18,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:59:18,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:59:18,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:59:18,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (1/1) ... [2022-11-25 16:59:18,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:59:18,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:59:18,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:59:18,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:59:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:59:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:59:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:59:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:59:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:59:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:59:18,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:59:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:59:18,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:59:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:59:18,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:59:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 16:59:18,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 16:59:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:59:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:59:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:59:18,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:59:18,792 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 16:59:19,008 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:59:19,011 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:59:19,452 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:59:19,595 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:59:19,595 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:59:19,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:59:19 BoogieIcfgContainer [2022-11-25 16:59:19,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:59:19,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:59:19,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:59:19,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:59:19,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:59:17" (1/3) ... [2022-11-25 16:59:19,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bf8851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:59:19, skipping insertion in model container [2022-11-25 16:59:19,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:18" (2/3) ... [2022-11-25 16:59:19,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bf8851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:59:19, skipping insertion in model container [2022-11-25 16:59:19,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:59:19" (3/3) ... [2022-11-25 16:59:19,608 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2022-11-25 16:59:19,618 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:59:19,630 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:59:19,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:59:19,630 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:59:19,695 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:59:19,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-25 16:59:19,827 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-25 16:59:19,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:59:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-25 16:59:19,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-25 16:59:19,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-25 16:59:19,842 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:59:19,858 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-25 16:59:19,861 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-25 16:59:19,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-11-25 16:59:19,901 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-25 16:59:19,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:59:19,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-25 16:59:19,905 INFO L119 LiptonReduction]: Number of co-enabled transitions 3076 [2022-11-25 16:59:25,334 INFO L134 LiptonReduction]: Checked pairs total: 7966 [2022-11-25 16:59:25,335 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-25 16:59:25,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:59:25,377 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;@7d28a23e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:59:25,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 16:59:25,388 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-11-25 16:59:25,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:59:25,388 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:25,389 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:25,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash 611020864, now seen corresponding path program 1 times [2022-11-25 16:59:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:25,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067538684] [2022-11-25 16:59:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:25,986 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 16:59:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:25,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067538684] [2022-11-25 16:59:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067538684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:25,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:25,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:59:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096361590] [2022-11-25 16:59:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:26,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:59:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:59:26,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:59:26,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 255 [2022-11-25 16:59:26,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 16:59:26,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:26,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 255 [2022-11-25 16:59:26,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:26,872 INFO L130 PetriNetUnfolder]: 2855/4255 cut-off events. [2022-11-25 16:59:26,873 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-25 16:59:26,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8331 conditions, 4255 events. 2855/4255 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23425 event pairs, 545 based on Foata normal form. 0/4014 useless extension candidates. Maximal degree in co-relation 8319. Up to 3103 conditions per place. [2022-11-25 16:59:26,909 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-11-25 16:59:26,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2022-11-25 16:59:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:59:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:59:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-11-25 16:59:26,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.530718954248366 [2022-11-25 16:59:26,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-11-25 16:59:26,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-11-25 16:59:26,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:26,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-11-25 16:59:26,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 16:59:26,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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 16:59:26,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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 16:59:26,956 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 406 transitions. [2022-11-25 16:59:26,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2022-11-25 16:59:26,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:26,970 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-25 16:59:26,973 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 16:59:26,977 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 16:59:26,977 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-25 16:59:26,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 16:59:26,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:26,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:26,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:59:26,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash 675719888, now seen corresponding path program 1 times [2022-11-25 16:59:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:26,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383220999] [2022-11-25 16:59:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:26,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:27,284 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 16:59:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:27,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383220999] [2022-11-25 16:59:27,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383220999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:27,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:27,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:59:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041037981] [2022-11-25 16:59:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:27,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:59:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:27,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:59:27,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:59:27,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2022-11-25 16:59:27,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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 16:59:27,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:27,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2022-11-25 16:59:27,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:29,045 INFO L130 PetriNetUnfolder]: 8755/12032 cut-off events. [2022-11-25 16:59:29,046 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2022-11-25 16:59:29,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24754 conditions, 12032 events. 8755/12032 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 59513 event pairs, 2987 based on Foata normal form. 296/12328 useless extension candidates. Maximal degree in co-relation 24744. Up to 8389 conditions per place. [2022-11-25 16:59:29,125 INFO L137 encePairwiseOnDemand]: 247/255 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-11-25 16:59:29,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2022-11-25 16:59:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:59:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:59:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-11-25 16:59:29,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5084967320261438 [2022-11-25 16:59:29,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-11-25 16:59:29,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-11-25 16:59:29,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:29,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-11-25 16:59:29,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 16:59:29,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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 16:59:29,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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 16:59:29,133 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 389 transitions. [2022-11-25 16:59:29,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2022-11-25 16:59:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:29,136 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 114 flow [2022-11-25 16:59:29,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-11-25 16:59:29,137 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2022-11-25 16:59:29,138 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 114 flow [2022-11-25 16:59:29,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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 16:59:29,142 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:29,142 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:59:29,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -527522168, now seen corresponding path program 1 times [2022-11-25 16:59:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:29,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401018816] [2022-11-25 16:59:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:29,423 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 16:59:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:29,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401018816] [2022-11-25 16:59:29,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401018816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:29,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:29,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:59:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969501611] [2022-11-25 16:59:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:29,462 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2022-11-25 16:59:29,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 16:59:29,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:29,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2022-11-25 16:59:29,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:31,117 INFO L130 PetriNetUnfolder]: 8127/11180 cut-off events. [2022-11-25 16:59:31,118 INFO L131 PetriNetUnfolder]: For 3938/3938 co-relation queries the response was YES. [2022-11-25 16:59:31,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27576 conditions, 11180 events. 8127/11180 cut-off events. For 3938/3938 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 53590 event pairs, 2207 based on Foata normal form. 140/11320 useless extension candidates. Maximal degree in co-relation 27564. Up to 5569 conditions per place. [2022-11-25 16:59:31,196 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2022-11-25 16:59:31,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 290 flow [2022-11-25 16:59:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2022-11-25 16:59:31,198 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49411764705882355 [2022-11-25 16:59:31,198 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2022-11-25 16:59:31,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2022-11-25 16:59:31,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:31,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2022-11-25 16:59:31,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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 16:59:31,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:31,203 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:31,203 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 114 flow. Second operand 4 states and 504 transitions. [2022-11-25 16:59:31,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 290 flow [2022-11-25 16:59:31,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:31,229 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 148 flow [2022-11-25 16:59:31,229 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-11-25 16:59:31,230 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-25 16:59:31,230 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 148 flow [2022-11-25 16:59:31,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 16:59:31,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:31,231 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:59:31,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 762560972, now seen corresponding path program 1 times [2022-11-25 16:59:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:31,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111272706] [2022-11-25 16:59:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:31,405 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 16:59:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:31,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111272706] [2022-11-25 16:59:31,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111272706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:31,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:31,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452539574] [2022-11-25 16:59:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:31,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:31,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:31,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:31,422 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-11-25 16:59:31,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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 16:59:31,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:31,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-11-25 16:59:31,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:32,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L839true, P3Thread1of1ForFork0InUse, 5#L867-1true, P1Thread1of1ForFork1InUse, 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, 127#L784true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:32,452 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 16:59:32,453 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:59:32,453 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:59:32,453 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:59:32,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [99#P1EXITtrue, Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L839true, P3Thread1of1ForFork0InUse, 5#L867-1true, P1Thread1of1ForFork1InUse, 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:32,539 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,539 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,539 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,539 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([512] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|) (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= v_~z~0_49 2) (= v_~__unbuffered_p1_EAX~0_44 0) (= 2 v_~__unbuffered_p3_EAX~0_30) (= 0 v_~__unbuffered_p3_EBX~0_32))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~z~0=v_~z~0_49, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~z~0=v_~z~0_49, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][75], [Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork0InUse, 125#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P1Thread1of1ForFork1InUse, 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, 127#L784true, 23#L832true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:32,541 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,541 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,541 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,542 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,542 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 80#L874true, 79#L839true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, 127#L784true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:32,542 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,542 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,543 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,543 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:32,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([512] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|) (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= v_~z~0_49 2) (= v_~__unbuffered_p1_EAX~0_44 0) (= 2 v_~__unbuffered_p3_EAX~0_30) (= 0 v_~__unbuffered_p3_EBX~0_32))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~z~0=v_~z~0_49, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~z~0=v_~z~0_49, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][75], [99#P1EXITtrue, Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, 23#L832true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:32,600 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,600 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,600 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,601 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,601 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [99#P1EXITtrue, Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 80#L874true, 79#L839true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:32,601 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,601 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,602 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,602 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 16:59:32,639 INFO L130 PetriNetUnfolder]: 5042/7558 cut-off events. [2022-11-25 16:59:32,639 INFO L131 PetriNetUnfolder]: For 2688/2831 co-relation queries the response was YES. [2022-11-25 16:59:32,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17739 conditions, 7558 events. 5042/7558 cut-off events. For 2688/2831 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 45194 event pairs, 927 based on Foata normal form. 600/7896 useless extension candidates. Maximal degree in co-relation 17724. Up to 4920 conditions per place. [2022-11-25 16:59:32,685 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2022-11-25 16:59:32,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 448 flow [2022-11-25 16:59:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-11-25 16:59:32,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5090196078431373 [2022-11-25 16:59:32,688 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2022-11-25 16:59:32,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2022-11-25 16:59:32,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:32,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2022-11-25 16:59:32,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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 16:59:32,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 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 16:59:32,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 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 16:59:32,694 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 148 flow. Second operand 5 states and 649 transitions. [2022-11-25 16:59:32,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 448 flow [2022-11-25 16:59:32,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:32,703 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 220 flow [2022-11-25 16:59:32,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-11-25 16:59:32,705 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-11-25 16:59:32,706 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 220 flow [2022-11-25 16:59:32,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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 16:59:32,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:32,707 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:32,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:59:32,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 981583241, now seen corresponding path program 1 times [2022-11-25 16:59:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927971698] [2022-11-25 16:59:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:32,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:33,022 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 16:59:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:33,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927971698] [2022-11-25 16:59:33,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927971698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:33,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:33,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451351990] [2022-11-25 16:59:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:33,043 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-11-25 16:59:33,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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 16:59:33,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:33,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-11-25 16:59:33,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:34,181 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][76], [Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L839true, 186#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, Black: 171#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork1InUse, 5#L867-1true, Black: 170#(= ~__unbuffered_cnt~0 0), Black: 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 112#L756true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, 127#L784true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:34,181 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 16:59:34,181 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:59:34,181 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:59:34,182 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 16:59:34,271 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][103], [99#P1EXITtrue, Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L839true, P3Thread1of1ForFork0InUse, Black: 171#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 170#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 5#L867-1true, Black: 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 182#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork2InUse, 112#L756true, P0Thread1of1ForFork3InUse, 160#true, 168#true, 48#P2EXITtrue, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-25 16:59:34,271 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 16:59:34,271 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:34,272 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:34,272 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 16:59:34,379 INFO L130 PetriNetUnfolder]: 4007/6228 cut-off events. [2022-11-25 16:59:34,379 INFO L131 PetriNetUnfolder]: For 4559/4650 co-relation queries the response was YES. [2022-11-25 16:59:34,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19243 conditions, 6228 events. 4007/6228 cut-off events. For 4559/4650 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 38307 event pairs, 408 based on Foata normal form. 424/6482 useless extension candidates. Maximal degree in co-relation 19224. Up to 2168 conditions per place. [2022-11-25 16:59:34,429 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 87 selfloop transitions, 19 changer transitions 1/117 dead transitions. [2022-11-25 16:59:34,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 117 transitions, 720 flow [2022-11-25 16:59:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:59:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:59:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2022-11-25 16:59:34,433 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-11-25 16:59:34,433 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2022-11-25 16:59:34,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2022-11-25 16:59:34,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:34,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2022-11-25 16:59:34,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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 16:59:34,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 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 16:59:34,443 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 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 16:59:34,443 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 220 flow. Second operand 7 states and 910 transitions. [2022-11-25 16:59:34,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 117 transitions, 720 flow [2022-11-25 16:59:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:34,478 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 349 flow [2022-11-25 16:59:34,478 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-11-25 16:59:34,481 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-11-25 16:59:34,481 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 349 flow [2022-11-25 16:59:34,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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 16:59:34,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:34,482 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:34,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:59:34,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash -297010530, now seen corresponding path program 1 times [2022-11-25 16:59:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:34,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568306703] [2022-11-25 16:59:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:34,743 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 16:59:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:34,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568306703] [2022-11-25 16:59:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568306703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:34,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:34,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521372272] [2022-11-25 16:59:34,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:34,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:34,759 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-11-25 16:59:34,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 16:59:34,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:34,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-11-25 16:59:34,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:36,154 INFO L130 PetriNetUnfolder]: 5992/9289 cut-off events. [2022-11-25 16:59:36,154 INFO L131 PetriNetUnfolder]: For 18828/19084 co-relation queries the response was YES. [2022-11-25 16:59:36,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35722 conditions, 9289 events. 5992/9289 cut-off events. For 18828/19084 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 59590 event pairs, 1327 based on Foata normal form. 165/8982 useless extension candidates. Maximal degree in co-relation 35699. Up to 4906 conditions per place. [2022-11-25 16:59:36,207 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 76 selfloop transitions, 3 changer transitions 36/122 dead transitions. [2022-11-25 16:59:36,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 122 transitions, 1054 flow [2022-11-25 16:59:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2022-11-25 16:59:36,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5205882352941177 [2022-11-25 16:59:36,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2022-11-25 16:59:36,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2022-11-25 16:59:36,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:36,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2022-11-25 16:59:36,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 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 16:59:36,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:36,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:36,215 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 349 flow. Second operand 4 states and 531 transitions. [2022-11-25 16:59:36,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 122 transitions, 1054 flow [2022-11-25 16:59:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 919 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:36,665 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 300 flow [2022-11-25 16:59:36,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-11-25 16:59:36,668 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-11-25 16:59:36,668 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 300 flow [2022-11-25 16:59:36,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 16:59:36,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:36,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:59:36,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1432149018, now seen corresponding path program 2 times [2022-11-25 16:59:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454970570] [2022-11-25 16:59:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:36,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454970570] [2022-11-25 16:59:36,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454970570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:36,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:36,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:59:36,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014413608] [2022-11-25 16:59:36,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:36,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:36,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:36,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:36,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-11-25 16:59:36,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 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 16:59:36,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:36,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-11-25 16:59:36,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:38,047 INFO L130 PetriNetUnfolder]: 3998/6467 cut-off events. [2022-11-25 16:59:38,047 INFO L131 PetriNetUnfolder]: For 10510/10596 co-relation queries the response was YES. [2022-11-25 16:59:38,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21912 conditions, 6467 events. 3998/6467 cut-off events. For 10510/10596 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 42538 event pairs, 342 based on Foata normal form. 306/6585 useless extension candidates. Maximal degree in co-relation 21888. Up to 1615 conditions per place. [2022-11-25 16:59:38,085 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 95 selfloop transitions, 24 changer transitions 13/144 dead transitions. [2022-11-25 16:59:38,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 144 transitions, 987 flow [2022-11-25 16:59:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:59:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:59:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1165 transitions. [2022-11-25 16:59:38,090 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5076252723311547 [2022-11-25 16:59:38,090 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1165 transitions. [2022-11-25 16:59:38,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1165 transitions. [2022-11-25 16:59:38,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:38,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1165 transitions. [2022-11-25 16:59:38,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.44444444444446) internal successors, (1165), 9 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:38,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 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 16:59:38,098 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 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 16:59:38,098 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 300 flow. Second operand 9 states and 1165 transitions. [2022-11-25 16:59:38,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 144 transitions, 987 flow [2022-11-25 16:59:38,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 979 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:38,275 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 468 flow [2022-11-25 16:59:38,276 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=468, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2022-11-25 16:59:38,276 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2022-11-25 16:59:38,276 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 468 flow [2022-11-25 16:59:38,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 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 16:59:38,279 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:38,279 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:38,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:59:38,280 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1034631190, now seen corresponding path program 1 times [2022-11-25 16:59:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60452297] [2022-11-25 16:59:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:38,591 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 16:59:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:38,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60452297] [2022-11-25 16:59:38,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60452297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:38,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:38,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638670103] [2022-11-25 16:59:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:38,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:38,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:38,612 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 255 [2022-11-25 16:59:38,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 468 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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 16:59:38,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:38,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 255 [2022-11-25 16:59:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:40,054 INFO L130 PetriNetUnfolder]: 7039/10788 cut-off events. [2022-11-25 16:59:40,055 INFO L131 PetriNetUnfolder]: For 34190/34190 co-relation queries the response was YES. [2022-11-25 16:59:40,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44616 conditions, 10788 events. 7039/10788 cut-off events. For 34190/34190 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 66509 event pairs, 1020 based on Foata normal form. 12/10800 useless extension candidates. Maximal degree in co-relation 44588. Up to 5188 conditions per place. [2022-11-25 16:59:40,092 INFO L137 encePairwiseOnDemand]: 246/255 looper letters, 105 selfloop transitions, 21 changer transitions 49/175 dead transitions. [2022-11-25 16:59:40,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 175 transitions, 1707 flow [2022-11-25 16:59:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2022-11-25 16:59:40,095 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5050980392156863 [2022-11-25 16:59:40,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2022-11-25 16:59:40,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2022-11-25 16:59:40,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:40,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2022-11-25 16:59:40,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 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 16:59:40,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 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 16:59:40,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 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 16:59:40,101 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 468 flow. Second operand 5 states and 644 transitions. [2022-11-25 16:59:40,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 175 transitions, 1707 flow [2022-11-25 16:59:40,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 175 transitions, 1390 flow, removed 120 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:40,876 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 452 flow [2022-11-25 16:59:40,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2022-11-25 16:59:40,877 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2022-11-25 16:59:40,877 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 452 flow [2022-11-25 16:59:40,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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 16:59:40,878 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:40,878 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:40,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:59:40,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 16450978, now seen corresponding path program 1 times [2022-11-25 16:59:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227802846] [2022-11-25 16:59:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:41,082 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 16:59:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:41,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227802846] [2022-11-25 16:59:41,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227802846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:41,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:41,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33451509] [2022-11-25 16:59:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:41,094 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-11-25 16:59:41,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 452 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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 16:59:41,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:41,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-11-25 16:59:41,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:41,997 INFO L130 PetriNetUnfolder]: 3174/5283 cut-off events. [2022-11-25 16:59:41,997 INFO L131 PetriNetUnfolder]: For 12581/12679 co-relation queries the response was YES. [2022-11-25 16:59:42,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20576 conditions, 5283 events. 3174/5283 cut-off events. For 12581/12679 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 32861 event pairs, 663 based on Foata normal form. 48/5215 useless extension candidates. Maximal degree in co-relation 20544. Up to 2568 conditions per place. [2022-11-25 16:59:42,029 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 67 selfloop transitions, 3 changer transitions 26/108 dead transitions. [2022-11-25 16:59:42,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 927 flow [2022-11-25 16:59:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2022-11-25 16:59:42,032 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2022-11-25 16:59:42,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2022-11-25 16:59:42,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2022-11-25 16:59:42,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:42,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2022-11-25 16:59:42,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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 16:59:42,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:42,037 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:42,038 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 452 flow. Second operand 4 states and 530 transitions. [2022-11-25 16:59:42,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 927 flow [2022-11-25 16:59:42,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 881 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-11-25 16:59:42,160 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 405 flow [2022-11-25 16:59:42,160 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2022-11-25 16:59:42,161 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-11-25 16:59:42,161 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 405 flow [2022-11-25 16:59:42,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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 16:59:42,164 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:42,164 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:42,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:59:42,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1482042609, now seen corresponding path program 1 times [2022-11-25 16:59:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:42,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118900684] [2022-11-25 16:59:42,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:42,432 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 16:59:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:42,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118900684] [2022-11-25 16:59:42,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118900684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:42,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:42,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569664319] [2022-11-25 16:59:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:42,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:42,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:42,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:42,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:42,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2022-11-25 16:59:42,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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 16:59:42,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:42,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2022-11-25 16:59:42,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:43,370 INFO L130 PetriNetUnfolder]: 3851/6224 cut-off events. [2022-11-25 16:59:43,370 INFO L131 PetriNetUnfolder]: For 13778/13778 co-relation queries the response was YES. [2022-11-25 16:59:43,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24114 conditions, 6224 events. 3851/6224 cut-off events. For 13778/13778 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 36599 event pairs, 993 based on Foata normal form. 12/6236 useless extension candidates. Maximal degree in co-relation 24085. Up to 3341 conditions per place. [2022-11-25 16:59:43,394 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 67 selfloop transitions, 11 changer transitions 23/101 dead transitions. [2022-11-25 16:59:43,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 878 flow [2022-11-25 16:59:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2022-11-25 16:59:43,409 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49901960784313726 [2022-11-25 16:59:43,409 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2022-11-25 16:59:43,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2022-11-25 16:59:43,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:43,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2022-11-25 16:59:43,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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 16:59:43,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:43,414 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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 16:59:43,414 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 405 flow. Second operand 4 states and 509 transitions. [2022-11-25 16:59:43,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 878 flow [2022-11-25 16:59:43,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 852 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:43,558 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 380 flow [2022-11-25 16:59:43,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2022-11-25 16:59:43,559 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2022-11-25 16:59:43,559 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 380 flow [2022-11-25 16:59:43,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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 16:59:43,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:43,560 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:43,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:59:43,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1347394816, now seen corresponding path program 2 times [2022-11-25 16:59:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:43,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767477232] [2022-11-25 16:59:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:43,866 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 16:59:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:43,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767477232] [2022-11-25 16:59:43,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767477232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:43,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:43,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:59:43,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336692675] [2022-11-25 16:59:43,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:43,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:59:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:43,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:59:43,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:59:43,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-11-25 16:59:43,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 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 16:59:43,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:43,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-11-25 16:59:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:44,553 INFO L130 PetriNetUnfolder]: 2284/3934 cut-off events. [2022-11-25 16:59:44,553 INFO L131 PetriNetUnfolder]: For 6300/6423 co-relation queries the response was YES. [2022-11-25 16:59:44,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14114 conditions, 3934 events. 2284/3934 cut-off events. For 6300/6423 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25580 event pairs, 348 based on Foata normal form. 164/3952 useless extension candidates. Maximal degree in co-relation 14084. Up to 1385 conditions per place. [2022-11-25 16:59:44,562 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 34 selfloop transitions, 17 changer transitions 53/108 dead transitions. [2022-11-25 16:59:44,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 876 flow [2022-11-25 16:59:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:59:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:59:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2022-11-25 16:59:44,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4985294117647059 [2022-11-25 16:59:44,566 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2022-11-25 16:59:44,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2022-11-25 16:59:44,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:44,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2022-11-25 16:59:44,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 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 16:59:44,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 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 16:59:44,574 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 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 16:59:44,575 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 380 flow. Second operand 8 states and 1017 transitions. [2022-11-25 16:59:44,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 876 flow [2022-11-25 16:59:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 846 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:44,708 INFO L231 Difference]: Finished difference. Result has 75 places, 38 transitions, 262 flow [2022-11-25 16:59:44,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=75, PETRI_TRANSITIONS=38} [2022-11-25 16:59:44,708 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-11-25 16:59:44,709 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 38 transitions, 262 flow [2022-11-25 16:59:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 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 16:59:44,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:44,709 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:59:44,710 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2135280627, now seen corresponding path program 1 times [2022-11-25 16:59:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:44,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517644820] [2022-11-25 16:59:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:45,356 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 16:59:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517644820] [2022-11-25 16:59:45,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517644820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:45,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:45,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102912223] [2022-11-25 16:59:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:45,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:45,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:45,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-11-25 16:59:45,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 38 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 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 16:59:45,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:45,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-11-25 16:59:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:45,625 INFO L130 PetriNetUnfolder]: 384/686 cut-off events. [2022-11-25 16:59:45,625 INFO L131 PetriNetUnfolder]: For 1491/1494 co-relation queries the response was YES. [2022-11-25 16:59:45,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 686 events. 384/686 cut-off events. For 1491/1494 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3051 event pairs, 64 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 2644. Up to 394 conditions per place. [2022-11-25 16:59:45,629 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 47 selfloop transitions, 5 changer transitions 31/87 dead transitions. [2022-11-25 16:59:45,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 767 flow [2022-11-25 16:59:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2022-11-25 16:59:45,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49673202614379086 [2022-11-25 16:59:45,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2022-11-25 16:59:45,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2022-11-25 16:59:45,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:45,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2022-11-25 16:59:45,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 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 16:59:45,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 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 16:59:45,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 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 16:59:45,638 INFO L175 Difference]: Start difference. First operand has 75 places, 38 transitions, 262 flow. Second operand 6 states and 760 transitions. [2022-11-25 16:59:45,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 767 flow [2022-11-25 16:59:45,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 584 flow, removed 38 selfloop flow, removed 18 redundant places. [2022-11-25 16:59:45,646 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 209 flow [2022-11-25 16:59:45,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2022-11-25 16:59:45,648 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-11-25 16:59:45,649 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 209 flow [2022-11-25 16:59:45,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 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 16:59:45,650 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:45,650 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:45,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:59:45,650 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1427930105, now seen corresponding path program 2 times [2022-11-25 16:59:45,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:45,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560413136] [2022-11-25 16:59:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:46,692 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 16:59:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:46,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560413136] [2022-11-25 16:59:46,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560413136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:46,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:46,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:59:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663899381] [2022-11-25 16:59:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:46,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:59:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:46,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:59:46,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:59:46,750 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-11-25 16:59:46,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 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 16:59:46,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:46,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-11-25 16:59:46,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:47,021 INFO L130 PetriNetUnfolder]: 376/668 cut-off events. [2022-11-25 16:59:47,021 INFO L131 PetriNetUnfolder]: For 1144/1165 co-relation queries the response was YES. [2022-11-25 16:59:47,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 668 events. 376/668 cut-off events. For 1144/1165 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2906 event pairs, 70 based on Foata normal form. 14/658 useless extension candidates. Maximal degree in co-relation 2438. Up to 363 conditions per place. [2022-11-25 16:59:47,024 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 37 selfloop transitions, 4 changer transitions 37/82 dead transitions. [2022-11-25 16:59:47,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 577 flow [2022-11-25 16:59:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2022-11-25 16:59:47,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49084967320261436 [2022-11-25 16:59:47,028 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2022-11-25 16:59:47,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2022-11-25 16:59:47,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:47,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2022-11-25 16:59:47,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 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 16:59:47,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 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 16:59:47,034 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 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 16:59:47,034 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 209 flow. Second operand 6 states and 751 transitions. [2022-11-25 16:59:47,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 577 flow [2022-11-25 16:59:47,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 575 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:47,041 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 208 flow [2022-11-25 16:59:47,042 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2022-11-25 16:59:47,043 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2022-11-25 16:59:47,043 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 208 flow [2022-11-25 16:59:47,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 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 16:59:47,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:47,044 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:47,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:59:47,044 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2140625129, now seen corresponding path program 3 times [2022-11-25 16:59:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074287476] [2022-11-25 16:59:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:47,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:59:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:47,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:59:47,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:59:47,224 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 16:59:47,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 16:59:47,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 16:59:47,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 16:59:47,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 16:59:47,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 16:59:47,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 16:59:47,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:59:47,228 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:47,235 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:59:47,236 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:59:47,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:59:47 BasicIcfg [2022-11-25 16:59:47,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:59:47,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:59:47,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:59:47,376 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:59:47,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:59:19" (3/4) ... [2022-11-25 16:59:47,378 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:59:47,473 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:59:47,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:59:47,473 INFO L158 Benchmark]: Toolchain (without parser) took 29610.87ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 143.1MB in the beginning and 546.6MB in the end (delta: -403.5MB). Peak memory consumption was 927.9MB. Max. memory is 16.1GB. [2022-11-25 16:59:47,474 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:47,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.13ms. Allocated memory is still 172.0MB. Free memory was 143.1MB in the beginning and 115.5MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 16:59:47,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.82ms. Allocated memory is still 172.0MB. Free memory was 115.5MB in the beginning and 112.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:59:47,475 INFO L158 Benchmark]: Boogie Preprocessor took 56.92ms. Allocated memory is still 172.0MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:47,475 INFO L158 Benchmark]: RCFGBuilder took 900.72ms. Allocated memory is still 172.0MB. Free memory was 110.5MB in the beginning and 77.7MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 16:59:47,475 INFO L158 Benchmark]: TraceAbstraction took 27774.67ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.9MB in the beginning and 562.3MB in the end (delta: -485.4MB). Peak memory consumption was 848.2MB. Max. memory is 16.1GB. [2022-11-25 16:59:47,476 INFO L158 Benchmark]: Witness Printer took 97.48ms. Allocated memory is still 1.5GB. Free memory was 562.3MB in the beginning and 546.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 16:59:47,477 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.30ms. Allocated memory is still 130.0MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.13ms. Allocated memory is still 172.0MB. Free memory was 143.1MB in the beginning and 115.5MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.82ms. Allocated memory is still 172.0MB. Free memory was 115.5MB in the beginning and 112.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.92ms. Allocated memory is still 172.0MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 900.72ms. Allocated memory is still 172.0MB. Free memory was 110.5MB in the beginning and 77.7MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27774.67ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.9MB in the beginning and 562.3MB in the end (delta: -485.4MB). Peak memory consumption was 848.2MB. Max. memory is 16.1GB. * Witness Printer took 97.48ms. Allocated memory is still 1.5GB. Free memory was 562.3MB in the beginning and 546.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 143 PlacesBefore, 41 PlacesAfterwards, 132 TransitionsBefore, 29 TransitionsAfterwards, 3076 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 7966 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3781, independent: 3569, independent conditional: 0, independent unconditional: 3569, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2197, independent: 2135, independent conditional: 0, independent unconditional: 2135, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2197, independent: 2108, independent conditional: 0, independent unconditional: 2108, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 338, dependent conditional: 0, dependent unconditional: 338, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3781, independent: 1434, independent conditional: 0, independent unconditional: 1434, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2197, unknown conditional: 0, unknown unconditional: 2197] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-3, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-2, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=-1, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 863]: 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: 859]: 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: 861]: 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: 857]: 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 9 procedures, 171 locations, 7 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: 27.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 531 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 46 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=7, InterpolantAutomatonStates: 68, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 16:59:47,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a910000e-8fed-46aa-8307-5b3171af9e5d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE