./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8 --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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- 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-2329fc7 [2022-12-13 12:46:06,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:46:06,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:46:06,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:46:06,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:46:06,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:46:06,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:46:06,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:46:06,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:46:06,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:46:06,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:46:06,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:46:06,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:46:06,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:46:06,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:46:06,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:46:06,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:46:06,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:46:06,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:46:06,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:46:06,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:46:06,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:46:06,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:46:06,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:46:06,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:46:06,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:46:06,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:46:06,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:46:06,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:46:06,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:46:06,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:46:06,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:46:06,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:46:06,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:46:06,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:46:06,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:46:06,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:46:06,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:46:06,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:46:06,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:46:06,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:46:06,479 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:46:06,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:46:06,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:46:06,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:46:06,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:46:06,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:46:06,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:46:06,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:46:06,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:46:06,494 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:46:06,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:46:06,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:46:06,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:46:06,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:46:06,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:46:06,497 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:46:06,497 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_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/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_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2022-12-13 12:46:06,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:46:06,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:46:06,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:46:06,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:46:06,692 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:46:06,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-12-13 12:46:09,318 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:46:09,529 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:46:09,530 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-12-13 12:46:09,542 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/data/d68d1a72d/ce08eebeec264681bb8fd53a19c3858f/FLAG27e4c93b3 [2022-12-13 12:46:09,557 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/data/d68d1a72d/ce08eebeec264681bb8fd53a19c3858f [2022-12-13 12:46:09,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:46:09,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:46:09,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:46:09,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:46:09,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:46:09,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:09" (1/1) ... [2022-12-13 12:46:09,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2449d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:09, skipping insertion in model container [2022-12-13 12:46:09,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:09" (1/1) ... [2022-12-13 12:46:09,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:46:09,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:46:09,762 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_02f6b9c8-a14d-41f5-a944-ea5b289818df/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-12-13 12:46:09,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:09,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:09,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:46:09,971 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:46:09,982 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_02f6b9c8-a14d-41f5-a944-ea5b289818df/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-12-13 12:46:10,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:46:10,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:46:10,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:46:10,059 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:46:10,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10 WrapperNode [2022-12-13 12:46:10,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:46:10,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:46:10,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:46:10,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:46:10,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,108 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-13 12:46:10,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:46:10,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:46:10,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:46:10,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:46:10,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:46:10,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:46:10,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:46:10,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:46:10,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 12:46:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:46:10,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:46:10,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:46:10,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:46:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:46:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:46:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:46:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:46:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:46:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:46:10,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:46:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:46:10,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:46:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:46:10,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:46:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:46:10,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:46:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:46:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:46:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:46:10,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:46:10,193 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 12:46:10,314 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:46:10,316 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:46:10,562 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:46:10,631 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:46:10,631 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:46:10,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:10 BoogieIcfgContainer [2022-12-13 12:46:10,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:46:10,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:46:10,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:46:10,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:46:10,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:46:09" (1/3) ... [2022-12-13 12:46:10,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc345aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:10, skipping insertion in model container [2022-12-13 12:46:10,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (2/3) ... [2022-12-13 12:46:10,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc345aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:10, skipping insertion in model container [2022-12-13 12:46:10,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:10" (3/3) ... [2022-12-13 12:46:10,639 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-12-13 12:46:10,645 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 12:46:10,652 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:46:10,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:46:10,653 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:46:10,694 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:46:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 12:46:10,786 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 12:46:10,787 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:46:10,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 12:46:10,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 12:46:10,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-12-13 12:46:10,800 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:46:10,807 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 12:46:10,809 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 12:46:10,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-12-13 12:46:10,836 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 12:46:10,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:46:10,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 12:46:10,839 INFO L119 LiptonReduction]: Number of co-enabled transitions 3218 [2022-12-13 12:46:14,899 INFO L134 LiptonReduction]: Checked pairs total: 8530 [2022-12-13 12:46:14,899 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-12-13 12:46:14,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:46:14,914 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;@16797c4c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:46:14,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 12:46:14,917 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 12:46:14,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:46:14,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:14,918 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:14,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash -787115167, now seen corresponding path program 1 times [2022-12-13 12:46:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:14,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150644050] [2022-12-13 12:46:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:15,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150644050] [2022-12-13 12:46:15,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150644050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:15,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:15,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:46:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811714067] [2022-12-13 12:46:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:15,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:46:15,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:46:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:46:15,314 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 253 [2022-12-13 12:46:15,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-12-13 12:46:15,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:15,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 253 [2022-12-13 12:46:15,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:15,972 INFO L130 PetriNetUnfolder]: 2855/4234 cut-off events. [2022-12-13 12:46:15,972 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 12:46:15,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8310 conditions, 4234 events. 2855/4234 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 23881 event pairs, 545 based on Foata normal form. 0/4002 useless extension candidates. Maximal degree in co-relation 8298. Up to 3103 conditions per place. [2022-12-13 12:46:15,990 INFO L137 encePairwiseOnDemand]: 250/253 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-12-13 12:46:15,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 173 flow [2022-12-13 12:46:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:46:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:46:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-12-13 12:46:16,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.52832674571805 [2022-12-13 12:46:16,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-12-13 12:46:16,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-12-13 12:46:16,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:16,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-12-13 12:46:16,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:16,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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-12-13 12:46:16,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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-12-13 12:46:16,021 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 401 transitions. [2022-12-13 12:46:16,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 173 flow [2022-12-13 12:46:16,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:46:16,027 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2022-12-13 12:46:16,029 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-13 12:46:16,033 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-13 12:46:16,033 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2022-12-13 12:46:16,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-12-13 12:46:16,033 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:16,034 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:16,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:46:16,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1599223334, now seen corresponding path program 1 times [2022-12-13 12:46:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:16,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882540735] [2022-12-13 12:46:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882540735] [2022-12-13 12:46:16,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882540735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:16,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:16,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:46:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979841483] [2022-12-13 12:46:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:16,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:46:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:16,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:46:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:46:16,288 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 253 [2022-12-13 12:46:16,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-12-13 12:46:16,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:16,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 253 [2022-12-13 12:46:16,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:16,746 INFO L130 PetriNetUnfolder]: 3047/4300 cut-off events. [2022-12-13 12:46:16,747 INFO L131 PetriNetUnfolder]: For 278/278 co-relation queries the response was YES. [2022-12-13 12:46:16,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8962 conditions, 4300 events. 3047/4300 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20449 event pairs, 1415 based on Foata normal form. 32/4300 useless extension candidates. Maximal degree in co-relation 8952. Up to 3903 conditions per place. [2022-12-13 12:46:16,762 INFO L137 encePairwiseOnDemand]: 249/253 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-13 12:46:16,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 188 flow [2022-12-13 12:46:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:46:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:46:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2022-12-13 12:46:16,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5243741765480896 [2022-12-13 12:46:16,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2022-12-13 12:46:16,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2022-12-13 12:46:16,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:16,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2022-12-13 12:46:16,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-12-13 12:46:16,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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-12-13 12:46:16,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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-12-13 12:46:16,767 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 398 transitions. [2022-12-13 12:46:16,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 188 flow [2022-12-13 12:46:16,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:46:16,768 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2022-12-13 12:46:16,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 12:46:16,769 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-13 12:46:16,769 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2022-12-13 12:46:16,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-12-13 12:46:16,769 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:16,770 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:16,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:46:16,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1963685379, now seen corresponding path program 1 times [2022-12-13 12:46:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:16,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180992734] [2022-12-13 12:46:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:17,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180992734] [2022-12-13 12:46:17,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180992734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:17,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:17,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:46:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197891307] [2022-12-13 12:46:17,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:17,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:17,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:17,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2022-12-13 12:46:17,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-12-13 12:46:17,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:17,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2022-12-13 12:46:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:18,279 INFO L130 PetriNetUnfolder]: 6679/9208 cut-off events. [2022-12-13 12:46:18,279 INFO L131 PetriNetUnfolder]: For 1233/1233 co-relation queries the response was YES. [2022-12-13 12:46:18,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20241 conditions, 9208 events. 6679/9208 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 44345 event pairs, 1691 based on Foata normal form. 300/9506 useless extension candidates. Maximal degree in co-relation 20230. Up to 5723 conditions per place. [2022-12-13 12:46:18,309 INFO L137 encePairwiseOnDemand]: 241/253 looper letters, 43 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2022-12-13 12:46:18,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 257 flow [2022-12-13 12:46:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:46:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:46:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-12-13 12:46:18,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48320158102766797 [2022-12-13 12:46:18,311 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2022-12-13 12:46:18,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2022-12-13 12:46:18,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:18,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2022-12-13 12:46:18,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-12-13 12:46:18,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:18,314 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:18,314 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 4 states and 489 transitions. [2022-12-13 12:46:18,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 257 flow [2022-12-13 12:46:18,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:46:18,316 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 176 flow [2022-12-13 12:46:18,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 12:46:18,316 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 12:46:18,317 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 176 flow [2022-12-13 12:46:18,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-12-13 12:46:18,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:18,317 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:18,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:46:18,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash -427944417, now seen corresponding path program 1 times [2022-12-13 12:46:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:18,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784010397] [2022-12-13 12:46:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:18,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784010397] [2022-12-13 12:46:18,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784010397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:18,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:18,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:46:18,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941188921] [2022-12-13 12:46:18,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:18,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:18,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:18,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:18,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 253 [2022-12-13 12:46:18,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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-12-13 12:46:18,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:18,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 253 [2022-12-13 12:46:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:19,603 INFO L130 PetriNetUnfolder]: 6385/9219 cut-off events. [2022-12-13 12:46:19,603 INFO L131 PetriNetUnfolder]: For 6375/6480 co-relation queries the response was YES. [2022-12-13 12:46:19,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25654 conditions, 9219 events. 6385/9219 cut-off events. For 6375/6480 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 51664 event pairs, 1580 based on Foata normal form. 57/8889 useless extension candidates. Maximal degree in co-relation 25639. Up to 7546 conditions per place. [2022-12-13 12:46:19,635 INFO L137 encePairwiseOnDemand]: 249/253 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2022-12-13 12:46:19,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 346 flow [2022-12-13 12:46:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:46:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:46:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2022-12-13 12:46:19,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5243741765480896 [2022-12-13 12:46:19,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2022-12-13 12:46:19,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2022-12-13 12:46:19,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:19,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2022-12-13 12:46:19,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-12-13 12:46:19,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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-12-13 12:46:19,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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-12-13 12:46:19,638 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 176 flow. Second operand 3 states and 398 transitions. [2022-12-13 12:46:19,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 346 flow [2022-12-13 12:46:19,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 340 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 12:46:19,642 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 204 flow [2022-12-13 12:46:19,643 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 12:46:19,643 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-12-13 12:46:19,643 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 204 flow [2022-12-13 12:46:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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-12-13 12:46:19,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:19,644 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:19,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:46:19,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -356234210, now seen corresponding path program 1 times [2022-12-13 12:46:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894492403] [2022-12-13 12:46:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:19,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:19,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894492403] [2022-12-13 12:46:19,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894492403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:19,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:19,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:46:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448911501] [2022-12-13 12:46:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:19,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:20,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2022-12-13 12:46:20,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 204 flow. Second operand has 4 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-12-13 12:46:20,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:20,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2022-12-13 12:46:20,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:21,346 INFO L130 PetriNetUnfolder]: 9715/13660 cut-off events. [2022-12-13 12:46:21,346 INFO L131 PetriNetUnfolder]: For 10389/10389 co-relation queries the response was YES. [2022-12-13 12:46:21,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39905 conditions, 13660 events. 9715/13660 cut-off events. For 10389/10389 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 72519 event pairs, 3261 based on Foata normal form. 184/13844 useless extension candidates. Maximal degree in co-relation 39888. Up to 7241 conditions per place. [2022-12-13 12:46:21,385 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 61 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2022-12-13 12:46:21,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 466 flow [2022-12-13 12:46:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:46:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:46:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2022-12-13 12:46:21,386 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4901185770750988 [2022-12-13 12:46:21,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2022-12-13 12:46:21,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2022-12-13 12:46:21,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:21,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2022-12-13 12:46:21,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:21,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:21,389 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:21,389 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 204 flow. Second operand 4 states and 496 transitions. [2022-12-13 12:46:21,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 466 flow [2022-12-13 12:46:21,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:46:21,393 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 272 flow [2022-12-13 12:46:21,393 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-13 12:46:21,394 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-13 12:46:21,394 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 272 flow [2022-12-13 12:46:21,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-12-13 12:46:21,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:21,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:21,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:46:21,394 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1032308665, now seen corresponding path program 1 times [2022-12-13 12:46:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:21,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124194698] [2022-12-13 12:46:21,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:21,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124194698] [2022-12-13 12:46:21,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124194698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:21,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:21,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:46:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936217162] [2022-12-13 12:46:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:21,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:21,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:21,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:21,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 253 [2022-12-13 12:46:21,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:21,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:21,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 253 [2022-12-13 12:46:21,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:22,636 INFO L130 PetriNetUnfolder]: 8536/12321 cut-off events. [2022-12-13 12:46:22,636 INFO L131 PetriNetUnfolder]: For 16077/16533 co-relation queries the response was YES. [2022-12-13 12:46:22,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37571 conditions, 12321 events. 8536/12321 cut-off events. For 16077/16533 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 72268 event pairs, 1704 based on Foata normal form. 148/11905 useless extension candidates. Maximal degree in co-relation 37551. Up to 8678 conditions per place. [2022-12-13 12:46:22,675 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 56 selfloop transitions, 14 changer transitions 1/82 dead transitions. [2022-12-13 12:46:22,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 568 flow [2022-12-13 12:46:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:46:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:46:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2022-12-13 12:46:22,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5247035573122529 [2022-12-13 12:46:22,677 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2022-12-13 12:46:22,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2022-12-13 12:46:22,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:22,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2022-12-13 12:46:22,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:22,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:22,679 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:22,679 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 272 flow. Second operand 4 states and 531 transitions. [2022-12-13 12:46:22,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 568 flow [2022-12-13 12:46:22,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 558 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 12:46:22,684 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 354 flow [2022-12-13 12:46:22,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2022-12-13 12:46:22,685 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 12:46:22,685 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 354 flow [2022-12-13 12:46:22,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:22,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:22,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:46:22,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 946380254, now seen corresponding path program 1 times [2022-12-13 12:46:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440594224] [2022-12-13 12:46:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:22,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440594224] [2022-12-13 12:46:22,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440594224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:22,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:22,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:46:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206186182] [2022-12-13 12:46:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:22,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:46:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:46:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:46:22,999 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2022-12-13 12:46:23,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 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-12-13 12:46:23,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:23,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2022-12-13 12:46:23,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:24,646 INFO L130 PetriNetUnfolder]: 10067/14546 cut-off events. [2022-12-13 12:46:24,647 INFO L131 PetriNetUnfolder]: For 29801/30648 co-relation queries the response was YES. [2022-12-13 12:46:24,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47924 conditions, 14546 events. 10067/14546 cut-off events. For 29801/30648 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 87766 event pairs, 1760 based on Foata normal form. 517/14373 useless extension candidates. Maximal degree in co-relation 47901. Up to 8339 conditions per place. [2022-12-13 12:46:24,692 INFO L137 encePairwiseOnDemand]: 245/253 looper letters, 75 selfloop transitions, 28 changer transitions 1/115 dead transitions. [2022-12-13 12:46:24,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 836 flow [2022-12-13 12:46:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:46:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:46:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2022-12-13 12:46:24,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5171277997364954 [2022-12-13 12:46:24,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2022-12-13 12:46:24,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2022-12-13 12:46:24,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:24,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2022-12-13 12:46:24,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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-12-13 12:46:24,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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-12-13 12:46:24,698 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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-12-13 12:46:24,698 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 354 flow. Second operand 6 states and 785 transitions. [2022-12-13 12:46:24,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 836 flow [2022-12-13 12:46:24,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 824 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 12:46:24,707 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 554 flow [2022-12-13 12:46:24,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2022-12-13 12:46:24,708 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-12-13 12:46:24,708 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 554 flow [2022-12-13 12:46:24,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 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-12-13 12:46:24,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:24,709 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:24,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:46:24,709 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash -356206027, now seen corresponding path program 1 times [2022-12-13 12:46:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:24,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961400636] [2022-12-13 12:46:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961400636] [2022-12-13 12:46:25,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961400636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:25,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:25,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:46:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469409528] [2022-12-13 12:46:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:25,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:46:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:46:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:46:25,283 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 253 [2022-12-13 12:46:25,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-12-13 12:46:25,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:25,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 253 [2022-12-13 12:46:25,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:27,023 INFO L130 PetriNetUnfolder]: 15373/21198 cut-off events. [2022-12-13 12:46:27,023 INFO L131 PetriNetUnfolder]: For 58434/58434 co-relation queries the response was YES. [2022-12-13 12:46:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81443 conditions, 21198 events. 15373/21198 cut-off events. For 58434/58434 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 117162 event pairs, 1819 based on Foata normal form. 64/21262 useless extension candidates. Maximal degree in co-relation 81416. Up to 11061 conditions per place. [2022-12-13 12:46:27,096 INFO L137 encePairwiseOnDemand]: 245/253 looper letters, 103 selfloop transitions, 24 changer transitions 26/153 dead transitions. [2022-12-13 12:46:27,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 153 transitions, 1375 flow [2022-12-13 12:46:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:46:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:46:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 729 transitions. [2022-12-13 12:46:27,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48023715415019763 [2022-12-13 12:46:27,098 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 729 transitions. [2022-12-13 12:46:27,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 729 transitions. [2022-12-13 12:46:27,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:27,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 729 transitions. [2022-12-13 12:46:27,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 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-12-13 12:46:27,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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-12-13 12:46:27,102 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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-12-13 12:46:27,102 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 554 flow. Second operand 6 states and 729 transitions. [2022-12-13 12:46:27,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 153 transitions, 1375 flow [2022-12-13 12:46:27,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 153 transitions, 1333 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 12:46:27,166 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 560 flow [2022-12-13 12:46:27,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2022-12-13 12:46:27,166 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2022-12-13 12:46:27,166 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 560 flow [2022-12-13 12:46:27,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-12-13 12:46:27,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:27,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:27,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:46:27,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -356088847, now seen corresponding path program 2 times [2022-12-13 12:46:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:27,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44113179] [2022-12-13 12:46:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:27,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44113179] [2022-12-13 12:46:27,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44113179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:27,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:27,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:46:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080940839] [2022-12-13 12:46:27,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:46:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:46:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:46:27,609 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 253 [2022-12-13 12:46:27,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-12-13 12:46:27,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:27,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 253 [2022-12-13 12:46:27,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:29,164 INFO L130 PetriNetUnfolder]: 10865/15832 cut-off events. [2022-12-13 12:46:29,165 INFO L131 PetriNetUnfolder]: For 68192/69388 co-relation queries the response was YES. [2022-12-13 12:46:29,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67259 conditions, 15832 events. 10865/15832 cut-off events. For 68192/69388 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 99427 event pairs, 1987 based on Foata normal form. 434/15353 useless extension candidates. Maximal degree in co-relation 67229. Up to 10474 conditions per place. [2022-12-13 12:46:29,227 INFO L137 encePairwiseOnDemand]: 245/253 looper letters, 78 selfloop transitions, 20 changer transitions 2/110 dead transitions. [2022-12-13 12:46:29,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 110 transitions, 1032 flow [2022-12-13 12:46:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:46:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:46:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2022-12-13 12:46:29,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5114624505928854 [2022-12-13 12:46:29,229 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2022-12-13 12:46:29,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2022-12-13 12:46:29,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:29,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2022-12-13 12:46:29,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:29,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:29,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:29,232 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 560 flow. Second operand 5 states and 647 transitions. [2022-12-13 12:46:29,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 110 transitions, 1032 flow [2022-12-13 12:46:29,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 1000 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:46:29,276 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 663 flow [2022-12-13 12:46:29,276 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=663, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2022-12-13 12:46:29,276 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-13 12:46:29,276 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 663 flow [2022-12-13 12:46:29,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-12-13 12:46:29,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:29,277 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:29,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:46:29,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1087413939, now seen corresponding path program 1 times [2022-12-13 12:46:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:29,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194732530] [2022-12-13 12:46:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194732530] [2022-12-13 12:46:29,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194732530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:29,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:29,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:46:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736922650] [2022-12-13 12:46:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:29,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:29,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2022-12-13 12:46:29,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 663 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-12-13 12:46:29,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:29,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2022-12-13 12:46:29,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:31,665 INFO L130 PetriNetUnfolder]: 14856/21913 cut-off events. [2022-12-13 12:46:31,665 INFO L131 PetriNetUnfolder]: For 108958/109634 co-relation queries the response was YES. [2022-12-13 12:46:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93249 conditions, 21913 events. 14856/21913 cut-off events. For 108958/109634 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 145025 event pairs, 2313 based on Foata normal form. 790/22319 useless extension candidates. Maximal degree in co-relation 93218. Up to 11249 conditions per place. [2022-12-13 12:46:31,748 INFO L137 encePairwiseOnDemand]: 250/253 looper letters, 107 selfloop transitions, 3 changer transitions 18/139 dead transitions. [2022-12-13 12:46:31,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 139 transitions, 1575 flow [2022-12-13 12:46:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:46:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:46:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-12-13 12:46:31,750 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5118577075098815 [2022-12-13 12:46:31,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2022-12-13 12:46:31,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2022-12-13 12:46:31,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:31,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2022-12-13 12:46:31,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-12-13 12:46:31,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:31,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:31,753 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 663 flow. Second operand 4 states and 518 transitions. [2022-12-13 12:46:31,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 139 transitions, 1575 flow [2022-12-13 12:46:31,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 1521 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:46:31,809 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 653 flow [2022-12-13 12:46:31,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=653, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2022-12-13 12:46:31,810 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2022-12-13 12:46:31,810 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 653 flow [2022-12-13 12:46:31,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-12-13 12:46:31,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:31,810 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:31,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:46:31,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -485041067, now seen corresponding path program 3 times [2022-12-13 12:46:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:31,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718328186] [2022-12-13 12:46:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718328186] [2022-12-13 12:46:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718328186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:32,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:46:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939082013] [2022-12-13 12:46:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:32,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:46:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:46:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:46:32,155 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 253 [2022-12-13 12:46:32,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 653 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-12-13 12:46:32,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:32,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 253 [2022-12-13 12:46:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:34,339 INFO L130 PetriNetUnfolder]: 15060/21999 cut-off events. [2022-12-13 12:46:34,339 INFO L131 PetriNetUnfolder]: For 106523/108359 co-relation queries the response was YES. [2022-12-13 12:46:34,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95456 conditions, 21999 events. 15060/21999 cut-off events. For 106523/108359 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 145023 event pairs, 2624 based on Foata normal form. 577/21305 useless extension candidates. Maximal degree in co-relation 95424. Up to 12368 conditions per place. [2022-12-13 12:46:34,422 INFO L137 encePairwiseOnDemand]: 245/253 looper letters, 69 selfloop transitions, 28 changer transitions 7/115 dead transitions. [2022-12-13 12:46:34,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 115 transitions, 1116 flow [2022-12-13 12:46:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:46:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:46:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-12-13 12:46:34,424 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5130434782608696 [2022-12-13 12:46:34,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2022-12-13 12:46:34,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2022-12-13 12:46:34,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:34,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2022-12-13 12:46:34,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:34,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:34,427 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:34,427 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 653 flow. Second operand 5 states and 649 transitions. [2022-12-13 12:46:34,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 115 transitions, 1116 flow [2022-12-13 12:46:34,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 115 transitions, 1112 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:46:34,515 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 770 flow [2022-12-13 12:46:34,515 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=770, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2022-12-13 12:46:34,516 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2022-12-13 12:46:34,516 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 770 flow [2022-12-13 12:46:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-12-13 12:46:34,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:34,516 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:46:34,517 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 569747207, now seen corresponding path program 2 times [2022-12-13 12:46:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282893568] [2022-12-13 12:46:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282893568] [2022-12-13 12:46:34,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282893568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:34,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:34,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:46:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022728093] [2022-12-13 12:46:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:34,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:34,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:34,678 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2022-12-13 12:46:34,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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-12-13 12:46:34,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:34,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2022-12-13 12:46:34,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:35,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L2-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_In_1 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_In_1 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_In_1 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_In_1) v_~y$w_buff1_used~0_Out_2) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_Out_2 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 0 v_~y$r_buff1_thd0~0_In_1) v_~y$r_buff1_thd0~0_Out_2) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_In_1) v_~y$r_buff0_thd0~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (= v_~y~0_Out_2 (ite .cse4 v_~y$w_buff0~0_In_1 (ite .cse0 v_~y$w_buff1~0_In_1 v_~y~0_In_1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_In_1) v_~y$w_buff0_used~0_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_In_1, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_1, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_Out_2, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][78], [Black: 193#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0)), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 118#L864true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 204#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 244#true, 68#L819true, 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 121#P0EXITtrue, Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 156#(= ~x~0 0), 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 37#L766true, Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 159#true, Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 173#true, 27#L799true, Black: 175#(= ~x~0 1), Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))]) [2022-12-13 12:46:35,455 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-13 12:46:35,456 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-13 12:46:35,456 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-13 12:46:35,456 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-13 12:46:35,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L2-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_In_1 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_In_1 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_In_1 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_In_1) v_~y$w_buff1_used~0_Out_2) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_Out_2 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 0 v_~y$r_buff1_thd0~0_In_1) v_~y$r_buff1_thd0~0_Out_2) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_In_1) v_~y$r_buff0_thd0~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (= v_~y~0_Out_2 (ite .cse4 v_~y$w_buff0~0_In_1 (ite .cse0 v_~y$w_buff1~0_In_1 v_~y~0_In_1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_In_1) v_~y$w_buff0_used~0_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_In_1, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_1, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_Out_2, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][118], [Black: 193#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0)), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 118#L864true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 204#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 244#true, 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 68#L819true, 121#P0EXITtrue, Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 156#(= ~x~0 0), 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 159#true, Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 173#true, 136#L769true, 27#L799true, Black: 175#(= ~x~0 1), Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))]) [2022-12-13 12:46:35,463 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:46:35,463 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:46:35,463 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:46:35,463 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:46:35,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L2-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_In_1 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_In_1 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_In_1 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_In_1) v_~y$w_buff1_used~0_Out_2) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_Out_2 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 0 v_~y$r_buff1_thd0~0_In_1) v_~y$r_buff1_thd0~0_Out_2) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_In_1) v_~y$r_buff0_thd0~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (= v_~y~0_Out_2 (ite .cse4 v_~y$w_buff0~0_In_1 (ite .cse0 v_~y$w_buff1~0_In_1 v_~y~0_In_1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_In_1) v_~y$w_buff0_used~0_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_In_1, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_1, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_Out_2, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][78], [Black: 193#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0)), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 186#true, 118#L864true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 204#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 61#L776true, 244#true, 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 68#L819true, Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 156#(= ~x~0 0), 121#P0EXITtrue, Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), 159#true, Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 173#true, 27#L799true, Black: 175#(= ~x~0 1), Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))]) [2022-12-13 12:46:35,704 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:46:35,704 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:46:35,704 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:46:35,704 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:46:35,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L2-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_In_1 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_In_1 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_In_1 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_In_1) v_~y$w_buff1_used~0_Out_2) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_Out_2 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 0 v_~y$r_buff1_thd0~0_In_1) v_~y$r_buff1_thd0~0_Out_2) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_In_1) v_~y$r_buff0_thd0~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (= v_~y~0_Out_2 (ite .cse4 v_~y$w_buff0~0_In_1 (ite .cse0 v_~y$w_buff1~0_In_1 v_~y~0_In_1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_In_1) v_~y$w_buff0_used~0_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_In_1, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_1, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_Out_2, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][78], [Black: 193#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0)), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 186#true, 118#L864true, 95#P1EXITtrue, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 204#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 244#true, 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 68#L819true, Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 156#(= ~x~0 0), 121#P0EXITtrue, Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), 159#true, Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 173#true, 27#L799true, Black: 175#(= ~x~0 1), Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))]) [2022-12-13 12:46:35,973 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:46:35,973 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:35,973 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:35,973 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:36,851 INFO L130 PetriNetUnfolder]: 12945/19438 cut-off events. [2022-12-13 12:46:36,851 INFO L131 PetriNetUnfolder]: For 163370/166097 co-relation queries the response was YES. [2022-12-13 12:46:36,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93561 conditions, 19438 events. 12945/19438 cut-off events. For 163370/166097 co-relation queries the response was YES. Maximal size of possible extension queue 1457. Compared 137429 event pairs, 2428 based on Foata normal form. 3305/21669 useless extension candidates. Maximal degree in co-relation 93527. Up to 11860 conditions per place. [2022-12-13 12:46:36,915 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 120 selfloop transitions, 9 changer transitions 44/187 dead transitions. [2022-12-13 12:46:36,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 187 transitions, 2363 flow [2022-12-13 12:46:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:46:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:46:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2022-12-13 12:46:36,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2022-12-13 12:46:36,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2022-12-13 12:46:36,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2022-12-13 12:46:36,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:36,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2022-12-13 12:46:36,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:36,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:36,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:36,920 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 770 flow. Second operand 5 states and 644 transitions. [2022-12-13 12:46:36,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 187 transitions, 2363 flow [2022-12-13 12:46:36,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 187 transitions, 2205 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-13 12:46:36,986 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 769 flow [2022-12-13 12:46:36,986 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=769, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-12-13 12:46:36,987 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-13 12:46:36,987 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 769 flow [2022-12-13 12:46:36,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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-12-13 12:46:36,987 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:36,987 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:46:36,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 335710971, now seen corresponding path program 1 times [2022-12-13 12:46:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932256716] [2022-12-13 12:46:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:37,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932256716] [2022-12-13 12:46:37,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932256716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:37,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:37,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:46:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245411405] [2022-12-13 12:46:37,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:37,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:46:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:46:37,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:46:37,100 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2022-12-13 12:46:37,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 769 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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-12-13 12:46:37,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:37,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2022-12-13 12:46:37,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:38,488 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L2-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_In_1 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_In_1 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_In_1 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_In_1) v_~y$w_buff1_used~0_Out_2) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_Out_2 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 0 v_~y$r_buff1_thd0~0_In_1) v_~y$r_buff1_thd0~0_Out_2) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_In_1) v_~y$r_buff0_thd0~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (= v_~y~0_Out_2 (ite .cse4 v_~y$w_buff0~0_In_1 (ite .cse0 v_~y$w_buff1~0_In_1 v_~y~0_In_1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_In_1) v_~y$w_buff0_used~0_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_In_1, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_1, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y~0=v_~y~0_Out_2, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][165], [Black: 193#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0)), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 186#true, 118#L864true, 95#P1EXITtrue, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), P3Thread1of1ForFork1InUse, Black: 204#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 244#true, 68#L819true, 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 121#P0EXITtrue, Black: 156#(= ~x~0 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), 254#true, 173#true, 159#true, Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), Black: 175#(= ~x~0 1), 27#L799true, Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), Black: 247#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 246#(= ~__unbuffered_cnt~0 0)]) [2022-12-13 12:46:38,488 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 12:46:38,488 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 12:46:38,488 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 12:46:38,488 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 12:46:38,882 INFO L130 PetriNetUnfolder]: 9969/15558 cut-off events. [2022-12-13 12:46:38,882 INFO L131 PetriNetUnfolder]: For 129583/134275 co-relation queries the response was YES. [2022-12-13 12:46:38,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80911 conditions, 15558 events. 9969/15558 cut-off events. For 129583/134275 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 113354 event pairs, 852 based on Foata normal form. 3218/18074 useless extension candidates. Maximal degree in co-relation 80874. Up to 7485 conditions per place. [2022-12-13 12:46:38,947 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 164 selfloop transitions, 18 changer transitions 57/253 dead transitions. [2022-12-13 12:46:38,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 253 transitions, 3096 flow [2022-12-13 12:46:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:46:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:46:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2022-12-13 12:46:38,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2022-12-13 12:46:38,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2022-12-13 12:46:38,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2022-12-13 12:46:38,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:38,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2022-12-13 12:46:38,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 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-12-13 12:46:38,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 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-12-13 12:46:38,952 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 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-12-13 12:46:38,952 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 769 flow. Second operand 7 states and 902 transitions. [2022-12-13 12:46:38,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 253 transitions, 3096 flow [2022-12-13 12:46:39,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 253 transitions, 3091 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:46:39,068 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 770 flow [2022-12-13 12:46:39,068 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=770, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2022-12-13 12:46:39,068 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2022-12-13 12:46:39,068 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 770 flow [2022-12-13 12:46:39,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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-12-13 12:46:39,069 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:39,069 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:46:39,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1654403971, now seen corresponding path program 1 times [2022-12-13 12:46:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:39,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003664975] [2022-12-13 12:46:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003664975] [2022-12-13 12:46:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003664975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:46:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989345186] [2022-12-13 12:46:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:39,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:46:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:46:39,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:46:39,181 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2022-12-13 12:46:39,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 770 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-12-13 12:46:39,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:39,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2022-12-13 12:46:39,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:40,923 INFO L130 PetriNetUnfolder]: 8967/14147 cut-off events. [2022-12-13 12:46:40,923 INFO L131 PetriNetUnfolder]: For 121832/128353 co-relation queries the response was YES. [2022-12-13 12:46:40,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81218 conditions, 14147 events. 8967/14147 cut-off events. For 121832/128353 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 104172 event pairs, 533 based on Foata normal form. 2552/16092 useless extension candidates. Maximal degree in co-relation 81177. Up to 6447 conditions per place. [2022-12-13 12:46:40,970 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 171 selfloop transitions, 27 changer transitions 70/282 dead transitions. [2022-12-13 12:46:40,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 282 transitions, 3480 flow [2022-12-13 12:46:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:46:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:46:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1159 transitions. [2022-12-13 12:46:40,972 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5090030742204655 [2022-12-13 12:46:40,972 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1159 transitions. [2022-12-13 12:46:40,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1159 transitions. [2022-12-13 12:46:40,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:40,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1159 transitions. [2022-12-13 12:46:40,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.77777777777777) internal successors, (1159), 9 states have internal predecessors, (1159), 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-12-13 12:46:40,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 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-12-13 12:46:40,976 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 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-12-13 12:46:40,976 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 770 flow. Second operand 9 states and 1159 transitions. [2022-12-13 12:46:40,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 282 transitions, 3480 flow [2022-12-13 12:46:41,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 282 transitions, 3341 flow, removed 51 selfloop flow, removed 4 redundant places. [2022-12-13 12:46:41,904 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 875 flow [2022-12-13 12:46:41,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=875, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2022-12-13 12:46:41,905 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2022-12-13 12:46:41,905 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 875 flow [2022-12-13 12:46:41,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-12-13 12:46:41,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:41,906 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:41,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:46:41,906 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1969859744, now seen corresponding path program 1 times [2022-12-13 12:46:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:41,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78979438] [2022-12-13 12:46:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78979438] [2022-12-13 12:46:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78979438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:42,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:46:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695279294] [2022-12-13 12:46:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:46:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:46:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:46:42,106 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2022-12-13 12:46:42,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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-12-13 12:46:42,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:42,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2022-12-13 12:46:42,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:43,944 INFO L130 PetriNetUnfolder]: 8664/13750 cut-off events. [2022-12-13 12:46:43,944 INFO L131 PetriNetUnfolder]: For 107051/111235 co-relation queries the response was YES. [2022-12-13 12:46:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78051 conditions, 13750 events. 8664/13750 cut-off events. For 107051/111235 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 102510 event pairs, 507 based on Foata normal form. 1823/14977 useless extension candidates. Maximal degree in co-relation 78008. Up to 6156 conditions per place. [2022-12-13 12:46:44,008 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 156 selfloop transitions, 32 changer transitions 75/275 dead transitions. [2022-12-13 12:46:44,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 275 transitions, 3341 flow [2022-12-13 12:46:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:46:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:46:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1392 transitions. [2022-12-13 12:46:44,010 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5001796622349982 [2022-12-13 12:46:44,010 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1392 transitions. [2022-12-13 12:46:44,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1392 transitions. [2022-12-13 12:46:44,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:44,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1392 transitions. [2022-12-13 12:46:44,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.54545454545455) internal successors, (1392), 11 states have internal predecessors, (1392), 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-12-13 12:46:44,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 253.0) internal successors, (3036), 12 states have internal predecessors, (3036), 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-12-13 12:46:44,015 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 253.0) internal successors, (3036), 12 states have internal predecessors, (3036), 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-12-13 12:46:44,015 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 875 flow. Second operand 11 states and 1392 transitions. [2022-12-13 12:46:44,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 275 transitions, 3341 flow [2022-12-13 12:46:45,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 275 transitions, 3147 flow, removed 67 selfloop flow, removed 6 redundant places. [2022-12-13 12:46:45,886 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 771 flow [2022-12-13 12:46:45,886 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=771, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2022-12-13 12:46:45,887 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2022-12-13 12:46:45,887 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 771 flow [2022-12-13 12:46:45,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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-12-13 12:46:45,887 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:45,887 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:45,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:46:45,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1847212670, now seen corresponding path program 1 times [2022-12-13 12:46:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:45,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230445423] [2022-12-13 12:46:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:46,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:46,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230445423] [2022-12-13 12:46:46,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230445423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:46,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:46,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:46:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117615487] [2022-12-13 12:46:46,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:46,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:46:46,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:46,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:46:46,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:46:46,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2022-12-13 12:46:46,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 771 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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-12-13 12:46:46,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:46,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2022-12-13 12:46:46,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:47,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L819-->L822: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][48], [278#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 247#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 186#true, 95#P1EXITtrue, P0Thread1of1ForFork0InUse, 81#L2true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 90#L822true, Black: 271#(<= ~__unbuffered_cnt~0 2), Black: 272#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 121#P0EXITtrue, Black: 156#(= ~x~0 0), 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), Black: 289#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 297#(and (<= ~__unbuffered_cnt~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 173#true, 159#true, Black: 288#(<= ~__unbuffered_cnt~0 3), 295#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L799true, Black: 175#(= ~x~0 1), Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 246#(= ~__unbuffered_cnt~0 0), 307#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2022-12-13 12:46:47,112 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,112 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,112 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,113 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L819-->L822: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][48], [278#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 191#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 186#true, 95#P1EXITtrue, P0Thread1of1ForFork0InUse, 81#L2true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 205#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0)), 90#L822true, Black: 271#(<= ~__unbuffered_cnt~0 2), Black: 272#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 228#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 121#P0EXITtrue, Black: 156#(= ~x~0 0), 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 162#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 225#(= ~z~0 1), Black: 289#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 297#(and (<= ~__unbuffered_cnt~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 173#true, 159#true, Black: 288#(<= ~__unbuffered_cnt~0 3), 295#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L799true, Black: 175#(= ~x~0 1), Black: 176#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 1)), Black: 247#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 238#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 246#(= ~__unbuffered_cnt~0 0), 307#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2022-12-13 12:46:47,116 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,116 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,116 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,116 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:46:47,377 INFO L130 PetriNetUnfolder]: 8154/13031 cut-off events. [2022-12-13 12:46:47,377 INFO L131 PetriNetUnfolder]: For 73788/74449 co-relation queries the response was YES. [2022-12-13 12:46:47,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68341 conditions, 13031 events. 8154/13031 cut-off events. For 73788/74449 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 94825 event pairs, 1640 based on Foata normal form. 215/12983 useless extension candidates. Maximal degree in co-relation 68296. Up to 6356 conditions per place. [2022-12-13 12:46:47,436 INFO L137 encePairwiseOnDemand]: 250/253 looper letters, 54 selfloop transitions, 1 changer transitions 132/192 dead transitions. [2022-12-13 12:46:47,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 192 transitions, 2202 flow [2022-12-13 12:46:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:46:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:46:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-12-13 12:46:47,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5177865612648221 [2022-12-13 12:46:47,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2022-12-13 12:46:47,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2022-12-13 12:46:47,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:47,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2022-12-13 12:46:47,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 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-12-13 12:46:47,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:47,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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-12-13 12:46:47,441 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 771 flow. Second operand 4 states and 524 transitions. [2022-12-13 12:46:47,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 192 transitions, 2202 flow [2022-12-13 12:46:48,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 192 transitions, 1917 flow, removed 58 selfloop flow, removed 12 redundant places. [2022-12-13 12:46:48,132 INFO L231 Difference]: Finished difference. Result has 92 places, 52 transitions, 393 flow [2022-12-13 12:46:48,132 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=92, PETRI_TRANSITIONS=52} [2022-12-13 12:46:48,132 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2022-12-13 12:46:48,133 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 52 transitions, 393 flow [2022-12-13 12:46:48,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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-12-13 12:46:48,133 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:48,133 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:48,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:46:48,133 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:48,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1118199994, now seen corresponding path program 2 times [2022-12-13 12:46:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:48,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989434871] [2022-12-13 12:46:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:48,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:48,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989434871] [2022-12-13 12:46:48,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989434871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:48,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:48,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:46:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742651400] [2022-12-13 12:46:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:48,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:46:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:48,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:46:48,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:46:48,494 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 253 [2022-12-13 12:46:48,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 52 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 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-12-13 12:46:48,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:48,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 253 [2022-12-13 12:46:48,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:48,701 INFO L130 PetriNetUnfolder]: 393/725 cut-off events. [2022-12-13 12:46:48,701 INFO L131 PetriNetUnfolder]: For 2548/2556 co-relation queries the response was YES. [2022-12-13 12:46:48,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 725 events. 393/725 cut-off events. For 2548/2556 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3152 event pairs, 23 based on Foata normal form. 5/725 useless extension candidates. Maximal degree in co-relation 3346. Up to 445 conditions per place. [2022-12-13 12:46:48,704 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 55 selfloop transitions, 14 changer transitions 10/83 dead transitions. [2022-12-13 12:46:48,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 745 flow [2022-12-13 12:46:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:46:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:46:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2022-12-13 12:46:48,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5006587615283268 [2022-12-13 12:46:48,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2022-12-13 12:46:48,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2022-12-13 12:46:48,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:48,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2022-12-13 12:46:48,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:48,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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-12-13 12:46:48,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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-12-13 12:46:48,708 INFO L175 Difference]: Start difference. First operand has 92 places, 52 transitions, 393 flow. Second operand 6 states and 760 transitions. [2022-12-13 12:46:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 745 flow [2022-12-13 12:46:48,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 647 flow, removed 32 selfloop flow, removed 19 redundant places. [2022-12-13 12:46:48,714 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 373 flow [2022-12-13 12:46:48,714 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2022-12-13 12:46:48,714 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-13 12:46:48,715 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 373 flow [2022-12-13 12:46:48,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 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-12-13 12:46:48,715 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:48,715 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:46:48,715 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1371075564, now seen corresponding path program 3 times [2022-12-13 12:46:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478480734] [2022-12-13 12:46:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:46:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:46:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478480734] [2022-12-13 12:46:49,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478480734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:46:49,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:46:49,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:46:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738419804] [2022-12-13 12:46:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:46:49,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:46:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:46:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:46:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:46:49,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2022-12-13 12:46:49,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 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-12-13 12:46:49,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:46:49,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2022-12-13 12:46:49,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:46:49,761 INFO L130 PetriNetUnfolder]: 413/771 cut-off events. [2022-12-13 12:46:49,761 INFO L131 PetriNetUnfolder]: For 2245/2253 co-relation queries the response was YES. [2022-12-13 12:46:49,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 771 events. 413/771 cut-off events. For 2245/2253 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3459 event pairs, 92 based on Foata normal form. 5/772 useless extension candidates. Maximal degree in co-relation 3575. Up to 411 conditions per place. [2022-12-13 12:46:49,763 INFO L137 encePairwiseOnDemand]: 248/253 looper letters, 49 selfloop transitions, 8 changer transitions 15/76 dead transitions. [2022-12-13 12:46:49,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 651 flow [2022-12-13 12:46:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:46:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:46:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2022-12-13 12:46:49,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48774703557312254 [2022-12-13 12:46:49,764 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2022-12-13 12:46:49,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2022-12-13 12:46:49,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:46:49,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2022-12-13 12:46:49,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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-12-13 12:46:49,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:49,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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-12-13 12:46:49,767 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 373 flow. Second operand 5 states and 617 transitions. [2022-12-13 12:46:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 651 flow [2022-12-13 12:46:49,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 634 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 12:46:49,772 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 344 flow [2022-12-13 12:46:49,772 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2022-12-13 12:46:49,773 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2022-12-13 12:46:49,773 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 344 flow [2022-12-13 12:46:49,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 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-12-13 12:46:49,773 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:46:49,774 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:46:49,774 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:46:49,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1118743522, now seen corresponding path program 4 times [2022-12-13 12:46:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:46:49,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071932841] [2022-12-13 12:46:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:46:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:46:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:46:49,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:46:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:46:49,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:46:49,860 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:46:49,861 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 12:46:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 12:46:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 12:46:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 12:46:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 12:46:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 12:46:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 12:46:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:46:49,863 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:46:49,868 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:46:49,868 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:46:49,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:49 BasicIcfg [2022-12-13 12:46:49,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:46:49,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:46:49,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:46:49,919 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:46:49,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:10" (3/4) ... [2022-12-13 12:46:49,921 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 12:46:49,972 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:46:49,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:46:49,972 INFO L158 Benchmark]: Toolchain (without parser) took 40412.02ms. Allocated memory was 132.1MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 96.4MB in the beginning and 994.3MB in the end (delta: -897.9MB). Peak memory consumption was 970.0MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,972 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 107.0MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:46:49,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.44ms. Allocated memory is still 132.1MB. Free memory was 96.4MB in the beginning and 68.7MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 65.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,973 INFO L158 Benchmark]: Boogie Preprocessor took 30.32ms. Allocated memory is still 132.1MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,973 INFO L158 Benchmark]: RCFGBuilder took 493.27ms. Allocated memory is still 132.1MB. Free memory was 63.6MB in the beginning and 76.7MB in the end (delta: -13.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,973 INFO L158 Benchmark]: TraceAbstraction took 39284.36ms. Allocated memory was 132.1MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 75.9MB in the beginning and 1.0GB in the end (delta: -933.0MB). Peak memory consumption was 933.2MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,974 INFO L158 Benchmark]: Witness Printer took 52.61ms. Allocated memory is still 2.0GB. Free memory was 1.0GB in the beginning and 994.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 12:46:49,975 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.12ms. Allocated memory is still 107.0MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.44ms. Allocated memory is still 132.1MB. Free memory was 96.4MB in the beginning and 68.7MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 65.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.32ms. Allocated memory is still 132.1MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 493.27ms. Allocated memory is still 132.1MB. Free memory was 63.6MB in the beginning and 76.7MB in the end (delta: -13.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 39284.36ms. Allocated memory was 132.1MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 75.9MB in the beginning and 1.0GB in the end (delta: -933.0MB). Peak memory consumption was 933.2MB. Max. memory is 16.1GB. * Witness Printer took 52.61ms. Allocated memory is still 2.0GB. Free memory was 1.0GB in the beginning and 994.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 143 PlacesBefore, 42 PlacesAfterwards, 132 TransitionsBefore, 29 TransitionsAfterwards, 3218 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 8530 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3685, independent: 3459, independent conditional: 0, independent unconditional: 3459, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1751, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3685, independent: 1753, independent conditional: 0, independent unconditional: 1753, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1751, unknown conditional: 0, unknown unconditional: 1751] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [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$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=8, t577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=9, t577={5:0}, t578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=10, t577={5:0}, t578={6:0}, t579={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=11, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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: 847]: 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: 849]: 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1069 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2139 IncrementalHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 135 mSDtfsCounter, 2139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=14, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 2829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-12-13 12:46:49,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02f6b9c8-a14d-41f5-a944-ea5b289818df/bin/uautomizer-uyxdKDjOR8/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