./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:39:12,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:39:12,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:39:12,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:39:12,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:39:12,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:39:12,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:39:12,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:39:12,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:39:12,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:39:12,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:39:12,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:39:12,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:39:12,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:39:12,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:39:12,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:39:12,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:39:12,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:39:12,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:39:12,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:39:12,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:39:12,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:39:12,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:39:12,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:39:12,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:39:12,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:39:12,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:39:12,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:39:12,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:39:12,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:39:12,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:39:12,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:39:12,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:39:12,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:39:12,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:39:12,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:39:12,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:39:12,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:39:12,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:39:12,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:39:12,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:39:12,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:39:12,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:39:12,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:39:12,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:39:12,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:39:12,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:39:12,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:39:12,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:39:12,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:39:12,789 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:39:12,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:39:12,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:39:12,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:39:12,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:39:12,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:39:12,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:39:12,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:39:12,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:39:12,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:39:12,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:39:12,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:39:12,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:39:12,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:39:12,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:39:12,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:39:12,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:39:12,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:39:12,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:39:12,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:39:12,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:39:12,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:39:12,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:39:12,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:39:12,797 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:39:12,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:39:12,798 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_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2022-11-25 15:39:13,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:39:13,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:39:13,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:39:13,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:39:13,079 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:39:13,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2022-11-25 15:39:16,239 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:39:16,535 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:39:16,536 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2022-11-25 15:39:16,549 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/data/6146ec809/e9509752268141db89f86468c7853623/FLAG41cddc6dc [2022-11-25 15:39:16,564 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/data/6146ec809/e9509752268141db89f86468c7853623 [2022-11-25 15:39:16,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:39:16,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:39:16,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:39:16,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:39:16,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:39:16,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:39:16" (1/1) ... [2022-11-25 15:39:16,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28080814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:16, skipping insertion in model container [2022-11-25 15:39:16,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:39:16" (1/1) ... [2022-11-25 15:39:16,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:39:16,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:39:16,836 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_fe857bee-1ff2-417a-bb43-61f5104d0920/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2022-11-25 15:39:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:39:17,185 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:39:17,197 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_fe857bee-1ff2-417a-bb43-61f5104d0920/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2022-11-25 15:39:17,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:17,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:17,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:39:17,350 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:39:17,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17 WrapperNode [2022-11-25 15:39:17,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:39:17,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:39:17,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:39:17,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:39:17,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,446 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-11-25 15:39:17,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:39:17,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:39:17,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:39:17,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:39:17,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:39:17,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:39:17,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:39:17,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:39:17,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (1/1) ... [2022-11-25 15:39:17,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:39:17,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:39:17,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:39:17,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:39:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:39:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:39:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:39:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:39:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:39:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:39:17,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:39:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:39:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:39:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:39:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:39:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:39:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:39:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:39:17,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:39:17,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:39:17,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:39:17,627 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:39:17,825 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:39:17,827 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:39:18,207 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:39:18,372 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:39:18,373 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:39:18,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:18 BoogieIcfgContainer [2022-11-25 15:39:18,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:39:18,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:39:18,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:39:18,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:39:18,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:39:16" (1/3) ... [2022-11-25 15:39:18,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614724eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:39:18, skipping insertion in model container [2022-11-25 15:39:18,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:17" (2/3) ... [2022-11-25 15:39:18,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614724eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:39:18, skipping insertion in model container [2022-11-25 15:39:18,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:18" (3/3) ... [2022-11-25 15:39:18,384 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2022-11-25 15:39:18,393 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:39:18,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:39:18,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:39:18,404 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:39:18,518 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:39:18,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 15:39:18,649 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 15:39:18,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:18,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-25 15:39:18,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 15:39:18,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-25 15:39:18,665 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:39:18,681 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 15:39:18,684 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 15:39:18,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-11-25 15:39:18,724 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 15:39:18,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-25 15:39:18,727 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2022-11-25 15:39:25,402 INFO L134 LiptonReduction]: Checked pairs total: 6900 [2022-11-25 15:39:25,402 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-25 15:39:25,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:39:25,426 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;@64f0bbad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:39:25,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 15:39:25,434 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-11-25 15:39:25,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:25,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:25,435 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:25,436 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1185740151, now seen corresponding path program 1 times [2022-11-25 15:39:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:25,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319689253] [2022-11-25 15:39:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:26,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319689253] [2022-11-25 15:39:26,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319689253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:26,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:26,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:39:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375197392] [2022-11-25 15:39:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:26,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:39:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:39:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:39:26,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 255 [2022-11-25 15:39:26,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:26,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:26,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 255 [2022-11-25 15:39:26,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:26,875 INFO L130 PetriNetUnfolder]: 2483/3881 cut-off events. [2022-11-25 15:39:26,876 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-11-25 15:39:26,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 3881 events. 2483/3881 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 22536 event pairs, 593 based on Foata normal form. 0/3733 useless extension candidates. Maximal degree in co-relation 7417. Up to 2539 conditions per place. [2022-11-25 15:39:26,908 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2022-11-25 15:39:26,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-11-25 15:39:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:39:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:39:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2022-11-25 15:39:26,929 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5359477124183006 [2022-11-25 15:39:26,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2022-11-25 15:39:26,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2022-11-25 15:39:26,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:26,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2022-11-25 15:39:26,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:26,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:26,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:26,953 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 410 transitions. [2022-11-25 15:39:26,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-11-25 15:39:26,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:26,963 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-25 15:39:26,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 15:39:26,969 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 15:39:26,969 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-25 15:39:26,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:26,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:26,970 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:26,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:39:26,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1719433278, now seen corresponding path program 1 times [2022-11-25 15:39:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:26,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508176482] [2022-11-25 15:39:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508176482] [2022-11-25 15:39:27,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508176482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:27,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:27,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:39:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487232149] [2022-11-25 15:39:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:27,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:27,266 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 255 [2022-11-25 15:39:27,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:27,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:27,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 255 [2022-11-25 15:39:27,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:29,154 INFO L130 PetriNetUnfolder]: 9425/13038 cut-off events. [2022-11-25 15:39:29,155 INFO L131 PetriNetUnfolder]: For 504/504 co-relation queries the response was YES. [2022-11-25 15:39:29,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26854 conditions, 13038 events. 9425/13038 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 66821 event pairs, 3245 based on Foata normal form. 568/13606 useless extension candidates. Maximal degree in co-relation 26844. Up to 8141 conditions per place. [2022-11-25 15:39:29,242 INFO L137 encePairwiseOnDemand]: 246/255 looper letters, 40 selfloop transitions, 7 changer transitions 29/76 dead transitions. [2022-11-25 15:39:29,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2022-11-25 15:39:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2022-11-25 15:39:29,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.508235294117647 [2022-11-25 15:39:29,245 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2022-11-25 15:39:29,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2022-11-25 15:39:29,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:29,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2022-11-25 15:39:29,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:29,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:29,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:29,253 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 648 transitions. [2022-11-25 15:39:29,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2022-11-25 15:39:29,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:39:29,263 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 130 flow [2022-11-25 15:39:29,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-11-25 15:39:29,264 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-25 15:39:29,265 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 130 flow [2022-11-25 15:39:29,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:29,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:29,266 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:29,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:39:29,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1762834895, now seen corresponding path program 1 times [2022-11-25 15:39:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:29,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765688892] [2022-11-25 15:39:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765688892] [2022-11-25 15:39:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765688892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:29,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:29,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657048604] [2022-11-25 15:39:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:29,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:29,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:29,552 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 255 [2022-11-25 15:39:29,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:29,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:29,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 255 [2022-11-25 15:39:29,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:31,491 INFO L130 PetriNetUnfolder]: 8193/11406 cut-off events. [2022-11-25 15:39:31,491 INFO L131 PetriNetUnfolder]: For 8356/8356 co-relation queries the response was YES. [2022-11-25 15:39:31,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31750 conditions, 11406 events. 8193/11406 cut-off events. For 8356/8356 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 56537 event pairs, 1917 based on Foata normal form. 504/11910 useless extension candidates. Maximal degree in co-relation 31736. Up to 5461 conditions per place. [2022-11-25 15:39:31,598 INFO L137 encePairwiseOnDemand]: 246/255 looper letters, 47 selfloop transitions, 8 changer transitions 38/93 dead transitions. [2022-11-25 15:39:31,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 544 flow [2022-11-25 15:39:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:39:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2022-11-25 15:39:31,603 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4957983193277311 [2022-11-25 15:39:31,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2022-11-25 15:39:31,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2022-11-25 15:39:31,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:31,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2022-11-25 15:39:31,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:31,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:31,613 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:31,613 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 130 flow. Second operand 7 states and 885 transitions. [2022-11-25 15:39:31,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 544 flow [2022-11-25 15:39:31,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 93 transitions, 498 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 15:39:31,730 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 186 flow [2022-11-25 15:39:31,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2022-11-25 15:39:31,731 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-11-25 15:39:31,731 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 186 flow [2022-11-25 15:39:31,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:31,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:31,732 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:31,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:39:31,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash 501639190, now seen corresponding path program 1 times [2022-11-25 15:39:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:31,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091033892] [2022-11-25 15:39:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:31,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091033892] [2022-11-25 15:39:31,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091033892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:31,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:31,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:39:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779514838] [2022-11-25 15:39:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:31,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:31,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:31,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:31,966 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-11-25 15:39:31,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:31,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:31,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-11-25 15:39:31,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:33,768 INFO L130 PetriNetUnfolder]: 6115/8974 cut-off events. [2022-11-25 15:39:33,768 INFO L131 PetriNetUnfolder]: For 14183/14251 co-relation queries the response was YES. [2022-11-25 15:39:33,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25999 conditions, 8974 events. 6115/8974 cut-off events. For 14183/14251 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 49980 event pairs, 2676 based on Foata normal form. 373/9041 useless extension candidates. Maximal degree in co-relation 25979. Up to 6895 conditions per place. [2022-11-25 15:39:33,861 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 43 selfloop transitions, 6 changer transitions 21/77 dead transitions. [2022-11-25 15:39:33,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 490 flow [2022-11-25 15:39:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2022-11-25 15:39:33,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5223529411764706 [2022-11-25 15:39:33,864 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2022-11-25 15:39:33,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2022-11-25 15:39:33,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:33,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2022-11-25 15:39:33,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:33,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:33,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:33,872 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 186 flow. Second operand 5 states and 666 transitions. [2022-11-25 15:39:33,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 490 flow [2022-11-25 15:39:33,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 479 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:33,935 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 241 flow [2022-11-25 15:39:33,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-11-25 15:39:33,936 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-11-25 15:39:33,936 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 241 flow [2022-11-25 15:39:33,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:33,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:33,937 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:33,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:39:33,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1627306493, now seen corresponding path program 1 times [2022-11-25 15:39:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616703237] [2022-11-25 15:39:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:34,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616703237] [2022-11-25 15:39:34,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616703237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:34,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:34,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667796509] [2022-11-25 15:39:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:34,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:34,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-11-25 15:39:34,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:34,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:34,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-11-25 15:39:34,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:35,184 INFO L130 PetriNetUnfolder]: 4404/6559 cut-off events. [2022-11-25 15:39:35,185 INFO L131 PetriNetUnfolder]: For 9618/10157 co-relation queries the response was YES. [2022-11-25 15:39:35,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19125 conditions, 6559 events. 4404/6559 cut-off events. For 9618/10157 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 37906 event pairs, 1024 based on Foata normal form. 559/6780 useless extension candidates. Maximal degree in co-relation 19103. Up to 4472 conditions per place. [2022-11-25 15:39:35,257 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 71 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2022-11-25 15:39:35,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 93 transitions, 659 flow [2022-11-25 15:39:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-11-25 15:39:35,262 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5145098039215686 [2022-11-25 15:39:35,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2022-11-25 15:39:35,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2022-11-25 15:39:35,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:35,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2022-11-25 15:39:35,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:35,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:35,271 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:35,271 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 241 flow. Second operand 5 states and 656 transitions. [2022-11-25 15:39:35,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 93 transitions, 659 flow [2022-11-25 15:39:35,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 621 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:35,299 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 296 flow [2022-11-25 15:39:35,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2022-11-25 15:39:35,303 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-11-25 15:39:35,303 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 296 flow [2022-11-25 15:39:35,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:35,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:35,304 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:35,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:39:35,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2122234967, now seen corresponding path program 1 times [2022-11-25 15:39:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:35,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825272401] [2022-11-25 15:39:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:35,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:35,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825272401] [2022-11-25 15:39:35,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825272401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:35,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:35,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040036291] [2022-11-25 15:39:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:35,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:35,554 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-11-25 15:39:35,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:35,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:35,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-11-25 15:39:35,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:36,442 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L874-->L878-1: Formula: (and (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_23 1) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_28 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_24 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [75#L878-1true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 28#L829true, 7#L773true, 207#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 55#L801true, Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,442 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,443 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,443 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,443 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,444 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L874-->L878-1: Formula: (and (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_23 1) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_28 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_24 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [75#L878-1true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 16#L770true, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, 125#L832true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 207#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 55#L801true, Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,444 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,445 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,445 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,445 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_75 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_76 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33)) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse1 v_~z$w_buff1~0_32 v_~z~0_45))) (= v_~z$w_buff0_used~0_75 (ite .cse2 0 v_~z$w_buff0_used~0_76)) (= v_~z$r_buff1_thd4~0_23 (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_24))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][64], [Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 16#L770true, Black: 194#(= ~__unbuffered_cnt~0 0), 79#L874true, Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 61#L839true, Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 204#(= ~x~0 1), Black: 184#(= ~x~0 0), 55#L801true]) [2022-11-25 15:39:36,446 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,446 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,446 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,446 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 15:39:36,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L874-->L878-1: Formula: (and (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_23 1) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_28 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_24 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [75#L878-1true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, 125#L832true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 7#L773true, 207#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 55#L801true, Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,628 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,629 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,629 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,629 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_75 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_76 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33)) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse1 v_~z$w_buff1~0_32 v_~z~0_45))) (= v_~z$w_buff0_used~0_75 (ite .cse2 0 v_~z$w_buff0_used~0_76)) (= v_~z$r_buff1_thd4~0_23 (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_24))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][64], [Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 194#(= ~__unbuffered_cnt~0 0), 79#L874true, Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 61#L839true, 7#L773true, Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 204#(= ~x~0 1), Black: 184#(= ~x~0 0), 55#L801true]) [2022-11-25 15:39:36,630 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,630 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,631 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,631 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L874-->L878-1: Formula: (and (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_23 1) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_28 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_24 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [75#L878-1true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, P0Thread1of1ForFork1InUse, 65#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 28#L829true, 7#L773true, 207#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,647 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,648 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,648 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,648 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L874-->L878-1: Formula: (and (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_23 1) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_28 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_24 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [75#L878-1true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 16#L770true, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, 125#L832true, P0Thread1of1ForFork1InUse, 65#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 207#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,649 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,649 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,649 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,649 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_75 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_76 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33)) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse1 v_~z$w_buff1~0_32 v_~z~0_45))) (= v_~z$w_buff0_used~0_75 (ite .cse2 0 v_~z$w_buff0_used~0_76)) (= v_~z$r_buff1_thd4~0_23 (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_24))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][64], [Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 16#L770true, Black: 194#(= ~__unbuffered_cnt~0 0), 79#L874true, Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, P0Thread1of1ForFork1InUse, 65#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 61#L839true, Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 204#(= ~x~0 1), Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,650 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,650 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,650 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,651 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:39:36,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_75 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_76 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33)) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse1 v_~z$w_buff1~0_32 v_~z~0_45))) (= v_~z$w_buff0_used~0_75 (ite .cse2 0 v_~z$w_buff0_used~0_76)) (= v_~z$r_buff1_thd4~0_23 (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_24))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][64], [Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 194#(= ~__unbuffered_cnt~0 0), 79#L874true, Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, P0Thread1of1ForFork1InUse, 65#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 61#L839true, 7#L773true, Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 204#(= ~x~0 1), Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,746 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,746 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,746 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,746 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L874-->L878-1: Formula: (and (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_28 0) (= v_~__unbuffered_p3_EAX~0_23 1) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_28 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_24 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} OutVars{ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][69], [75#L878-1true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 192#true, Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 166#true, 125#L832true, P0Thread1of1ForFork1InUse, 65#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 169#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 101#P0EXITtrue, P1Thread1of1ForFork3InUse, Black: 168#(<= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, 7#L773true, 207#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 187#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(= ~x~0 0)]) [2022-11-25 15:39:36,749 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,749 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,749 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,750 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:39:36,969 INFO L130 PetriNetUnfolder]: 5971/9064 cut-off events. [2022-11-25 15:39:36,969 INFO L131 PetriNetUnfolder]: For 17105/17536 co-relation queries the response was YES. [2022-11-25 15:39:37,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33617 conditions, 9064 events. 5971/9064 cut-off events. For 17105/17536 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 55907 event pairs, 2482 based on Foata normal form. 176/8704 useless extension candidates. Maximal degree in co-relation 33594. Up to 4047 conditions per place. [2022-11-25 15:39:37,043 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 59 selfloop transitions, 7 changer transitions 20/92 dead transitions. [2022-11-25 15:39:37,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 678 flow [2022-11-25 15:39:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2022-11-25 15:39:37,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5207843137254902 [2022-11-25 15:39:37,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2022-11-25 15:39:37,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2022-11-25 15:39:37,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:37,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2022-11-25 15:39:37,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:37,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:37,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:37,056 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 296 flow. Second operand 5 states and 664 transitions. [2022-11-25 15:39:37,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 678 flow [2022-11-25 15:39:37,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 92 transitions, 665 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-25 15:39:37,114 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 302 flow [2022-11-25 15:39:37,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-11-25 15:39:37,117 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-11-25 15:39:37,117 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 302 flow [2022-11-25 15:39:37,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:37,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:37,118 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:39:37,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash -667388827, now seen corresponding path program 1 times [2022-11-25 15:39:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800752068] [2022-11-25 15:39:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:37,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:37,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800752068] [2022-11-25 15:39:37,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800752068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:37,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:37,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656553766] [2022-11-25 15:39:37,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:37,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:37,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:37,506 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-11-25 15:39:37,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:37,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:37,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-11-25 15:39:37,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:38,735 INFO L130 PetriNetUnfolder]: 3448/5452 cut-off events. [2022-11-25 15:39:38,736 INFO L131 PetriNetUnfolder]: For 10827/11664 co-relation queries the response was YES. [2022-11-25 15:39:38,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20110 conditions, 5452 events. 3448/5452 cut-off events. For 10827/11664 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 33863 event pairs, 408 based on Foata normal form. 676/5921 useless extension candidates. Maximal degree in co-relation 20084. Up to 2159 conditions per place. [2022-11-25 15:39:38,775 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 95 selfloop transitions, 19 changer transitions 0/124 dead transitions. [2022-11-25 15:39:38,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 977 flow [2022-11-25 15:39:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:39:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2022-11-25 15:39:38,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5148459383753501 [2022-11-25 15:39:38,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2022-11-25 15:39:38,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2022-11-25 15:39:38,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:38,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2022-11-25 15:39:38,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:38,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:38,789 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:38,789 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 302 flow. Second operand 7 states and 919 transitions. [2022-11-25 15:39:38,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 977 flow [2022-11-25 15:39:38,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 927 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:38,815 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 421 flow [2022-11-25 15:39:38,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=421, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2022-11-25 15:39:38,817 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2022-11-25 15:39:38,817 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 421 flow [2022-11-25 15:39:38,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:38,818 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:38,818 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:38,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:39:38,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1225044148, now seen corresponding path program 1 times [2022-11-25 15:39:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:38,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455221139] [2022-11-25 15:39:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:39,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455221139] [2022-11-25 15:39:39,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455221139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:39,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:39,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:39:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825478456] [2022-11-25 15:39:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:39,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-11-25 15:39:39,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:39,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:39,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-11-25 15:39:39,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:40,176 INFO L130 PetriNetUnfolder]: 2993/4770 cut-off events. [2022-11-25 15:39:40,176 INFO L131 PetriNetUnfolder]: For 13227/14620 co-relation queries the response was YES. [2022-11-25 15:39:40,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20530 conditions, 4770 events. 2993/4770 cut-off events. For 13227/14620 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 29804 event pairs, 237 based on Foata normal form. 636/5219 useless extension candidates. Maximal degree in co-relation 20502. Up to 1965 conditions per place. [2022-11-25 15:39:40,223 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 103 selfloop transitions, 28 changer transitions 10/151 dead transitions. [2022-11-25 15:39:40,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 151 transitions, 1251 flow [2022-11-25 15:39:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:39:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:39:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1180 transitions. [2022-11-25 15:39:40,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.514161220043573 [2022-11-25 15:39:40,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1180 transitions. [2022-11-25 15:39:40,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1180 transitions. [2022-11-25 15:39:40,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:40,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1180 transitions. [2022-11-25 15:39:40,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.11111111111111) internal successors, (1180), 9 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:40,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:40,242 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:40,242 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 421 flow. Second operand 9 states and 1180 transitions. [2022-11-25 15:39:40,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 151 transitions, 1251 flow [2022-11-25 15:39:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 151 transitions, 1201 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:40,515 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 549 flow [2022-11-25 15:39:40,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2022-11-25 15:39:40,516 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2022-11-25 15:39:40,517 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 549 flow [2022-11-25 15:39:40,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:40,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:40,518 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:40,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:39:40,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash -307631706, now seen corresponding path program 1 times [2022-11-25 15:39:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761428682] [2022-11-25 15:39:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:40,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:40,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761428682] [2022-11-25 15:39:40,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761428682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:40,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:40,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5440191] [2022-11-25 15:39:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:40,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:40,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:40,882 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-11-25 15:39:40,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:40,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:40,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-11-25 15:39:40,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:42,061 INFO L130 PetriNetUnfolder]: 5221/8040 cut-off events. [2022-11-25 15:39:42,061 INFO L131 PetriNetUnfolder]: For 34626/34626 co-relation queries the response was YES. [2022-11-25 15:39:42,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36956 conditions, 8040 events. 5221/8040 cut-off events. For 34626/34626 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 48091 event pairs, 275 based on Foata normal form. 16/8056 useless extension candidates. Maximal degree in co-relation 36925. Up to 4129 conditions per place. [2022-11-25 15:39:42,104 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 93 selfloop transitions, 23 changer transitions 80/196 dead transitions. [2022-11-25 15:39:42,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 196 transitions, 2078 flow [2022-11-25 15:39:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:39:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2022-11-25 15:39:42,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4918767507002801 [2022-11-25 15:39:42,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2022-11-25 15:39:42,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2022-11-25 15:39:42,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:42,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2022-11-25 15:39:42,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,119 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,120 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 549 flow. Second operand 7 states and 878 transitions. [2022-11-25 15:39:42,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 196 transitions, 2078 flow [2022-11-25 15:39:42,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 196 transitions, 1737 flow, removed 120 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:42,682 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 514 flow [2022-11-25 15:39:42,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=514, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2022-11-25 15:39:42,683 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2022-11-25 15:39:42,683 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 514 flow [2022-11-25 15:39:42,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:42,684 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:42,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:39:42,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:42,685 INFO L85 PathProgramCache]: Analyzing trace with hash -569768764, now seen corresponding path program 2 times [2022-11-25 15:39:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:42,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315006566] [2022-11-25 15:39:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:42,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-11-25 15:39:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:42,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315006566] [2022-11-25 15:39:42,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315006566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:42,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:42,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710714810] [2022-11-25 15:39:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:42,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:39:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:42,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:39:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:39:43,015 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-11-25 15:39:43,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 514 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:43,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-11-25 15:39:43,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:43,599 INFO L130 PetriNetUnfolder]: 1337/2213 cut-off events. [2022-11-25 15:39:43,599 INFO L131 PetriNetUnfolder]: For 7513/7846 co-relation queries the response was YES. [2022-11-25 15:39:43,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9266 conditions, 2213 events. 1337/2213 cut-off events. For 7513/7846 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12194 event pairs, 160 based on Foata normal form. 158/2294 useless extension candidates. Maximal degree in co-relation 9235. Up to 773 conditions per place. [2022-11-25 15:39:43,619 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 67 selfloop transitions, 18 changer transitions 24/123 dead transitions. [2022-11-25 15:39:43,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 123 transitions, 1176 flow [2022-11-25 15:39:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:39:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:39:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1029 transitions. [2022-11-25 15:39:43,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044117647058823 [2022-11-25 15:39:43,624 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1029 transitions. [2022-11-25 15:39:43,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1029 transitions. [2022-11-25 15:39:43,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:43,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1029 transitions. [2022-11-25 15:39:43,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.625) internal successors, (1029), 8 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,634 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,634 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 514 flow. Second operand 8 states and 1029 transitions. [2022-11-25 15:39:43,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 123 transitions, 1176 flow [2022-11-25 15:39:43,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 1089 flow, removed 41 selfloop flow, removed 9 redundant places. [2022-11-25 15:39:43,681 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 473 flow [2022-11-25 15:39:43,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2022-11-25 15:39:43,683 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-11-25 15:39:43,683 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 473 flow [2022-11-25 15:39:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:43,684 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:43,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:39:43,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -552995021, now seen corresponding path program 1 times [2022-11-25 15:39:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:43,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569058072] [2022-11-25 15:39:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:43,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569058072] [2022-11-25 15:39:43,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569058072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:43,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:43,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437395776] [2022-11-25 15:39:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:43,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:43,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:43,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 255 [2022-11-25 15:39:43,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 473 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:43,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 255 [2022-11-25 15:39:43,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:44,376 INFO L130 PetriNetUnfolder]: 924/1575 cut-off events. [2022-11-25 15:39:44,376 INFO L131 PetriNetUnfolder]: For 6140/6222 co-relation queries the response was YES. [2022-11-25 15:39:44,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7381 conditions, 1575 events. 924/1575 cut-off events. For 6140/6222 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7880 event pairs, 113 based on Foata normal form. 23/1567 useless extension candidates. Maximal degree in co-relation 7349. Up to 922 conditions per place. [2022-11-25 15:39:44,386 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 41 selfloop transitions, 1 changer transitions 55/103 dead transitions. [2022-11-25 15:39:44,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 1001 flow [2022-11-25 15:39:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2022-11-25 15:39:44,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.508235294117647 [2022-11-25 15:39:44,390 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2022-11-25 15:39:44,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2022-11-25 15:39:44,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:44,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2022-11-25 15:39:44,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:44,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:44,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:44,397 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 473 flow. Second operand 5 states and 648 transitions. [2022-11-25 15:39:44,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 1001 flow [2022-11-25 15:39:44,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 816 flow, removed 48 selfloop flow, removed 11 redundant places. [2022-11-25 15:39:44,456 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 265 flow [2022-11-25 15:39:44,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2022-11-25 15:39:44,457 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-11-25 15:39:44,457 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 265 flow [2022-11-25 15:39:44,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:44,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:44,458 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:44,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:39:44,458 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash -845555889, now seen corresponding path program 2 times [2022-11-25 15:39:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:44,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625642970] [2022-11-25 15:39:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:44,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625642970] [2022-11-25 15:39:44,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625642970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:44,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:44,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:39:44,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946025844] [2022-11-25 15:39:44,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:44,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:44,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:44,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:44,780 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-11-25 15:39:44,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:44,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:44,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-11-25 15:39:44,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:45,048 INFO L130 PetriNetUnfolder]: 337/611 cut-off events. [2022-11-25 15:39:45,048 INFO L131 PetriNetUnfolder]: For 1442/1442 co-relation queries the response was YES. [2022-11-25 15:39:45,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 611 events. 337/611 cut-off events. For 1442/1442 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2529 event pairs, 43 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 2411. Up to 249 conditions per place. [2022-11-25 15:39:45,051 INFO L137 encePairwiseOnDemand]: 247/255 looper letters, 48 selfloop transitions, 5 changer transitions 43/96 dead transitions. [2022-11-25 15:39:45,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 736 flow [2022-11-25 15:39:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:39:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2022-11-25 15:39:45,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4722689075630252 [2022-11-25 15:39:45,055 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2022-11-25 15:39:45,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2022-11-25 15:39:45,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:45,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2022-11-25 15:39:45,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,063 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 265 flow. Second operand 7 states and 843 transitions. [2022-11-25 15:39:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 736 flow [2022-11-25 15:39:45,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 690 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-11-25 15:39:45,070 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 197 flow [2022-11-25 15:39:45,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2022-11-25 15:39:45,073 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2022-11-25 15:39:45,073 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 197 flow [2022-11-25 15:39:45,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:45,074 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:45,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:39:45,074 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -904848897, now seen corresponding path program 3 times [2022-11-25 15:39:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:45,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014833212] [2022-11-25 15:39:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:45,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:45,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014833212] [2022-11-25 15:39:45,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014833212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:45,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:45,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:39:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852955359] [2022-11-25 15:39:45,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:45,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:39:45,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:45,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:39:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:39:45,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-11-25 15:39:45,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 38 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:45,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-11-25 15:39:45,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:45,917 INFO L130 PetriNetUnfolder]: 172/354 cut-off events. [2022-11-25 15:39:45,918 INFO L131 PetriNetUnfolder]: For 625/632 co-relation queries the response was YES. [2022-11-25 15:39:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 354 events. 172/354 cut-off events. For 625/632 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1446 event pairs, 28 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 1304. Up to 147 conditions per place. [2022-11-25 15:39:45,919 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 39 selfloop transitions, 4 changer transitions 25/72 dead transitions. [2022-11-25 15:39:45,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 525 flow [2022-11-25 15:39:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:39:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:39:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2022-11-25 15:39:45,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4818627450980392 [2022-11-25 15:39:45,923 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 983 transitions. [2022-11-25 15:39:45,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 983 transitions. [2022-11-25 15:39:45,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:45,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 983 transitions. [2022-11-25 15:39:45,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.875) internal successors, (983), 8 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,931 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,931 INFO L175 Difference]: Start difference. First operand has 60 places, 38 transitions, 197 flow. Second operand 8 states and 983 transitions. [2022-11-25 15:39:45,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 525 flow [2022-11-25 15:39:45,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 498 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-25 15:39:45,936 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 194 flow [2022-11-25 15:39:45,936 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2022-11-25 15:39:45,937 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2022-11-25 15:39:45,937 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 194 flow [2022-11-25 15:39:45,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:45,939 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:39:45,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:39:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1100537209, now seen corresponding path program 4 times [2022-11-25 15:39:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800417178] [2022-11-25 15:39:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:39:45,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:39:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:39:46,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:39:46,057 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:39:46,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 15:39:46,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 15:39:46,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 15:39:46,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 15:39:46,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 15:39:46,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 15:39:46,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 15:39:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:39:46,063 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:46,069 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:39:46,070 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:39:46,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:39:46 BasicIcfg [2022-11-25 15:39:46,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:39:46,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:39:46,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:39:46,168 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:39:46,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:18" (3/4) ... [2022-11-25 15:39:46,170 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:39:46,300 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:39:46,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:39:46,301 INFO L158 Benchmark]: Toolchain (without parser) took 29733.09ms. Allocated memory was 203.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 160.3MB in the beginning and 868.6MB in the end (delta: -708.3MB). Peak memory consumption was 500.4MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,301 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:39:46,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.02ms. Allocated memory is still 203.4MB. Free memory was 160.3MB in the beginning and 132.7MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.17ms. Allocated memory is still 203.4MB. Free memory was 132.7MB in the beginning and 130.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,303 INFO L158 Benchmark]: Boogie Preprocessor took 73.57ms. Allocated memory is still 203.4MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,303 INFO L158 Benchmark]: RCFGBuilder took 850.32ms. Allocated memory is still 203.4MB. Free memory was 128.1MB in the beginning and 159.3MB in the end (delta: -31.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,304 INFO L158 Benchmark]: TraceAbstraction took 27789.12ms. Allocated memory was 203.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 158.5MB in the beginning and 884.3MB in the end (delta: -725.8MB). Peak memory consumption was 480.9MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,304 INFO L158 Benchmark]: Witness Printer took 132.98ms. Allocated memory is still 1.4GB. Free memory was 884.3MB in the beginning and 868.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 15:39:46,309 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.02ms. Allocated memory is still 203.4MB. Free memory was 160.3MB in the beginning and 132.7MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.17ms. Allocated memory is still 203.4MB. Free memory was 132.7MB in the beginning and 130.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.57ms. Allocated memory is still 203.4MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 850.32ms. Allocated memory is still 203.4MB. Free memory was 128.1MB in the beginning and 159.3MB in the end (delta: -31.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27789.12ms. Allocated memory was 203.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 158.5MB in the beginning and 884.3MB in the end (delta: -725.8MB). Peak memory consumption was 480.9MB. Max. memory is 16.1GB. * Witness Printer took 132.98ms. Allocated memory is still 1.4GB. Free memory was 884.3MB in the beginning and 868.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 144 PlacesBefore, 41 PlacesAfterwards, 133 TransitionsBefore, 29 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 6900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3898, independent: 3719, independent conditional: 0, independent unconditional: 3719, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2193, independent: 2138, independent conditional: 0, independent unconditional: 2138, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2193, independent: 2105, independent conditional: 0, independent unconditional: 2105, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3898, independent: 1581, independent conditional: 0, independent unconditional: 1581, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 2193, unknown conditional: 0, unknown unconditional: 2193] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 211, Positive conditional cache size: 0, Positive unconditional cache size: 211, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=-3, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=-2, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=-1, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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: 27.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 793 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1754 IncrementalHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 77 mSDtfsCounter, 1754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=8, InterpolantAutomatonStates: 81, 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.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 15:39:46,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe857bee-1ff2-417a-bb43-61f5104d0920/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE