./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/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_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/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_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/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 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b --- 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:43:09,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:43:09,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:43:09,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:43:09,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:43:09,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:43:09,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:43:09,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:43:09,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:43:09,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:43:09,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:43:09,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:43:09,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:43:09,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:43:09,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:43:09,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:43:09,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:43:09,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:43:09,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:43:09,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:43:09,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:43:09,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:43:09,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:43:09,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:43:09,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:43:09,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:43:09,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:43:09,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:43:09,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:43:09,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:43:09,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:43:09,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:43:09,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:43:09,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:43:09,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:43:09,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:43:09,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:43:09,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:43:10,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:43:10,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:43:10,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:43:10,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:43:10,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:43:10,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:43:10,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:43:10,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:43:10,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:43:10,028 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:43:10,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:43:10,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:43:10,030 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:43:10,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:43:10,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:43:10,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:43:10,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:43:10,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:43:10,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:43:10,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:43:10,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:43:10,031 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:43:10,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:43:10,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:43:10,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:43:10,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:43:10,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:43:10,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:43:10,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:43:10,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:43:10,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:43:10,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:43:10,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:43:10,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:43:10,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:43:10,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:43:10,035 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:43:10,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:43:10,035 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_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/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_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/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 -> 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b [2022-11-25 16:43:10,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:43:10,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:43:10,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:43:10,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:43:10,344 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:43:10,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-11-25 16:43:13,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:43:13,958 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:43:13,958 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-11-25 16:43:13,973 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/data/26f43e5b3/c1a4c43be98a42a8bc933438cd50c932/FLAG08dee9bb0 [2022-11-25 16:43:13,993 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/data/26f43e5b3/c1a4c43be98a42a8bc933438cd50c932 [2022-11-25 16:43:13,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:43:13,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:43:14,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:43:14,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:43:14,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:43:14,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:43:13" (1/1) ... [2022-11-25 16:43:14,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5042d4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14, skipping insertion in model container [2022-11-25 16:43:14,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:43:13" (1/1) ... [2022-11-25 16:43:14,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:43:14,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:43:14,248 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_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2022-11-25 16:43:14,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:43:14,609 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:43:14,628 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_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2022-11-25 16:43:14,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:43:14,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:43:14,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:43:14,738 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:43:14,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14 WrapperNode [2022-11-25 16:43:14,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:43:14,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:43:14,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:43:14,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:43:14,750 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:43:14" (1/1) ... [2022-11-25 16:43:14,781 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:43:14" (1/1) ... [2022-11-25 16:43:14,821 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-11-25 16:43:14,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:43:14,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:43:14,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:43:14,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:43:14,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,851 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:43:14,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:43:14,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:43:14,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:43:14,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (1/1) ... [2022-11-25 16:43:14,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:43:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:43:14,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:43:14,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:43:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:43:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:43:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:43:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:43:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:43:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:43:14,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:43:14,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:43:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:43:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:43:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:43:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:43:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:43:14,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:43:14,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:43:14,960 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:43:15,116 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:43:15,119 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:43:15,591 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:43:15,831 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:43:15,832 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:43:15,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:43:15 BoogieIcfgContainer [2022-11-25 16:43:15,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:43:15,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:43:15,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:43:15,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:43:15,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:43:13" (1/3) ... [2022-11-25 16:43:15,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cce3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:43:15, skipping insertion in model container [2022-11-25 16:43:15,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:43:14" (2/3) ... [2022-11-25 16:43:15,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cce3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:43:15, skipping insertion in model container [2022-11-25 16:43:15,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:43:15" (3/3) ... [2022-11-25 16:43:15,867 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-11-25 16:43:15,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:43:15,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:43:15,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:43:15,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:43:15,993 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:43:16,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-11-25 16:43:16,091 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-25 16:43:16,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:43:16,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 16:43:16,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2022-11-25 16:43:16,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2022-11-25 16:43:16,107 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:43:16,126 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2022-11-25 16:43:16,129 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2022-11-25 16:43:16,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2022-11-25 16:43:16,165 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-25 16:43:16,165 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:43:16,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 16:43:16,168 INFO L119 LiptonReduction]: Number of co-enabled transitions 2016 [2022-11-25 16:43:21,662 INFO L134 LiptonReduction]: Checked pairs total: 4605 [2022-11-25 16:43:21,663 INFO L136 LiptonReduction]: Total number of compositions: 106 [2022-11-25 16:43:21,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:43:21,697 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;@4d10dd5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:43:21,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 16:43:21,715 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-11-25 16:43:21,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:43:21,716 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:21,717 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:21,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1502473414, now seen corresponding path program 1 times [2022-11-25 16:43:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:21,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619183120] [2022-11-25 16:43:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:22,239 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:43:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:22,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619183120] [2022-11-25 16:43:22,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619183120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:22,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:22,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:43:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458337097] [2022-11-25 16:43:22,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:22,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:43:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:22,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:43:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:43:22,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 224 [2022-11-25 16:43:22,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:43:22,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:22,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 224 [2022-11-25 16:43:22,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:22,582 INFO L130 PetriNetUnfolder]: 644/1037 cut-off events. [2022-11-25 16:43:22,582 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-25 16:43:22,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1037 events. 644/1037 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4817 event pairs, 112 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 2038. Up to 773 conditions per place. [2022-11-25 16:43:22,592 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2022-11-25 16:43:22,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 125 flow [2022-11-25 16:43:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:43:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:43:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-11-25 16:43:22,613 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5193452380952381 [2022-11-25 16:43:22,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-11-25 16:43:22,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-11-25 16:43:22,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:22,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-11-25 16:43:22,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:43:22,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:43:22,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:43:22,635 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 349 transitions. [2022-11-25 16:43:22,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 125 flow [2022-11-25 16:43:22,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:43:22,642 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2022-11-25 16:43:22,644 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-25 16:43:22,649 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-25 16:43:22,649 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2022-11-25 16:43:22,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:43:22,650 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:22,650 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:22,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:43:22,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 768024817, now seen corresponding path program 1 times [2022-11-25 16:43:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:22,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278689378] [2022-11-25 16:43:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:22,945 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:43:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:22,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278689378] [2022-11-25 16:43:22,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278689378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:22,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:22,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:43:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214091193] [2022-11-25 16:43:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:22,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:43:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:43:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:43:22,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 224 [2022-11-25 16:43:22,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:43:22,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:22,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 224 [2022-11-25 16:43:22,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:23,148 INFO L130 PetriNetUnfolder]: 453/738 cut-off events. [2022-11-25 16:43:23,148 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-25 16:43:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 738 events. 453/738 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3110 event pairs, 177 based on Foata normal form. 24/761 useless extension candidates. Maximal degree in co-relation 1500. Up to 445 conditions per place. [2022-11-25 16:43:23,154 INFO L137 encePairwiseOnDemand]: 221/224 looper letters, 23 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-11-25 16:43:23,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 114 flow [2022-11-25 16:43:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:43:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:43:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2022-11-25 16:43:23,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2022-11-25 16:43:23,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2022-11-25 16:43:23,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2022-11-25 16:43:23,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:23,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2022-11-25 16:43:23,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:43:23,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:43:23,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:43:23,161 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 341 transitions. [2022-11-25 16:43:23,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 114 flow [2022-11-25 16:43:23,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:23,163 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-11-25 16:43:23,163 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-25 16:43:23,164 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-25 16:43:23,164 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-11-25 16:43:23,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:43:23,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:23,165 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:23,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:43:23,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -730199350, now seen corresponding path program 1 times [2022-11-25 16:43:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956131516] [2022-11-25 16:43:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:23,347 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:43:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956131516] [2022-11-25 16:43:23,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956131516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:23,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294516543] [2022-11-25 16:43:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:23,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:43:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:23,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:43:23,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:43:23,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 224 [2022-11-25 16:43:23,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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:43:23,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:23,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 224 [2022-11-25 16:43:23,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:23,577 INFO L130 PetriNetUnfolder]: 370/625 cut-off events. [2022-11-25 16:43:23,577 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-25 16:43:23,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 625 events. 370/625 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2657 event pairs, 72 based on Foata normal form. 60/684 useless extension candidates. Maximal degree in co-relation 1364. Up to 381 conditions per place. [2022-11-25 16:43:23,581 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 27 selfloop transitions, 4 changer transitions 19/52 dead transitions. [2022-11-25 16:43:23,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 52 transitions, 231 flow [2022-11-25 16:43:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:43:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:43:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2022-11-25 16:43:23,584 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48839285714285713 [2022-11-25 16:43:23,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2022-11-25 16:43:23,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2022-11-25 16:43:23,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:23,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2022-11-25 16:43:23,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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:43:23,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 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:43:23,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 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:43:23,591 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 5 states and 547 transitions. [2022-11-25 16:43:23,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 52 transitions, 231 flow [2022-11-25 16:43:23,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:23,593 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 86 flow [2022-11-25 16:43:23,593 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-11-25 16:43:23,594 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-11-25 16:43:23,594 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 86 flow [2022-11-25 16:43:23,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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:43:23,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:23,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:23,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:43:23,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:23,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1737698205, now seen corresponding path program 1 times [2022-11-25 16:43:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:23,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405334452] [2022-11-25 16:43:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:23,801 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:43:23,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405334452] [2022-11-25 16:43:23,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405334452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:23,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:23,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:43:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531151044] [2022-11-25 16:43:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:23,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:43:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:23,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:43:23,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:23,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 224 [2022-11-25 16:43:23,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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:43:23,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:23,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 224 [2022-11-25 16:43:23,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:24,055 INFO L130 PetriNetUnfolder]: 188/351 cut-off events. [2022-11-25 16:43:24,055 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-11-25 16:43:24,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 351 events. 188/351 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1331 event pairs, 42 based on Foata normal form. 36/386 useless extension candidates. Maximal degree in co-relation 990. Up to 130 conditions per place. [2022-11-25 16:43:24,058 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 35 selfloop transitions, 7 changer transitions 19/63 dead transitions. [2022-11-25 16:43:24,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 63 transitions, 336 flow [2022-11-25 16:43:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2022-11-25 16:43:24,061 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4888392857142857 [2022-11-25 16:43:24,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2022-11-25 16:43:24,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2022-11-25 16:43:24,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:24,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2022-11-25 16:43:24,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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:43:24,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 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:43:24,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 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:43:24,068 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 86 flow. Second operand 6 states and 657 transitions. [2022-11-25 16:43:24,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 63 transitions, 336 flow [2022-11-25 16:43:24,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 63 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:24,072 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 136 flow [2022-11-25 16:43:24,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-11-25 16:43:24,073 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-11-25 16:43:24,073 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 136 flow [2022-11-25 16:43:24,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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:43:24,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:24,074 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:24,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:43:24,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1602305917, now seen corresponding path program 1 times [2022-11-25 16:43:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:24,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633592078] [2022-11-25 16:43:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:24,270 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:43:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633592078] [2022-11-25 16:43:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633592078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:24,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:24,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936202083] [2022-11-25 16:43:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:24,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:43:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:43:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:43:24,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 224 [2022-11-25 16:43:24,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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:43:24,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:24,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 224 [2022-11-25 16:43:24,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:24,510 INFO L130 PetriNetUnfolder]: 243/459 cut-off events. [2022-11-25 16:43:24,511 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-11-25 16:43:24,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 459 events. 243/459 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1883 event pairs, 46 based on Foata normal form. 6/465 useless extension candidates. Maximal degree in co-relation 1482. Up to 251 conditions per place. [2022-11-25 16:43:24,514 INFO L137 encePairwiseOnDemand]: 221/224 looper letters, 38 selfloop transitions, 2 changer transitions 16/57 dead transitions. [2022-11-25 16:43:24,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 422 flow [2022-11-25 16:43:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:43:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:43:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2022-11-25 16:43:24,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2022-11-25 16:43:24,517 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2022-11-25 16:43:24,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2022-11-25 16:43:24,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:24,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2022-11-25 16:43:24,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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:43:24,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:43:24,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:43:24,523 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 136 flow. Second operand 4 states and 455 transitions. [2022-11-25 16:43:24,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 422 flow [2022-11-25 16:43:24,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 348 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-11-25 16:43:24,529 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 119 flow [2022-11-25 16:43:24,529 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-11-25 16:43:24,530 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-11-25 16:43:24,530 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 119 flow [2022-11-25 16:43:24,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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:43:24,531 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:24,531 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:43:24,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 520052283, now seen corresponding path program 2 times [2022-11-25 16:43:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:24,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407102441] [2022-11-25 16:43:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:24,874 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:43:24,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:24,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407102441] [2022-11-25 16:43:24,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407102441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:24,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:24,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:43:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534287988] [2022-11-25 16:43:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:43:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:24,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:43:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:43:24,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 224 [2022-11-25 16:43:24,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:43:24,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:24,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 224 [2022-11-25 16:43:24,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:25,110 INFO L130 PetriNetUnfolder]: 176/343 cut-off events. [2022-11-25 16:43:25,110 INFO L131 PetriNetUnfolder]: For 272/273 co-relation queries the response was YES. [2022-11-25 16:43:25,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 343 events. 176/343 cut-off events. For 272/273 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1387 event pairs, 49 based on Foata normal form. 18/351 useless extension candidates. Maximal degree in co-relation 998. Up to 133 conditions per place. [2022-11-25 16:43:25,113 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 31 selfloop transitions, 10 changer transitions 12/55 dead transitions. [2022-11-25 16:43:25,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 319 flow [2022-11-25 16:43:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:43:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:43:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2022-11-25 16:43:25,116 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4764030612244898 [2022-11-25 16:43:25,117 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2022-11-25 16:43:25,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2022-11-25 16:43:25,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:25,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2022-11-25 16:43:25,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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:43:25,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 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:43:25,123 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 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:43:25,124 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 119 flow. Second operand 7 states and 747 transitions. [2022-11-25 16:43:25,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 319 flow [2022-11-25 16:43:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 296 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:25,127 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 134 flow [2022-11-25 16:43:25,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2022-11-25 16:43:25,128 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-11-25 16:43:25,128 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 134 flow [2022-11-25 16:43:25,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:43:25,129 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:25,129 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:25,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:43:25,130 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -884721557, now seen corresponding path program 1 times [2022-11-25 16:43:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:25,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064384279] [2022-11-25 16:43:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:25,379 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:43:25,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:25,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064384279] [2022-11-25 16:43:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064384279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:25,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:25,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677394527] [2022-11-25 16:43:25,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:25,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:43:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:25,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:43:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:43:25,390 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 224 [2022-11-25 16:43:25,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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:43:25,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:25,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 224 [2022-11-25 16:43:25,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:25,569 INFO L130 PetriNetUnfolder]: 178/353 cut-off events. [2022-11-25 16:43:25,569 INFO L131 PetriNetUnfolder]: For 528/528 co-relation queries the response was YES. [2022-11-25 16:43:25,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 353 events. 178/353 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1454 event pairs, 36 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 1102. Up to 213 conditions per place. [2022-11-25 16:43:25,571 INFO L137 encePairwiseOnDemand]: 221/224 looper letters, 26 selfloop transitions, 1 changer transitions 26/54 dead transitions. [2022-11-25 16:43:25,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 392 flow [2022-11-25 16:43:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:43:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:43:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2022-11-25 16:43:25,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2022-11-25 16:43:25,574 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2022-11-25 16:43:25,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2022-11-25 16:43:25,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:25,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2022-11-25 16:43:25,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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:43:25,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:43:25,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:43:25,580 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 134 flow. Second operand 4 states and 452 transitions. [2022-11-25 16:43:25,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 392 flow [2022-11-25 16:43:25,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 322 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-11-25 16:43:25,584 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 107 flow [2022-11-25 16:43:25,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=100, 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-11-25 16:43:25,585 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-11-25 16:43:25,585 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 107 flow [2022-11-25 16:43:25,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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:43:25,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:25,586 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:25,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:43:25,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1231601533, now seen corresponding path program 2 times [2022-11-25 16:43:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:25,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530960168] [2022-11-25 16:43:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:26,261 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:43:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530960168] [2022-11-25 16:43:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530960168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:26,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:26,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:43:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838230601] [2022-11-25 16:43:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:43:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:26,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:43:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:26,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 224 [2022-11-25 16:43:26,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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:43:26,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:26,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 224 [2022-11-25 16:43:26,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:26,512 INFO L130 PetriNetUnfolder]: 161/337 cut-off events. [2022-11-25 16:43:26,512 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-11-25 16:43:26,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 337 events. 161/337 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1376 event pairs, 64 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1032. Up to 180 conditions per place. [2022-11-25 16:43:26,514 INFO L137 encePairwiseOnDemand]: 219/224 looper letters, 23 selfloop transitions, 2 changer transitions 29/56 dead transitions. [2022-11-25 16:43:26,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 364 flow [2022-11-25 16:43:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 650 transitions. [2022-11-25 16:43:26,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4836309523809524 [2022-11-25 16:43:26,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 650 transitions. [2022-11-25 16:43:26,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 650 transitions. [2022-11-25 16:43:26,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:26,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 650 transitions. [2022-11-25 16:43:26,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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:43:26,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 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:43:26,523 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 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:43:26,523 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 107 flow. Second operand 6 states and 650 transitions. [2022-11-25 16:43:26,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 364 flow [2022-11-25 16:43:26,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:26,526 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 116 flow [2022-11-25 16:43:26,527 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2022-11-25 16:43:26,527 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-11-25 16:43:26,528 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 116 flow [2022-11-25 16:43:26,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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:43:26,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:26,529 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:26,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:43:26,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -898401571, now seen corresponding path program 3 times [2022-11-25 16:43:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:26,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171973584] [2022-11-25 16:43:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:43:26,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:43:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:43:26,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:43:26,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:43:26,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 16:43:26,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 16:43:26,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 16:43:26,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 16:43:26,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 16:43:26,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 16:43:26,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:43:26,655 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-11-25 16:43:26,662 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:43:26,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:43:26,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:43:26 BasicIcfg [2022-11-25 16:43:26,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:43:26,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:43:26,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:43:26,729 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:43:26,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:43:15" (3/4) ... [2022-11-25 16:43:26,732 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:43:26,840 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:43:26,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:43:26,842 INFO L158 Benchmark]: Toolchain (without parser) took 12843.76ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 142.4MB in the beginning and 139.8MB in the end (delta: 2.6MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,842 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:43:26,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.02ms. Allocated memory is still 176.2MB. Free memory was 142.4MB in the beginning and 115.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.25ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 113.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,843 INFO L158 Benchmark]: Boogie Preprocessor took 35.03ms. Allocated memory is still 176.2MB. Free memory was 113.6MB in the beginning and 111.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,843 INFO L158 Benchmark]: RCFGBuilder took 976.22ms. Allocated memory is still 176.2MB. Free memory was 111.6MB in the beginning and 143.6MB in the end (delta: -32.0MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,844 INFO L158 Benchmark]: TraceAbstraction took 10891.24ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 143.6MB in the beginning and 150.3MB in the end (delta: -6.7MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,844 INFO L158 Benchmark]: Witness Printer took 112.61ms. Allocated memory is still 272.6MB. Free memory was 150.3MB in the beginning and 139.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:43:26,846 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.34ms. Allocated memory is still 138.4MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.02ms. Allocated memory is still 176.2MB. Free memory was 142.4MB in the beginning and 115.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.25ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 113.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.03ms. Allocated memory is still 176.2MB. Free memory was 113.6MB in the beginning and 111.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 976.22ms. Allocated memory is still 176.2MB. Free memory was 111.6MB in the beginning and 143.6MB in the end (delta: -32.0MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10891.24ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 143.6MB in the beginning and 150.3MB in the end (delta: -6.7MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 112.61ms. Allocated memory is still 272.6MB. Free memory was 150.3MB in the beginning and 139.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 123 PlacesBefore, 32 PlacesAfterwards, 115 TransitionsBefore, 23 TransitionsAfterwards, 2016 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 4605 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2470, independent: 2308, independent conditional: 0, independent unconditional: 2308, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1461, independent: 1409, independent conditional: 0, independent unconditional: 1409, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1461, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 438, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2470, independent: 899, independent conditional: 0, independent unconditional: 899, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1461, unknown conditional: 0, unknown unconditional: 1461] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 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) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L813] 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) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 22 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:43:26,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9faa396-67f5-4eb1-a4e3-6fb364c2a657/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE