./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/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_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/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_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/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 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f --- 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 18:21:15,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:21:15,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:21:15,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:21:15,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:21:15,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:21:15,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:21:15,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:21:15,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:21:15,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:21:15,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:21:15,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:21:15,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:21:15,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:21:15,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:21:15,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:21:15,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:21:15,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:21:15,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:21:15,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:21:15,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:21:15,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:21:15,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:21:15,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:21:16,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:21:16,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:21:16,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:21:16,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:21:16,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:21:16,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:21:16,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:21:16,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:21:16,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:21:16,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:21:16,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:21:16,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:21:16,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:21:16,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:21:16,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:21:16,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:21:16,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:21:16,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:21:16,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:21:16,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:21:16,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:21:16,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:21:16,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:21:16,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:21:16,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:21:16,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:21:16,099 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:21:16,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:21:16,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:21:16,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:21:16,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:21:16,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:21:16,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:21:16,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:21:16,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:21:16,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:21:16,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:21:16,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:21:16,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:21:16,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:21:16,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:21:16,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:21:16,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:21:16,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:21:16,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:21:16,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:21:16,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:21:16,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:21:16,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:21:16,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:21:16,108 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:21:16,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:21:16,109 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_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/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_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/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 -> 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f [2022-11-25 18:21:16,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:21:16,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:21:16,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:21:16,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:21:16,537 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:21:16,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix007.opt.i [2022-11-25 18:21:19,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:21:20,189 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:21:20,201 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/sv-benchmarks/c/pthread-wmm/mix007.opt.i [2022-11-25 18:21:20,217 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/data/dd56d2fbd/be486132b99f40b79e67874cac0a2287/FLAG16f8ed791 [2022-11-25 18:21:20,242 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/data/dd56d2fbd/be486132b99f40b79e67874cac0a2287 [2022-11-25 18:21:20,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:21:20,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:21:20,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:21:20,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:21:20,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:21:20,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:20,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1625ea1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20, skipping insertion in model container [2022-11-25 18:21:20,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:20,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:21:20,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:21:20,537 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_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/sv-benchmarks/c/pthread-wmm/mix007.opt.i[944,957] [2022-11-25 18:21:20,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:21:20,812 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:21:20,827 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_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/sv-benchmarks/c/pthread-wmm/mix007.opt.i[944,957] [2022-11-25 18:21:20,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:21:20,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:21:20,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:21:20,984 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:21:20,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20 WrapperNode [2022-11-25 18:21:20,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:21:20,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:21:20,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:21:20,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:21:20,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,096 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-25 18:21:21,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:21:21,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:21:21,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:21:21,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:21:21,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,133 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:21:21,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:21:21,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:21:21,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:21:21,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (1/1) ... [2022-11-25 18:21:21,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:21:21,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:21,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:21:21,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:21:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:21:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:21:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:21:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:21:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:21:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:21:21,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:21:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:21:21,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:21:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:21:21,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:21:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 18:21:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 18:21:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:21:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:21:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:21:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:21:21,248 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 18:21:21,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:21:21,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:21:21,952 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:21:22,242 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:21:22,243 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:21:22,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:21:22 BoogieIcfgContainer [2022-11-25 18:21:22,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:21:22,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:21:22,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:21:22,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:21:22,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:21:20" (1/3) ... [2022-11-25 18:21:22,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b68cded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:21:22, skipping insertion in model container [2022-11-25 18:21:22,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:20" (2/3) ... [2022-11-25 18:21:22,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b68cded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:21:22, skipping insertion in model container [2022-11-25 18:21:22,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:21:22" (3/3) ... [2022-11-25 18:21:22,271 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2022-11-25 18:21:22,281 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:21:22,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:21:22,295 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:21:22,296 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:21:22,392 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:21:22,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 18:21:22,576 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 18:21:22,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:21:22,584 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 63 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 18:21:22,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 18:21:22,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-25 18:21:22,602 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:21:22,640 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 18:21:22,650 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 18:21:22,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-11-25 18:21:22,717 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 18:21:22,718 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:21:22,720 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 63 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 18:21:22,723 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-11-25 18:21:29,377 INFO L134 LiptonReduction]: Checked pairs total: 7838 [2022-11-25 18:21:29,377 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-25 18:21:29,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:21:29,403 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;@1c4b2753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:21:29,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 18:21:29,412 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-11-25 18:21:29,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:21:29,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:29,413 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:29,413 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 18:21:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 468174253, now seen corresponding path program 1 times [2022-11-25 18:21:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:29,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241183212] [2022-11-25 18:21:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:29,977 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 18:21:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:29,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241183212] [2022-11-25 18:21:29,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241183212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:29,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:29,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:21:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430832101] [2022-11-25 18:21:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:29,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:21:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:30,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:21:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:21:30,042 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2022-11-25 18:21:30,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 18:21:30,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:30,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2022-11-25 18:21:30,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:31,004 INFO L130 PetriNetUnfolder]: 2594/3797 cut-off events. [2022-11-25 18:21:31,005 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-25 18:21:31,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7492 conditions, 3797 events. 2594/3797 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20213 event pairs, 518 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 7480. Up to 2797 conditions per place. [2022-11-25 18:21:31,038 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-25 18:21:31,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-11-25 18:21:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:21:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:21:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-11-25 18:21:31,066 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5265888456549935 [2022-11-25 18:21:31,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-11-25 18:21:31,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-11-25 18:21:31,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:31,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-11-25 18:21:31,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:31,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 18:21:31,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 18:21:31,095 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 406 transitions. [2022-11-25 18:21:31,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-11-25 18:21:31,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:21:31,106 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-25 18:21:31,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, 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 18:21:31,115 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 18:21:31,116 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-25 18:21:31,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 18:21:31,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:31,117 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:31,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:21:31,118 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 18:21:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1056057324, now seen corresponding path program 1 times [2022-11-25 18:21:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:31,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253361934] [2022-11-25 18:21:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:31,426 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 18:21:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253361934] [2022-11-25 18:21:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253361934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:31,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:31,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:21:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572335408] [2022-11-25 18:21:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:31,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:21:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:21:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:21:31,465 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-11-25 18:21:31,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:31,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:31,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-11-25 18:21:31,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:33,277 INFO L130 PetriNetUnfolder]: 8243/11356 cut-off events. [2022-11-25 18:21:33,277 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2022-11-25 18:21:33,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23454 conditions, 11356 events. 8243/11356 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 56238 event pairs, 2847 based on Foata normal form. 248/11604 useless extension candidates. Maximal degree in co-relation 23444. Up to 8433 conditions per place. [2022-11-25 18:21:33,411 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2022-11-25 18:21:33,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2022-11-25 18:21:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:21:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:21:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-11-25 18:21:33,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5045395590142672 [2022-11-25 18:21:33,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-11-25 18:21:33,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-11-25 18:21:33,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:33,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-11-25 18:21:33,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:33,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 18:21:33,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 18:21:33,419 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 389 transitions. [2022-11-25 18:21:33,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2022-11-25 18:21:33,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:21:33,430 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2022-11-25 18:21:33,431 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-11-25 18:21:33,432 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2022-11-25 18:21:33,432 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2022-11-25 18:21:33,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:33,432 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:33,432 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:33,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:21:33,433 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 18:21:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1621959720, now seen corresponding path program 1 times [2022-11-25 18:21:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:33,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541528171] [2022-11-25 18:21:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:33,670 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 18:21:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541528171] [2022-11-25 18:21:33,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541528171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:33,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:33,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:21:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64150094] [2022-11-25 18:21:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:33,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:21:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:21:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:21:33,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-11-25 18:21:33,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:33,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:33,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-11-25 18:21:33,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:35,444 INFO L130 PetriNetUnfolder]: 7631/10528 cut-off events. [2022-11-25 18:21:35,444 INFO L131 PetriNetUnfolder]: For 4312/4312 co-relation queries the response was YES. [2022-11-25 18:21:35,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27024 conditions, 10528 events. 7631/10528 cut-off events. For 4312/4312 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 50203 event pairs, 2115 based on Foata normal form. 144/10672 useless extension candidates. Maximal degree in co-relation 27012. Up to 5597 conditions per place. [2022-11-25 18:21:35,537 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-11-25 18:21:35,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 312 flow [2022-11-25 18:21:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:21:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:21:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2022-11-25 18:21:35,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.490272373540856 [2022-11-25 18:21:35,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2022-11-25 18:21:35,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2022-11-25 18:21:35,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:35,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2022-11-25 18:21:35,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:35,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:35,549 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:35,550 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 504 transitions. [2022-11-25 18:21:35,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 312 flow [2022-11-25 18:21:35,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:21:35,587 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 174 flow [2022-11-25 18:21:35,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2022-11-25 18:21:35,589 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-25 18:21:35,590 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 174 flow [2022-11-25 18:21:35,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:35,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:35,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:35,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:21:35,592 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 18:21:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1291536145, now seen corresponding path program 1 times [2022-11-25 18:21:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:35,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992797822] [2022-11-25 18:21:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,906 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 18:21:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:35,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992797822] [2022-11-25 18:21:35,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992797822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:35,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:35,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:21:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125163868] [2022-11-25 18:21:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:35,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:21:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:21:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:21:35,939 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-11-25 18:21:35,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 18:21:35,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:35,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-11-25 18:21:35,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:37,566 INFO L130 PetriNetUnfolder]: 7455/10288 cut-off events. [2022-11-25 18:21:37,566 INFO L131 PetriNetUnfolder]: For 6586/6586 co-relation queries the response was YES. [2022-11-25 18:21:37,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28151 conditions, 10288 events. 7455/10288 cut-off events. For 6586/6586 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 50220 event pairs, 1259 based on Foata normal form. 32/10320 useless extension candidates. Maximal degree in co-relation 28136. Up to 7197 conditions per place. [2022-11-25 18:21:37,643 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 54 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2022-11-25 18:21:37,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 430 flow [2022-11-25 18:21:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:21:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:21:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2022-11-25 18:21:37,646 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5009727626459144 [2022-11-25 18:21:37,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2022-11-25 18:21:37,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2022-11-25 18:21:37,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:37,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2022-11-25 18:21:37,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 18:21:37,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:37,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:37,652 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 174 flow. Second operand 4 states and 515 transitions. [2022-11-25 18:21:37,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 430 flow [2022-11-25 18:21:37,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:21:37,674 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 273 flow [2022-11-25 18:21:37,674 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-11-25 18:21:37,676 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-11-25 18:21:37,677 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 273 flow [2022-11-25 18:21:37,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 18:21:37,678 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:37,678 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:37,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:21:37,678 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 18:21:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1382873655, now seen corresponding path program 1 times [2022-11-25 18:21:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:37,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590463263] [2022-11-25 18:21:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:37,949 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 18:21:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:37,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590463263] [2022-11-25 18:21:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590463263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:21:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597450460] [2022-11-25 18:21:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:37,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:21:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:37,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:21:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:21:37,959 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 257 [2022-11-25 18:21:37,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 18:21:37,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:37,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 257 [2022-11-25 18:21:37,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:39,233 INFO L130 PetriNetUnfolder]: 5355/7782 cut-off events. [2022-11-25 18:21:39,234 INFO L131 PetriNetUnfolder]: For 9403/9848 co-relation queries the response was YES. [2022-11-25 18:21:39,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22732 conditions, 7782 events. 5355/7782 cut-off events. For 9403/9848 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 42537 event pairs, 1557 based on Foata normal form. 233/7819 useless extension candidates. Maximal degree in co-relation 22714. Up to 4725 conditions per place. [2022-11-25 18:21:39,312 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 42 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2022-11-25 18:21:39,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 406 flow [2022-11-25 18:21:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:21:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:21:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-11-25 18:21:39,315 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5214007782101168 [2022-11-25 18:21:39,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2022-11-25 18:21:39,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2022-11-25 18:21:39,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:39,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2022-11-25 18:21:39,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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 18:21:39,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 18:21:39,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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 18:21:39,321 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 273 flow. Second operand 3 states and 402 transitions. [2022-11-25 18:21:39,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 406 flow [2022-11-25 18:21:39,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:21:39,363 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 287 flow [2022-11-25 18:21:39,363 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-11-25 18:21:39,364 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2022-11-25 18:21:39,365 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 287 flow [2022-11-25 18:21:39,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 18:21:39,365 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:39,366 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:39,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:21:39,366 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 18:21:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1030871429, now seen corresponding path program 1 times [2022-11-25 18:21:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:39,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088837092] [2022-11-25 18:21:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:39,763 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 18:21:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:39,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088837092] [2022-11-25 18:21:39,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088837092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:39,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:39,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:21:39,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032975022] [2022-11-25 18:21:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:39,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:21:39,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:39,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:21:39,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:21:39,783 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:21:39,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 18:21:39,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:39,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:21:39,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:41,114 INFO L130 PetriNetUnfolder]: 4556/6851 cut-off events. [2022-11-25 18:21:41,114 INFO L131 PetriNetUnfolder]: For 8202/8967 co-relation queries the response was YES. [2022-11-25 18:21:41,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19600 conditions, 6851 events. 4556/6851 cut-off events. For 8202/8967 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 41113 event pairs, 801 based on Foata normal form. 712/7271 useless extension candidates. Maximal degree in co-relation 19579. Up to 4413 conditions per place. [2022-11-25 18:21:41,179 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 80 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2022-11-25 18:21:41,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 104 transitions, 775 flow [2022-11-25 18:21:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:21:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:21:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-11-25 18:21:41,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5089494163424124 [2022-11-25 18:21:41,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-11-25 18:21:41,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-11-25 18:21:41,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:41,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-11-25 18:21:41,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 18:21:41,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 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 18:21:41,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 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 18:21:41,195 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 287 flow. Second operand 5 states and 654 transitions. [2022-11-25 18:21:41,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 104 transitions, 775 flow [2022-11-25 18:21:41,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 104 transitions, 765 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 18:21:41,214 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 352 flow [2022-11-25 18:21:41,214 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-11-25 18:21:41,217 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-11-25 18:21:41,218 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 352 flow [2022-11-25 18:21:41,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 18:21:41,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:41,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:41,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:21:41,220 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 18:21:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 29615953, now seen corresponding path program 1 times [2022-11-25 18:21:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:41,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680231729] [2022-11-25 18:21:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:41,603 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 18:21:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:41,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680231729] [2022-11-25 18:21:41,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680231729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:41,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:41,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:21:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507588648] [2022-11-25 18:21:41,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:41,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:41,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:41,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:21:41,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 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 18:21:41,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:41,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:21:41,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:42,817 INFO L130 PetriNetUnfolder]: 3743/5838 cut-off events. [2022-11-25 18:21:42,817 INFO L131 PetriNetUnfolder]: For 9102/10179 co-relation queries the response was YES. [2022-11-25 18:21:42,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21155 conditions, 5838 events. 3743/5838 cut-off events. For 9102/10179 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36161 event pairs, 308 based on Foata normal form. 719/6344 useless extension candidates. Maximal degree in co-relation 21131. Up to 2114 conditions per place. [2022-11-25 18:21:42,883 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 109 selfloop transitions, 19 changer transitions 1/143 dead transitions. [2022-11-25 18:21:42,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 143 transitions, 1144 flow [2022-11-25 18:21:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:21:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:21:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2022-11-25 18:21:42,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5097276264591439 [2022-11-25 18:21:42,887 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2022-11-25 18:21:42,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2022-11-25 18:21:42,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:42,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2022-11-25 18:21:42,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 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 18:21:42,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 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 18:21:42,895 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 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 18:21:42,896 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 352 flow. Second operand 7 states and 917 transitions. [2022-11-25 18:21:42,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 143 transitions, 1144 flow [2022-11-25 18:21:42,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 143 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:21:42,929 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 481 flow [2022-11-25 18:21:42,929 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2022-11-25 18:21:42,930 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2022-11-25 18:21:42,930 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 481 flow [2022-11-25 18:21:42,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 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 18:21:42,931 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:42,931 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:21:42,931 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 18:21:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1965740424, now seen corresponding path program 1 times [2022-11-25 18:21:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:42,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594137062] [2022-11-25 18:21:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:21:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:43,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594137062] [2022-11-25 18:21:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594137062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:43,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:43,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:21:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811810038] [2022-11-25 18:21:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:43,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:43,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 18:21:43,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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 18:21:43,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:43,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 18:21:43,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:44,752 INFO L130 PetriNetUnfolder]: 7610/11374 cut-off events. [2022-11-25 18:21:44,752 INFO L131 PetriNetUnfolder]: For 38885/38885 co-relation queries the response was YES. [2022-11-25 18:21:44,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52262 conditions, 11374 events. 7610/11374 cut-off events. For 38885/38885 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 66335 event pairs, 1488 based on Foata normal form. 32/11406 useless extension candidates. Maximal degree in co-relation 52234. Up to 4333 conditions per place. [2022-11-25 18:21:44,838 INFO L137 encePairwiseOnDemand]: 247/257 looper letters, 94 selfloop transitions, 22 changer transitions 71/187 dead transitions. [2022-11-25 18:21:44,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 187 transitions, 1753 flow [2022-11-25 18:21:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:21:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:21:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2022-11-25 18:21:44,842 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49481193255512324 [2022-11-25 18:21:44,842 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2022-11-25 18:21:44,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2022-11-25 18:21:44,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:44,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2022-11-25 18:21:44,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 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 18:21:44,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 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 18:21:44,849 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 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 18:21:44,850 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 481 flow. Second operand 6 states and 763 transitions. [2022-11-25 18:21:44,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 187 transitions, 1753 flow [2022-11-25 18:21:45,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 187 transitions, 1568 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-11-25 18:21:45,513 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 457 flow [2022-11-25 18:21:45,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2022-11-25 18:21:45,515 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-11-25 18:21:45,515 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 457 flow [2022-11-25 18:21:45,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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 18:21:45,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:45,516 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 18:21:45,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:21:45,516 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 18:21:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash -327940730, now seen corresponding path program 1 times [2022-11-25 18:21:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10175609] [2022-11-25 18:21:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:45,840 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 18:21:45,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:45,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10175609] [2022-11-25 18:21:45,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10175609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:45,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:45,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:45,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850846029] [2022-11-25 18:21:45,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:45,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:21:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:21:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:21:45,863 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:21:45,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 18:21:45,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:45,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:21:45,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:46,632 INFO L130 PetriNetUnfolder]: 1987/3350 cut-off events. [2022-11-25 18:21:46,632 INFO L131 PetriNetUnfolder]: For 10131/10652 co-relation queries the response was YES. [2022-11-25 18:21:46,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13224 conditions, 3350 events. 1987/3350 cut-off events. For 10131/10652 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20475 event pairs, 249 based on Foata normal form. 449/3671 useless extension candidates. Maximal degree in co-relation 13194. Up to 1072 conditions per place. [2022-11-25 18:21:46,663 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 95 selfloop transitions, 18 changer transitions 13/140 dead transitions. [2022-11-25 18:21:46,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 140 transitions, 1307 flow [2022-11-25 18:21:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:21:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:21:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2022-11-25 18:21:46,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5102834908282379 [2022-11-25 18:21:46,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2022-11-25 18:21:46,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2022-11-25 18:21:46,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:46,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2022-11-25 18:21:46,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 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 18:21:46,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 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 18:21:46,676 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 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 18:21:46,677 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 457 flow. Second operand 7 states and 918 transitions. [2022-11-25 18:21:46,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 140 transitions, 1307 flow [2022-11-25 18:21:46,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 140 transitions, 1261 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-11-25 18:21:46,703 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 560 flow [2022-11-25 18:21:46,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=560, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2022-11-25 18:21:46,705 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2022-11-25 18:21:46,706 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 560 flow [2022-11-25 18:21:46,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 18:21:46,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:46,709 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:46,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:21:46,711 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 18:21:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -69708445, now seen corresponding path program 1 times [2022-11-25 18:21:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:46,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762924012] [2022-11-25 18:21:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:46,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:47,093 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 18:21:47,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:47,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762924012] [2022-11-25 18:21:47,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762924012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:47,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:47,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:21:47,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997078520] [2022-11-25 18:21:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:47,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:21:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:21:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:21:47,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:21:47,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 18:21:47,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:47,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:21:47,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:47,890 INFO L130 PetriNetUnfolder]: 1854/3081 cut-off events. [2022-11-25 18:21:47,891 INFO L131 PetriNetUnfolder]: For 9236/9609 co-relation queries the response was YES. [2022-11-25 18:21:47,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13307 conditions, 3081 events. 1854/3081 cut-off events. For 9236/9609 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18378 event pairs, 239 based on Foata normal form. 172/3132 useless extension candidates. Maximal degree in co-relation 13275. Up to 968 conditions per place. [2022-11-25 18:21:47,916 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 83 selfloop transitions, 23 changer transitions 23/140 dead transitions. [2022-11-25 18:21:47,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 1334 flow [2022-11-25 18:21:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 18:21:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1155 transitions. [2022-11-25 18:21:47,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4993514915693904 [2022-11-25 18:21:47,921 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1155 transitions. [2022-11-25 18:21:47,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1155 transitions. [2022-11-25 18:21:47,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:47,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1155 transitions. [2022-11-25 18:21:47,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.33333333333334) internal successors, (1155), 9 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 18:21:47,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 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 18:21:47,932 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 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 18:21:47,932 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 560 flow. Second operand 9 states and 1155 transitions. [2022-11-25 18:21:47,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 1334 flow [2022-11-25 18:21:48,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 140 transitions, 1244 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-11-25 18:21:48,057 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 499 flow [2022-11-25 18:21:48,057 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2022-11-25 18:21:48,058 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2022-11-25 18:21:48,058 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 499 flow [2022-11-25 18:21:48,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 18:21:48,059 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:48,059 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 18:21:48,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:21:48,060 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 18:21:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1410152799, now seen corresponding path program 1 times [2022-11-25 18:21:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:48,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778217334] [2022-11-25 18:21:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:48,319 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 18:21:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:48,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778217334] [2022-11-25 18:21:48,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778217334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:48,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:48,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:21:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139269185] [2022-11-25 18:21:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:48,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:21:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:21:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:21:48,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2022-11-25 18:21:48,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 18:21:48,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:48,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2022-11-25 18:21:48,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:48,932 INFO L130 PetriNetUnfolder]: 1865/3206 cut-off events. [2022-11-25 18:21:48,932 INFO L131 PetriNetUnfolder]: For 11592/11745 co-relation queries the response was YES. [2022-11-25 18:21:48,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14066 conditions, 3206 events. 1865/3206 cut-off events. For 11592/11745 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19333 event pairs, 426 based on Foata normal form. 54/3198 useless extension candidates. Maximal degree in co-relation 14040. Up to 1706 conditions per place. [2022-11-25 18:21:48,945 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 53 selfloop transitions, 1 changer transitions 64/125 dead transitions. [2022-11-25 18:21:48,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 1265 flow [2022-11-25 18:21:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:21:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:21:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2022-11-25 18:21:48,950 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5165369649805448 [2022-11-25 18:21:48,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2022-11-25 18:21:48,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2022-11-25 18:21:48,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:48,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2022-11-25 18:21:48,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:48,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:48,963 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:48,963 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 499 flow. Second operand 4 states and 531 transitions. [2022-11-25 18:21:48,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 1265 flow [2022-11-25 18:21:49,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 125 transitions, 979 flow, removed 48 selfloop flow, removed 14 redundant places. [2022-11-25 18:21:49,049 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 311 flow [2022-11-25 18:21:49,049 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2022-11-25 18:21:49,050 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-11-25 18:21:49,050 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 311 flow [2022-11-25 18:21:49,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 18:21:49,051 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:49,051 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 18:21:49,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:21:49,051 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 18:21:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash 388915321, now seen corresponding path program 2 times [2022-11-25 18:21:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118918800] [2022-11-25 18:21:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:49,329 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 18:21:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:49,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118918800] [2022-11-25 18:21:49,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118918800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:49,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:21:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235018254] [2022-11-25 18:21:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:49,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:21:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:21:49,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:21:49,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-11-25 18:21:49,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 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 18:21:49,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:21:49,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-11-25 18:21:49,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:21:49,771 INFO L130 PetriNetUnfolder]: 1728/2874 cut-off events. [2022-11-25 18:21:49,771 INFO L131 PetriNetUnfolder]: For 5749/5749 co-relation queries the response was YES. [2022-11-25 18:21:49,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10562 conditions, 2874 events. 1728/2874 cut-off events. For 5749/5749 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15544 event pairs, 551 based on Foata normal form. 1/2875 useless extension candidates. Maximal degree in co-relation 10540. Up to 1592 conditions per place. [2022-11-25 18:21:49,780 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 44 selfloop transitions, 4 changer transitions 36/84 dead transitions. [2022-11-25 18:21:49,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 644 flow [2022-11-25 18:21:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:21:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:21:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2022-11-25 18:21:49,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48735408560311283 [2022-11-25 18:21:49,783 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2022-11-25 18:21:49,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2022-11-25 18:21:49,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:21:49,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2022-11-25 18:21:49,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 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 18:21:49,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:49,788 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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 18:21:49,788 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 311 flow. Second operand 4 states and 501 transitions. [2022-11-25 18:21:49,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 644 flow [2022-11-25 18:21:49,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 639 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 18:21:49,832 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 214 flow [2022-11-25 18:21:49,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2022-11-25 18:21:49,833 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2022-11-25 18:21:49,833 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 214 flow [2022-11-25 18:21:49,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 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 18:21:49,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:21:49,834 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 18:21:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:21:49,834 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 18:21:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1889501811, now seen corresponding path program 3 times [2022-11-25 18:21:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:49,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692922349] [2022-11-25 18:21:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:21:49,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:21:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:21:50,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:21:50,035 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:21:50,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 18:21:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 18:21:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 18:21:50,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 18:21:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 18:21:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 18:21:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 18:21:50,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:21:50,042 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:50,049 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:21:50,049 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:21:50,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:21:50 BasicIcfg [2022-11-25 18:21:50,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:21:50,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:21:50,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:21:50,181 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:21:50,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:21:22" (3/4) ... [2022-11-25 18:21:50,184 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:21:50,284 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:21:50,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:21:50,285 INFO L158 Benchmark]: Toolchain (without parser) took 30027.48ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 130.3MB in the beginning and 768.9MB in the end (delta: -638.6MB). Peak memory consumption was 603.5MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,286 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 125.8MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:21:50,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.06ms. Allocated memory is still 159.4MB. Free memory was 130.1MB in the beginning and 102.9MB in the end (delta: 27.2MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.83ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 100.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,287 INFO L158 Benchmark]: Boogie Preprocessor took 34.88ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 98.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,287 INFO L158 Benchmark]: RCFGBuilder took 1107.05ms. Allocated memory is still 159.4MB. Free memory was 98.1MB in the beginning and 111.3MB in the end (delta: -13.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,288 INFO L158 Benchmark]: TraceAbstraction took 27929.87ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 111.3MB in the beginning and 784.6MB in the end (delta: -673.3MB). Peak memory consumption was 572.4MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,288 INFO L158 Benchmark]: Witness Printer took 103.72ms. Allocated memory is still 1.4GB. Free memory was 784.6MB in the beginning and 768.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 18:21:50,290 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.37ms. Allocated memory is still 125.8MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.06ms. Allocated memory is still 159.4MB. Free memory was 130.1MB in the beginning and 102.9MB in the end (delta: 27.2MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.83ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 100.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.88ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 98.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1107.05ms. Allocated memory is still 159.4MB. Free memory was 98.1MB in the beginning and 111.3MB in the end (delta: -13.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27929.87ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 111.3MB in the beginning and 784.6MB in the end (delta: -673.3MB). Peak memory consumption was 572.4MB. Max. memory is 16.1GB. * Witness Printer took 103.72ms. Allocated memory is still 1.4GB. Free memory was 784.6MB in the beginning and 768.9MB 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, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 7838 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3787, independent: 3575, independent conditional: 0, independent unconditional: 3575, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2177, independent: 2111, independent conditional: 0, independent unconditional: 2111, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2177, independent: 2080, independent conditional: 0, independent unconditional: 2080, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 596, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 532, dependent conditional: 0, dependent unconditional: 532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3787, independent: 1464, independent conditional: 0, independent unconditional: 1464, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 2177, unknown conditional: 0, unknown unconditional: 2177] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 245, Positive conditional cache size: 0, Positive unconditional cache size: 245, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 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; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t181, ((void *)0), P0, ((void *)0))=-1, t181={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] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t182, ((void *)0), P1, ((void *)0))=0, t181={5:0}, t182={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] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t183, ((void *)0), P2, ((void *)0))=1, t181={5:0}, t182={6:0}, t183={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] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t184, ((void *)0), P3, ((void *)0))=2, t181={5:0}, t182={6:0}, t183={7:0}, t184={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] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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] [L784] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, 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 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, 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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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] [L847] 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) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 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) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 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 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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: 874]: 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: 872]: 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: 870]: 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: 876]: 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.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 625 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1162 IncrementalHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 56 mSDtfsCounter, 1162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 18:21:50,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b992c482-3f9a-4f71-93b1-79c2a1dfa3c8/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