./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:41:31,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:41:31,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:41:31,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:41:31,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:41:31,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:41:31,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:41:31,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:41:31,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:41:31,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:41:31,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:41:31,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:41:31,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:41:31,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:41:31,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:41:31,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:41:31,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:41:31,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:41:31,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:41:31,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:41:31,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:41:31,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:41:31,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:41:31,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:41:31,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:41:31,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:41:31,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:41:31,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:41:31,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:41:31,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:41:31,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:41:31,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:41:31,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:41:31,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:41:31,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:41:31,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:41:31,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:41:31,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:41:31,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:41:31,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:41:31,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:41:31,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:41:31,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:41:31,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:41:31,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:41:31,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:41:31,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:41:31,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:41:31,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:41:31,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:41:31,673 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:41:31,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:41:31,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:41:31,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:41:31,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:41:31,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:41:31,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:41:31,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:41:31,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:41:31,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:41:31,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:41:31,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:41:31,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:41:31,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:41:31,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:41:31,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:41:31,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:41:31,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:41:31,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:41:31,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:41:31,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:41:31,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:41:31,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:41:31,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:41:31,678 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:41:31,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:41:31,679 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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2022-11-25 16:41:32,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:41:32,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:41:32,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:41:32,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:41:32,096 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:41:32,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 16:41:35,154 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:41:35,508 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:41:35,508 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 16:41:35,534 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/data/3a39e4cb1/f3f3811d72084da8a8c7cc39df29501b/FLAGbc1127ccf [2022-11-25 16:41:35,554 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/data/3a39e4cb1/f3f3811d72084da8a8c7cc39df29501b [2022-11-25 16:41:35,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:41:35,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:41:35,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:35,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:41:35,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:41:35,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:35" (1/1) ... [2022-11-25 16:41:35,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4daf8d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:35, skipping insertion in model container [2022-11-25 16:41:35,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:35" (1/1) ... [2022-11-25 16:41:35,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:41:35,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:41:35,877 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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 16:41:36,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:36,156 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:41:36,168 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_afe75f0c-b1fe-470f-aa16-fe3428f54e75/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 16:41:36,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:36,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:36,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:36,294 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:41:36,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36 WrapperNode [2022-11-25 16:41:36,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:36,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:36,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:41:36,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:41:36,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,349 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-11-25 16:41:36,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:36,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:41:36,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:41:36,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:41:36,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:41:36,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:41:36,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:41:36,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:41:36,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:41:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:41:36,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:41:36,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:41:36,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:41:36,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:41:36,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:41:36,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:41:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:41:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:41:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:41:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:41:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:41:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:41:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:41:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:41:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:41:36,488 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:41:36,691 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:41:36,694 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:41:37,160 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:41:37,341 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:41:37,348 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:41:37,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:37 BoogieIcfgContainer [2022-11-25 16:41:37,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:41:37,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:41:37,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:41:37,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:41:37,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:41:35" (1/3) ... [2022-11-25 16:41:37,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56da506b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:41:37, skipping insertion in model container [2022-11-25 16:41:37,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (2/3) ... [2022-11-25 16:41:37,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56da506b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:41:37, skipping insertion in model container [2022-11-25 16:41:37,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:37" (3/3) ... [2022-11-25 16:41:37,371 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 16:41:37,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:41:37,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:41:37,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:41:37,394 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:41:37,483 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:41:37,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-25 16:41:37,633 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-25 16:41:37,633 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:41:37,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-25 16:41:37,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-11-25 16:41:37,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-11-25 16:41:37,663 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:41:37,698 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 96 transitions, 198 flow [2022-11-25 16:41:37,701 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 96 transitions, 198 flow [2022-11-25 16:41:37,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 198 flow [2022-11-25 16:41:37,749 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-25 16:41:37,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:41:37,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-25 16:41:37,753 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2022-11-25 16:41:42,549 INFO L134 LiptonReduction]: Checked pairs total: 3312 [2022-11-25 16:41:42,550 INFO L136 LiptonReduction]: Total number of compositions: 91 [2022-11-25 16:41:42,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:41:42,572 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;@66e2ca5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:41:42,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 16:41:42,578 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 16:41:42,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:41:42,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:42,580 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:41:42,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash 417099621, now seen corresponding path program 1 times [2022-11-25 16:41:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:42,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875896889] [2022-11-25 16:41:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875896889] [2022-11-25 16:41:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875896889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:43,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:43,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:41:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645740563] [2022-11-25 16:41:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:43,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:41:43,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:43,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:41:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:41:43,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 189 [2022-11-25 16:41:43,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:43,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:43,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 189 [2022-11-25 16:41:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:43,409 INFO L130 PetriNetUnfolder]: 135/290 cut-off events. [2022-11-25 16:41:43,409 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 16:41:43,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 290 events. 135/290 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1272 event pairs, 21 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 534. Up to 187 conditions per place. [2022-11-25 16:41:43,413 INFO L137 encePairwiseOnDemand]: 185/189 looper letters, 19 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2022-11-25 16:41:43,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 104 flow [2022-11-25 16:41:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:41:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:41:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2022-11-25 16:41:43,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008818342151675 [2022-11-25 16:41:43,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2022-11-25 16:41:43,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2022-11-25 16:41:43,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:43,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2022-11-25 16:41:43,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:43,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:43,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:43,470 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 284 transitions. [2022-11-25 16:41:43,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 104 flow [2022-11-25 16:41:43,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:41:43,476 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2022-11-25 16:41:43,478 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-11-25 16:41:43,482 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-11-25 16:41:43,482 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2022-11-25 16:41:43,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:43,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:43,483 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:43,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:41:43,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:43,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash 476119205, now seen corresponding path program 1 times [2022-11-25 16:41:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:43,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490981883] [2022-11-25 16:41:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490981883] [2022-11-25 16:41:44,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490981883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:44,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:44,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:41:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876115849] [2022-11-25 16:41:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:41:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:44,270 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 189 [2022-11-25 16:41:44,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:44,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:44,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 189 [2022-11-25 16:41:44,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:44,476 INFO L130 PetriNetUnfolder]: 167/306 cut-off events. [2022-11-25 16:41:44,477 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-25 16:41:44,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 306 events. 167/306 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1147 event pairs, 53 based on Foata normal form. 24/329 useless extension candidates. Maximal degree in co-relation 630. Up to 197 conditions per place. [2022-11-25 16:41:44,479 INFO L137 encePairwiseOnDemand]: 185/189 looper letters, 19 selfloop transitions, 2 changer transitions 12/34 dead transitions. [2022-11-25 16:41:44,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 144 flow [2022-11-25 16:41:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:41:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:41:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-11-25 16:41:44,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2022-11-25 16:41:44,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2022-11-25 16:41:44,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2022-11-25 16:41:44,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:44,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2022-11-25 16:41:44,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:44,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:44,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:44,488 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 5 states and 425 transitions. [2022-11-25 16:41:44,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 144 flow [2022-11-25 16:41:44,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:41:44,489 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2022-11-25 16:41:44,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2022-11-25 16:41:44,490 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-11-25 16:41:44,491 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2022-11-25 16:41:44,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:44,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:44,491 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:44,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:41:44,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1999204895, now seen corresponding path program 1 times [2022-11-25 16:41:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:44,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964745945] [2022-11-25 16:41:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964745945] [2022-11-25 16:41:45,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964745945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:45,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:45,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:41:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337023283] [2022-11-25 16:41:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:45,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:41:45,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:45,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189 [2022-11-25 16:41:45,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:45,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:45,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189 [2022-11-25 16:41:45,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:45,489 INFO L130 PetriNetUnfolder]: 127/269 cut-off events. [2022-11-25 16:41:45,489 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-25 16:41:45,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 269 events. 127/269 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1054 event pairs, 53 based on Foata normal form. 15/284 useless extension candidates. Maximal degree in co-relation 585. Up to 188 conditions per place. [2022-11-25 16:41:45,492 INFO L137 encePairwiseOnDemand]: 183/189 looper letters, 22 selfloop transitions, 5 changer transitions 10/39 dead transitions. [2022-11-25 16:41:45,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 172 flow [2022-11-25 16:41:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:41:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:41:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2022-11-25 16:41:45,496 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47354497354497355 [2022-11-25 16:41:45,496 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2022-11-25 16:41:45,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2022-11-25 16:41:45,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:45,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2022-11-25 16:41:45,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:45,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:45,501 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:45,501 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 6 states and 537 transitions. [2022-11-25 16:41:45,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 172 flow [2022-11-25 16:41:45,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 164 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 16:41:45,504 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 80 flow [2022-11-25 16:41:45,504 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-11-25 16:41:45,505 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-11-25 16:41:45,505 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 80 flow [2022-11-25 16:41:45,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:45,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:45,506 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:45,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:41:45,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1048679149, now seen corresponding path program 1 times [2022-11-25 16:41:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:45,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628358036] [2022-11-25 16:41:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:46,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628358036] [2022-11-25 16:41:46,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628358036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:46,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:46,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146700857] [2022-11-25 16:41:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:46,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:41:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:41:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:41:46,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 189 [2022-11-25 16:41:46,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:46,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:46,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 189 [2022-11-25 16:41:46,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:47,280 INFO L130 PetriNetUnfolder]: 195/350 cut-off events. [2022-11-25 16:41:47,280 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-11-25 16:41:47,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 350 events. 195/350 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1199 event pairs, 42 based on Foata normal form. 12/362 useless extension candidates. Maximal degree in co-relation 906. Up to 266 conditions per place. [2022-11-25 16:41:47,283 INFO L137 encePairwiseOnDemand]: 180/189 looper letters, 35 selfloop transitions, 16 changer transitions 9/60 dead transitions. [2022-11-25 16:41:47,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 312 flow [2022-11-25 16:41:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:41:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:41:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 734 transitions. [2022-11-25 16:41:47,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4315108759553204 [2022-11-25 16:41:47,286 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 734 transitions. [2022-11-25 16:41:47,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 734 transitions. [2022-11-25 16:41:47,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:47,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 734 transitions. [2022-11-25 16:41:47,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.55555555555556) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:47,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:47,294 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:47,294 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 80 flow. Second operand 9 states and 734 transitions. [2022-11-25 16:41:47,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 60 transitions, 312 flow [2022-11-25 16:41:47,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 16:41:47,299 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 180 flow [2022-11-25 16:41:47,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-11-25 16:41:47,301 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2022-11-25 16:41:47,301 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 180 flow [2022-11-25 16:41:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:47,302 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:47,302 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:47,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:41:47,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:47,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:47,303 INFO L85 PathProgramCache]: Analyzing trace with hash -548041571, now seen corresponding path program 2 times [2022-11-25 16:41:47,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:47,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954189112] [2022-11-25 16:41:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:48,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:48,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954189112] [2022-11-25 16:41:48,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954189112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:48,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:48,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359112342] [2022-11-25 16:41:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:48,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:41:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:41:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:41:48,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 189 [2022-11-25 16:41:48,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:48,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:48,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 189 [2022-11-25 16:41:48,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:48,442 INFO L130 PetriNetUnfolder]: 136/273 cut-off events. [2022-11-25 16:41:48,443 INFO L131 PetriNetUnfolder]: For 425/431 co-relation queries the response was YES. [2022-11-25 16:41:48,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 273 events. 136/273 cut-off events. For 425/431 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1057 event pairs, 36 based on Foata normal form. 9/280 useless extension candidates. Maximal degree in co-relation 873. Up to 187 conditions per place. [2022-11-25 16:41:48,446 INFO L137 encePairwiseOnDemand]: 181/189 looper letters, 28 selfloop transitions, 13 changer transitions 7/51 dead transitions. [2022-11-25 16:41:48,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 346 flow [2022-11-25 16:41:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:41:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:41:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 600 transitions. [2022-11-25 16:41:48,448 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45351473922902497 [2022-11-25 16:41:48,449 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 600 transitions. [2022-11-25 16:41:48,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 600 transitions. [2022-11-25 16:41:48,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:48,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 600 transitions. [2022-11-25 16:41:48,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:48,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:48,454 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:48,454 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 180 flow. Second operand 7 states and 600 transitions. [2022-11-25 16:41:48,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 346 flow [2022-11-25 16:41:48,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 328 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-11-25 16:41:48,458 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 225 flow [2022-11-25 16:41:48,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-11-25 16:41:48,459 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2022-11-25 16:41:48,459 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 225 flow [2022-11-25 16:41:48,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:48,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:48,460 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:48,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:41:48,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -558247391, now seen corresponding path program 3 times [2022-11-25 16:41:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:48,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126960536] [2022-11-25 16:41:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:49,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126960536] [2022-11-25 16:41:49,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126960536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:49,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:49,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112388010] [2022-11-25 16:41:49,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:49,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:41:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:49,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:41:49,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:41:49,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 189 [2022-11-25 16:41:49,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:49,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:49,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 189 [2022-11-25 16:41:49,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:49,360 INFO L130 PetriNetUnfolder]: 141/282 cut-off events. [2022-11-25 16:41:49,360 INFO L131 PetriNetUnfolder]: For 663/669 co-relation queries the response was YES. [2022-11-25 16:41:49,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 282 events. 141/282 cut-off events. For 663/669 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1094 event pairs, 38 based on Foata normal form. 9/289 useless extension candidates. Maximal degree in co-relation 1022. Up to 194 conditions per place. [2022-11-25 16:41:49,364 INFO L137 encePairwiseOnDemand]: 182/189 looper letters, 28 selfloop transitions, 16 changer transitions 7/54 dead transitions. [2022-11-25 16:41:49,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 425 flow [2022-11-25 16:41:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:41:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:41:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 606 transitions. [2022-11-25 16:41:49,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4580498866213152 [2022-11-25 16:41:49,367 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 606 transitions. [2022-11-25 16:41:49,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 606 transitions. [2022-11-25 16:41:49,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:49,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 606 transitions. [2022-11-25 16:41:49,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 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 16:41:49,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:49,372 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:49,373 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 225 flow. Second operand 7 states and 606 transitions. [2022-11-25 16:41:49,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 425 flow [2022-11-25 16:41:49,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 384 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-25 16:41:49,380 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 272 flow [2022-11-25 16:41:49,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-11-25 16:41:49,383 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2022-11-25 16:41:49,383 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 272 flow [2022-11-25 16:41:49,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:49,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:49,384 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:49,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:41:49,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1428773869, now seen corresponding path program 4 times [2022-11-25 16:41:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351594263] [2022-11-25 16:41:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:50,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:50,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351594263] [2022-11-25 16:41:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351594263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89863200] [2022-11-25 16:41:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:50,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:41:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:41:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:41:50,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189 [2022-11-25 16:41:50,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:50,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:50,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189 [2022-11-25 16:41:50,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:50,424 INFO L130 PetriNetUnfolder]: 166/333 cut-off events. [2022-11-25 16:41:50,425 INFO L131 PetriNetUnfolder]: For 1275/1296 co-relation queries the response was YES. [2022-11-25 16:41:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 333 events. 166/333 cut-off events. For 1275/1296 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1399 event pairs, 27 based on Foata normal form. 28/361 useless extension candidates. Maximal degree in co-relation 1338. Up to 190 conditions per place. [2022-11-25 16:41:50,428 INFO L137 encePairwiseOnDemand]: 182/189 looper letters, 32 selfloop transitions, 19 changer transitions 9/63 dead transitions. [2022-11-25 16:41:50,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 527 flow [2022-11-25 16:41:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:41:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:41:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 700 transitions. [2022-11-25 16:41:50,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-11-25 16:41:50,432 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 700 transitions. [2022-11-25 16:41:50,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 700 transitions. [2022-11-25 16:41:50,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:50,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 700 transitions. [2022-11-25 16:41:50,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:50,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:50,438 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:50,438 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 272 flow. Second operand 8 states and 700 transitions. [2022-11-25 16:41:50,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 527 flow [2022-11-25 16:41:50,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 451 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-11-25 16:41:50,443 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 316 flow [2022-11-25 16:41:50,444 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-11-25 16:41:50,444 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2022-11-25 16:41:50,444 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 316 flow [2022-11-25 16:41:50,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:50,445 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:50,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:50,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:41:50,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1505920546, now seen corresponding path program 1 times [2022-11-25 16:41:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:50,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527448616] [2022-11-25 16:41:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:50,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527448616] [2022-11-25 16:41:50,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527448616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:50,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:50,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:41:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303656471] [2022-11-25 16:41:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:50,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:41:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:50,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:50,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:50,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 189 [2022-11-25 16:41:50,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:50,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:50,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 189 [2022-11-25 16:41:50,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:51,028 INFO L130 PetriNetUnfolder]: 158/334 cut-off events. [2022-11-25 16:41:51,028 INFO L131 PetriNetUnfolder]: For 1107/1159 co-relation queries the response was YES. [2022-11-25 16:41:51,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 334 events. 158/334 cut-off events. For 1107/1159 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1479 event pairs, 65 based on Foata normal form. 55/387 useless extension candidates. Maximal degree in co-relation 1312. Up to 237 conditions per place. [2022-11-25 16:41:51,032 INFO L137 encePairwiseOnDemand]: 182/189 looper letters, 35 selfloop transitions, 4 changer transitions 27/69 dead transitions. [2022-11-25 16:41:51,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 637 flow [2022-11-25 16:41:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:41:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:41:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2022-11-25 16:41:51,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4452003023431595 [2022-11-25 16:41:51,035 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 589 transitions. [2022-11-25 16:41:51,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 589 transitions. [2022-11-25 16:41:51,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:51,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 589 transitions. [2022-11-25 16:41:51,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,042 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,043 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 316 flow. Second operand 7 states and 589 transitions. [2022-11-25 16:41:51,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 637 flow [2022-11-25 16:41:51,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 582 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-11-25 16:41:51,048 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 310 flow [2022-11-25 16:41:51,049 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2022-11-25 16:41:51,052 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2022-11-25 16:41:51,053 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 310 flow [2022-11-25 16:41:51,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:51,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:51,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:41:51,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash -949388216, now seen corresponding path program 2 times [2022-11-25 16:41:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:51,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688677487] [2022-11-25 16:41:51,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:51,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688677487] [2022-11-25 16:41:51,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688677487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:51,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:51,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:41:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539972612] [2022-11-25 16:41:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:51,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:41:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:41:51,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:41:51,259 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 189 [2022-11-25 16:41:51,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:51,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 189 [2022-11-25 16:41:51,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:51,382 INFO L130 PetriNetUnfolder]: 75/175 cut-off events. [2022-11-25 16:41:51,382 INFO L131 PetriNetUnfolder]: For 881/917 co-relation queries the response was YES. [2022-11-25 16:41:51,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 175 events. 75/175 cut-off events. For 881/917 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 673 event pairs, 10 based on Foata normal form. 39/212 useless extension candidates. Maximal degree in co-relation 725. Up to 88 conditions per place. [2022-11-25 16:41:51,384 INFO L137 encePairwiseOnDemand]: 184/189 looper letters, 31 selfloop transitions, 3 changer transitions 22/62 dead transitions. [2022-11-25 16:41:51,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 572 flow [2022-11-25 16:41:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:41:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:41:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-11-25 16:41:51,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4624338624338624 [2022-11-25 16:41:51,387 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 437 transitions. [2022-11-25 16:41:51,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 437 transitions. [2022-11-25 16:41:51,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:51,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 437 transitions. [2022-11-25 16:41:51,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,391 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,391 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 310 flow. Second operand 5 states and 437 transitions. [2022-11-25 16:41:51,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 572 flow [2022-11-25 16:41:51,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 492 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-25 16:41:51,395 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 210 flow [2022-11-25 16:41:51,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-11-25 16:41:51,397 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-11-25 16:41:51,397 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 210 flow [2022-11-25 16:41:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:51,400 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:51,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:41:51,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 610969211, now seen corresponding path program 1 times [2022-11-25 16:41:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:51,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242271370] [2022-11-25 16:41:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:51,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242271370] [2022-11-25 16:41:51,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242271370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:51,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:51,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:41:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707481265] [2022-11-25 16:41:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:51,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:41:51,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:51,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 189 [2022-11-25 16:41:51,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:51,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 189 [2022-11-25 16:41:51,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:51,710 INFO L130 PetriNetUnfolder]: 30/88 cut-off events. [2022-11-25 16:41:51,710 INFO L131 PetriNetUnfolder]: For 252/261 co-relation queries the response was YES. [2022-11-25 16:41:51,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 88 events. 30/88 cut-off events. For 252/261 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 272 event pairs, 6 based on Foata normal form. 15/102 useless extension candidates. Maximal degree in co-relation 354. Up to 32 conditions per place. [2022-11-25 16:41:51,711 INFO L137 encePairwiseOnDemand]: 184/189 looper letters, 28 selfloop transitions, 5 changer transitions 9/48 dead transitions. [2022-11-25 16:41:51,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 406 flow [2022-11-25 16:41:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:41:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:41:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2022-11-25 16:41:51,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4506172839506173 [2022-11-25 16:41:51,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2022-11-25 16:41:51,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2022-11-25 16:41:51,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:51,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2022-11-25 16:41:51,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,719 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 210 flow. Second operand 6 states and 511 transitions. [2022-11-25 16:41:51,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 406 flow [2022-11-25 16:41:51,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 350 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-11-25 16:41:51,722 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 188 flow [2022-11-25 16:41:51,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2022-11-25 16:41:51,723 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2022-11-25 16:41:51,723 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 188 flow [2022-11-25 16:41:51,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,724 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:51,724 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:51,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:41:51,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1918759524, now seen corresponding path program 1 times [2022-11-25 16:41:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:51,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756865300] [2022-11-25 16:41:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:51,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756865300] [2022-11-25 16:41:51,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756865300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:51,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:51,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:41:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479771628] [2022-11-25 16:41:51,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:51,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:41:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:51,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:51,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:51,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189 [2022-11-25 16:41:51,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:51,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:51,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189 [2022-11-25 16:41:51,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:52,031 INFO L130 PetriNetUnfolder]: 32/101 cut-off events. [2022-11-25 16:41:52,032 INFO L131 PetriNetUnfolder]: For 200/203 co-relation queries the response was YES. [2022-11-25 16:41:52,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 101 events. 32/101 cut-off events. For 200/203 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 329 event pairs, 2 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 380. Up to 49 conditions per place. [2022-11-25 16:41:52,033 INFO L137 encePairwiseOnDemand]: 185/189 looper letters, 21 selfloop transitions, 1 changer transitions 25/50 dead transitions. [2022-11-25 16:41:52,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 399 flow [2022-11-25 16:41:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:41:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:41:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-11-25 16:41:52,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46455026455026455 [2022-11-25 16:41:52,035 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 439 transitions. [2022-11-25 16:41:52,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 439 transitions. [2022-11-25 16:41:52,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:52,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 439 transitions. [2022-11-25 16:41:52,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:52,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:52,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:52,039 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 188 flow. Second operand 5 states and 439 transitions. [2022-11-25 16:41:52,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 399 flow [2022-11-25 16:41:52,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 352 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-11-25 16:41:52,041 INFO L231 Difference]: Finished difference. Result has 47 places, 23 transitions, 123 flow [2022-11-25 16:41:52,042 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=23} [2022-11-25 16:41:52,042 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-11-25 16:41:52,042 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 23 transitions, 123 flow [2022-11-25 16:41:52,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:52,043 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:52,043 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:52,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:41:52,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:41:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1548782858, now seen corresponding path program 2 times [2022-11-25 16:41:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:52,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455372051] [2022-11-25 16:41:52,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:52,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:41:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:52,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:41:52,144 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:41:52,145 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-25 16:41:52,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-25 16:41:52,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-25 16:41:52,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-25 16:41:52,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-25 16:41:52,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:41:52,148 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1] [2022-11-25 16:41:52,154 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:41:52,155 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:41:52,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:41:52 BasicIcfg [2022-11-25 16:41:52,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:41:52,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:41:52,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:41:52,262 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:41:52,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:37" (3/4) ... [2022-11-25 16:41:52,264 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:41:52,356 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:41:52,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:41:52,357 INFO L158 Benchmark]: Toolchain (without parser) took 16798.06ms. Allocated memory was 146.8MB in the beginning and 257.9MB in the end (delta: 111.1MB). Free memory was 102.7MB in the beginning and 212.8MB in the end (delta: -110.1MB). Peak memory consumption was 484.8kB. Max. memory is 16.1GB. [2022-11-25 16:41:52,357 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 111.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:41:52,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.95ms. Allocated memory is still 146.8MB. Free memory was 102.7MB in the beginning and 95.8MB in the end (delta: 6.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:41:52,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.61ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 93.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:41:52,358 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 146.8MB. Free memory was 93.2MB in the beginning and 91.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:41:52,358 INFO L158 Benchmark]: RCFGBuilder took 962.43ms. Allocated memory is still 146.8MB. Free memory was 91.1MB in the beginning and 60.2MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 16:41:52,359 INFO L158 Benchmark]: TraceAbstraction took 14904.41ms. Allocated memory was 146.8MB in the beginning and 257.9MB in the end (delta: 111.1MB). Free memory was 59.6MB in the beginning and 221.2MB in the end (delta: -161.6MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2022-11-25 16:41:52,359 INFO L158 Benchmark]: Witness Printer took 94.22ms. Allocated memory is still 257.9MB. Free memory was 221.2MB in the beginning and 212.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 16:41:52,361 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.35ms. Allocated memory is still 111.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.95ms. Allocated memory is still 146.8MB. Free memory was 102.7MB in the beginning and 95.8MB in the end (delta: 6.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.61ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 93.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 146.8MB. Free memory was 93.2MB in the beginning and 91.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 962.43ms. Allocated memory is still 146.8MB. Free memory was 91.1MB in the beginning and 60.2MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14904.41ms. Allocated memory was 146.8MB in the beginning and 257.9MB in the end (delta: 111.1MB). Free memory was 59.6MB in the beginning and 221.2MB in the end (delta: -161.6MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Witness Printer took 94.22ms. Allocated memory is still 257.9MB. Free memory was 221.2MB in the beginning and 212.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 101 PlacesBefore, 26 PlacesAfterwards, 96 TransitionsBefore, 20 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 3312 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1682, independent: 1546, independent conditional: 0, independent unconditional: 1546, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 921, independent: 884, independent conditional: 0, independent unconditional: 884, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 921, independent: 868, independent conditional: 0, independent unconditional: 868, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 442, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 410, dependent conditional: 0, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1682, independent: 662, independent conditional: 0, independent unconditional: 662, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 921, unknown conditional: 0, unknown unconditional: 921] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=-1, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 118 locations, 5 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: 14.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1084 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 74 mSDtfsCounter, 1084 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=7, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 16:41:52,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe75f0c-b1fe-470f-aa16-fe3428f54e75/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