/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:36:46,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:36:46,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:36:46,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:36:46,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:36:46,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:36:46,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:36:46,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:36:46,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:36:46,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:36:46,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:36:46,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:36:46,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:36:46,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:36:46,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:36:46,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:36:46,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:36:46,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:36:46,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:36:46,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:36:46,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:36:46,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:36:46,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:36:46,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:36:46,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:36:46,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:36:46,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:36:46,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:36:46,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:36:46,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:36:46,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:36:46,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:36:46,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:36:46,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:36:46,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:36:46,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:36:46,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:36:46,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:36:46,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:36:46,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:36:46,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:36:46,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:36:46,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:36:46,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:36:46,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:36:46,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:36:46,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:36:46,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:36:46,170 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:36:46,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:36:46,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:36:46,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:36:46,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:36:46,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:36:46,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:46,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:36:46,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:36:46,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:36:46,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:36:46,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:36:46,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:36:46,422 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:36:46,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-12 21:36:47,471 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:36:47,666 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:36:47,666 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-12 21:36:47,679 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e220f5e/c9399511a0a748429cc7f0ca22d70d09/FLAG4a4dc3a60 [2022-12-12 21:36:47,691 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e220f5e/c9399511a0a748429cc7f0ca22d70d09 [2022-12-12 21:36:47,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:36:47,694 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:36:47,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:47,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:36:47,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:36:47,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:47" (1/1) ... [2022-12-12 21:36:47,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1baf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:47, skipping insertion in model container [2022-12-12 21:36:47,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:47" (1/1) ... [2022-12-12 21:36:47,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:36:47,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:36:47,844 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2022-12-12 21:36:47,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:47,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:47,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:47,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:47,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:47,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:47,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:47,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:47,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:47,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:47,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:48,044 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:36:48,053 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2022-12-12 21:36:48,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:48,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:48,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:48,133 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:36:48,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48 WrapperNode [2022-12-12 21:36:48,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:48,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:48,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:36:48,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:36:48,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,199 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-12-12 21:36:48,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:48,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:36:48,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:36:48,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:36:48,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:36:48,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:36:48,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:36:48,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:36:48,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (1/1) ... [2022-12-12 21:36:48,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:48,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:36:48,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:36:48,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:36:48,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:36:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:36:48,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:36:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:36:48,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:36:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:36:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:36:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:36:48,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:36:48,312 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:36:48,473 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:36:48,474 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:36:48,708 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:36:48,795 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:36:48,795 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:36:48,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:48 BoogieIcfgContainer [2022-12-12 21:36:48,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:36:48,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:36:48,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:36:48,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:36:48,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:36:47" (1/3) ... [2022-12-12 21:36:48,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b9f7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:48, skipping insertion in model container [2022-12-12 21:36:48,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:48" (2/3) ... [2022-12-12 21:36:48,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b9f7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:48, skipping insertion in model container [2022-12-12 21:36:48,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:48" (3/3) ... [2022-12-12 21:36:48,803 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-12-12 21:36:48,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:36:48,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:36:48,816 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:36:48,873 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:36:48,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-12 21:36:48,952 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-12 21:36:48,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:48,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:36:48,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-12 21:36:48,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-12 21:36:48,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:36:48,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-12 21:36:48,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-12 21:36:49,023 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-12 21:36:49,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:49,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:36:49,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-12 21:36:49,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-12 21:36:53,370 INFO L241 LiptonReduction]: Total number of compositions: 89 [2022-12-12 21:36:53,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:36:53,395 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=false, 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;@306795e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:36:53,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:36:53,402 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-12 21:36:53,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:53,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:53,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:53,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1238060157, now seen corresponding path program 1 times [2022-12-12 21:36:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:53,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832494268] [2022-12-12 21:36:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832494268] [2022-12-12 21:36:53,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832494268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:53,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:53,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:36:53,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750436470] [2022-12-12 21:36:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:53,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:36:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:36:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:36:53,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 21:36:53,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:53,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:53,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 21:36:53,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:54,801 INFO L130 PetriNetUnfolder]: 8354/12964 cut-off events. [2022-12-12 21:36:54,801 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-12 21:36:54,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24922 conditions, 12964 events. 8354/12964 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 93610 event pairs, 824 based on Foata normal form. 0/7428 useless extension candidates. Maximal degree in co-relation 24911. Up to 10531 conditions per place. [2022-12-12 21:36:54,842 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 29 selfloop transitions, 3 changer transitions 42/84 dead transitions. [2022-12-12 21:36:54,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 325 flow [2022-12-12 21:36:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-12-12 21:36:54,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2022-12-12 21:36:54,855 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2022-12-12 21:36:54,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 84 transitions, 325 flow [2022-12-12 21:36:54,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 42 transitions, 157 flow [2022-12-12 21:36:54,930 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 157 flow [2022-12-12 21:36:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:54,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:54,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:36:54,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -69816844, now seen corresponding path program 1 times [2022-12-12 21:36:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600268051] [2022-12-12 21:36:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:55,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600268051] [2022-12-12 21:36:55,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600268051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:55,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:55,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:36:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669878153] [2022-12-12 21:36:55,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:55,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:36:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:36:55,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:36:55,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:36:55,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:55,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:55,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:36:55,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:55,406 INFO L130 PetriNetUnfolder]: 2328/3582 cut-off events. [2022-12-12 21:36:55,406 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-12 21:36:55,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9873 conditions, 3582 events. 2328/3582 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18298 event pairs, 148 based on Foata normal form. 12/2926 useless extension candidates. Maximal degree in co-relation 9859. Up to 3238 conditions per place. [2022-12-12 21:36:55,418 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 47 selfloop transitions, 5 changer transitions 2/61 dead transitions. [2022-12-12 21:36:55,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 343 flow [2022-12-12 21:36:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-12 21:36:55,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3630952380952381 [2022-12-12 21:36:55,421 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -19 predicate places. [2022-12-12 21:36:55,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 61 transitions, 343 flow [2022-12-12 21:36:55,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 59 transitions, 335 flow [2022-12-12 21:36:55,431 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 59 transitions, 335 flow [2022-12-12 21:36:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:55,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:55,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:55,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:36:55,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2024520170, now seen corresponding path program 1 times [2022-12-12 21:36:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:55,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025945313] [2022-12-12 21:36:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:55,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:55,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025945313] [2022-12-12 21:36:55,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025945313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:55,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:55,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109074670] [2022-12-12 21:36:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:55,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:55,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:36:55,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 59 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:55,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:55,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:36:55,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:55,836 INFO L130 PetriNetUnfolder]: 1674/2607 cut-off events. [2022-12-12 21:36:55,836 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-12 21:36:55,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9799 conditions, 2607 events. 1674/2607 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12569 event pairs, 166 based on Foata normal form. 63/2183 useless extension candidates. Maximal degree in co-relation 9782. Up to 2353 conditions per place. [2022-12-12 21:36:55,851 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 56 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2022-12-12 21:36:55,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 509 flow [2022-12-12 21:36:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-12 21:36:55,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 21:36:55,854 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-12 21:36:55,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 68 transitions, 509 flow [2022-12-12 21:36:55,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 66 transitions, 493 flow [2022-12-12 21:36:55,870 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 66 transitions, 493 flow [2022-12-12 21:36:55,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:55,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:55,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:55,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:36:55,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1625484506, now seen corresponding path program 1 times [2022-12-12 21:36:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:55,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740458522] [2022-12-12 21:36:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:55,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740458522] [2022-12-12 21:36:55,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740458522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:55,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:55,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684817765] [2022-12-12 21:36:55,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:55,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:55,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:36:55,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 66 transitions, 493 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:55,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:55,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:36:55,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:56,322 INFO L130 PetriNetUnfolder]: 2467/3810 cut-off events. [2022-12-12 21:36:56,322 INFO L131 PetriNetUnfolder]: For 2562/2570 co-relation queries the response was YES. [2022-12-12 21:36:56,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16837 conditions, 3810 events. 2467/3810 cut-off events. For 2562/2570 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20007 event pairs, 146 based on Foata normal form. 298/3551 useless extension candidates. Maximal degree in co-relation 16817. Up to 3203 conditions per place. [2022-12-12 21:36:56,340 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 95 selfloop transitions, 21 changer transitions 5/129 dead transitions. [2022-12-12 21:36:56,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 129 transitions, 1209 flow [2022-12-12 21:36:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-12 21:36:56,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2022-12-12 21:36:56,342 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -16 predicate places. [2022-12-12 21:36:56,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 129 transitions, 1209 flow [2022-12-12 21:36:56,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 124 transitions, 1159 flow [2022-12-12 21:36:56,356 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 124 transitions, 1159 flow [2022-12-12 21:36:56,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:56,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:56,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:56,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:36:56,357 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1768059575, now seen corresponding path program 1 times [2022-12-12 21:36:56,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:56,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420181620] [2022-12-12 21:36:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:56,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420181620] [2022-12-12 21:36:56,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420181620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:56,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:56,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52114305] [2022-12-12 21:36:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:56,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:56,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:36:56,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 124 transitions, 1159 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:56,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:56,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:36:56,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:56,708 INFO L130 PetriNetUnfolder]: 1387/2372 cut-off events. [2022-12-12 21:36:56,708 INFO L131 PetriNetUnfolder]: For 2314/2364 co-relation queries the response was YES. [2022-12-12 21:36:56,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12745 conditions, 2372 events. 1387/2372 cut-off events. For 2314/2364 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13041 event pairs, 62 based on Foata normal form. 273/2311 useless extension candidates. Maximal degree in co-relation 12722. Up to 2002 conditions per place. [2022-12-12 21:36:56,719 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 81 selfloop transitions, 38 changer transitions 47/174 dead transitions. [2022-12-12 21:36:56,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 174 transitions, 1940 flow [2022-12-12 21:36:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:36:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:36:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-12 21:36:56,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2022-12-12 21:36:56,721 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -12 predicate places. [2022-12-12 21:36:56,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 174 transitions, 1940 flow [2022-12-12 21:36:56,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 127 transitions, 1412 flow [2022-12-12 21:36:56,730 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 127 transitions, 1412 flow [2022-12-12 21:36:56,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:56,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:56,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:56,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:36:56,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash 677144349, now seen corresponding path program 1 times [2022-12-12 21:36:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:56,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056009885] [2022-12-12 21:36:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:56,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056009885] [2022-12-12 21:36:56,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056009885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:56,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:56,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671888878] [2022-12-12 21:36:56,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:56,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:36:56,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 127 transitions, 1412 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:56,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:56,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:36:56,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:57,099 INFO L130 PetriNetUnfolder]: 1539/2710 cut-off events. [2022-12-12 21:36:57,100 INFO L131 PetriNetUnfolder]: For 4321/4366 co-relation queries the response was YES. [2022-12-12 21:36:57,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16899 conditions, 2710 events. 1539/2710 cut-off events. For 4321/4366 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15973 event pairs, 49 based on Foata normal form. 90/2376 useless extension candidates. Maximal degree in co-relation 16873. Up to 2273 conditions per place. [2022-12-12 21:36:57,110 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 134 selfloop transitions, 11 changer transitions 72/234 dead transitions. [2022-12-12 21:36:57,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 234 transitions, 3136 flow [2022-12-12 21:36:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-12 21:36:57,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2022-12-12 21:36:57,112 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2022-12-12 21:36:57,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 234 transitions, 3136 flow [2022-12-12 21:36:57,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 162 transitions, 2131 flow [2022-12-12 21:36:57,121 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 162 transitions, 2131 flow [2022-12-12 21:36:57,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:57,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:57,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:57,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:36:57,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1874376705, now seen corresponding path program 1 times [2022-12-12 21:36:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:57,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904418659] [2022-12-12 21:36:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:57,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:57,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904418659] [2022-12-12 21:36:57,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904418659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:57,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:57,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:36:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127191725] [2022-12-12 21:36:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:57,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:36:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:57,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:36:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:36:57,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:36:57,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 162 transitions, 2131 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:57,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:57,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:36:57,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:57,436 INFO L130 PetriNetUnfolder]: 652/1325 cut-off events. [2022-12-12 21:36:57,436 INFO L131 PetriNetUnfolder]: For 3234/3332 co-relation queries the response was YES. [2022-12-12 21:36:57,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 1325 events. 652/1325 cut-off events. For 3234/3332 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7745 event pairs, 15 based on Foata normal form. 169/1295 useless extension candidates. Maximal degree in co-relation 9347. Up to 1058 conditions per place. [2022-12-12 21:36:57,441 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 56 selfloop transitions, 57 changer transitions 40/159 dead transitions. [2022-12-12 21:36:57,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 159 transitions, 2391 flow [2022-12-12 21:36:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:36:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:36:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-12 21:36:57,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-12 21:36:57,444 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2022-12-12 21:36:57,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 159 transitions, 2391 flow [2022-12-12 21:36:57,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 119 transitions, 1794 flow [2022-12-12 21:36:57,449 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 119 transitions, 1794 flow [2022-12-12 21:36:57,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:57,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:57,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:57,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:36:57,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1486053737, now seen corresponding path program 1 times [2022-12-12 21:36:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:57,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591897255] [2022-12-12 21:36:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:36:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591897255] [2022-12-12 21:36:57,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591897255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:57,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893636033] [2022-12-12 21:36:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:57,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:57,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:36:57,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 119 transitions, 1794 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:57,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:57,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:36:57,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:57,760 INFO L130 PetriNetUnfolder]: 615/1232 cut-off events. [2022-12-12 21:36:57,760 INFO L131 PetriNetUnfolder]: For 3234/3275 co-relation queries the response was YES. [2022-12-12 21:36:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9812 conditions, 1232 events. 615/1232 cut-off events. For 3234/3275 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6925 event pairs, 6 based on Foata normal form. 33/1027 useless extension candidates. Maximal degree in co-relation 9780. Up to 988 conditions per place. [2022-12-12 21:36:57,764 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 52 selfloop transitions, 2 changer transitions 116/182 dead transitions. [2022-12-12 21:36:57,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 182 transitions, 3134 flow [2022-12-12 21:36:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-12 21:36:57,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-12 21:36:57,767 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2022-12-12 21:36:57,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 182 transitions, 3134 flow [2022-12-12 21:36:57,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 66 transitions, 1055 flow [2022-12-12 21:36:57,771 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 1055 flow [2022-12-12 21:36:57,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:57,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:57,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:57,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:36:57,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2041389447, now seen corresponding path program 1 times [2022-12-12 21:36:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812634096] [2022-12-12 21:36:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:58,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-12-12 21:36:58,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:58,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812634096] [2022-12-12 21:36:58,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812634096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:58,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:58,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322612358] [2022-12-12 21:36:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:58,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:58,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:58,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:58,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:36:58,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 1055 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:58,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:58,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:36:58,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:58,270 INFO L130 PetriNetUnfolder]: 297/707 cut-off events. [2022-12-12 21:36:58,270 INFO L131 PetriNetUnfolder]: For 1206/1206 co-relation queries the response was YES. [2022-12-12 21:36:58,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 707 events. 297/707 cut-off events. For 1206/1206 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4318 event pairs, 3 based on Foata normal form. 27/581 useless extension candidates. Maximal degree in co-relation 6082. Up to 546 conditions per place. [2022-12-12 21:36:58,273 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 38 selfloop transitions, 3 changer transitions 52/105 dead transitions. [2022-12-12 21:36:58,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 105 transitions, 1941 flow [2022-12-12 21:36:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:36:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:36:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-12 21:36:58,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-12 21:36:58,289 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2022-12-12 21:36:58,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 105 transitions, 1941 flow [2022-12-12 21:36:58,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 53 transitions, 919 flow [2022-12-12 21:36:58,291 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 919 flow [2022-12-12 21:36:58,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:58,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:58,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:58,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:36:58,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2061160207, now seen corresponding path program 1 times [2022-12-12 21:36:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:58,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567040124] [2022-12-12 21:36:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:36:58,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:36:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:36:58,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:36:58,373 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:36:58,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:36:58,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:36:58,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:36:58,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:36:58,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:36:58,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:36:58,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:36:58,376 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:58,380 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:36:58,380 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:36:58,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:36:58 BasicIcfg [2022-12-12 21:36:58,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:36:58,418 INFO L158 Benchmark]: Toolchain (without parser) took 10724.20ms. Allocated memory was 220.2MB in the beginning and 615.5MB in the end (delta: 395.3MB). Free memory was 178.4MB in the beginning and 347.9MB in the end (delta: -169.5MB). Peak memory consumption was 226.9MB. Max. memory is 8.0GB. [2022-12-12 21:36:58,419 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:36:58,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.52ms. Allocated memory is still 220.2MB. Free memory was 177.9MB in the beginning and 152.2MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 21:36:58,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.94ms. Allocated memory is still 220.2MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:36:58,419 INFO L158 Benchmark]: Boogie Preprocessor took 21.41ms. Allocated memory is still 220.2MB. Free memory was 149.6MB in the beginning and 148.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:36:58,419 INFO L158 Benchmark]: RCFGBuilder took 575.82ms. Allocated memory is still 220.2MB. Free memory was 147.5MB in the beginning and 117.6MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 21:36:58,419 INFO L158 Benchmark]: TraceAbstraction took 9618.91ms. Allocated memory was 220.2MB in the beginning and 615.5MB in the end (delta: 395.3MB). Free memory was 116.6MB in the beginning and 347.9MB in the end (delta: -231.4MB). Peak memory consumption was 165.0MB. Max. memory is 8.0GB. [2022-12-12 21:36:58,420 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.09ms. Allocated memory is still 220.2MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 439.52ms. Allocated memory is still 220.2MB. Free memory was 177.9MB in the beginning and 152.2MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.94ms. Allocated memory is still 220.2MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.41ms. Allocated memory is still 220.2MB. Free memory was 149.6MB in the beginning and 148.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 575.82ms. Allocated memory is still 220.2MB. Free memory was 147.5MB in the beginning and 117.6MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9618.91ms. Allocated memory was 220.2MB in the beginning and 615.5MB in the end (delta: 395.3MB). Free memory was 116.6MB in the beginning and 347.9MB in the end (delta: -231.4MB). Peak memory consumption was 165.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 116 PlacesBefore, 65 PlacesAfterwards, 108 TransitionsBefore, 56 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 3818, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 0, independent unconditional: 3818, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 0, independent unconditional: 3818, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 0, independent unconditional: 3818, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1962, independent: 1919, independent conditional: 0, independent unconditional: 1919, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1962, independent: 1884, independent conditional: 0, independent unconditional: 1884, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3939, independent: 1899, independent conditional: 0, independent unconditional: 1899, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 1962, unknown conditional: 0, unknown unconditional: 1962] , Statistics on independence cache: Total cache size (in pairs): 4171, Positive cache size: 4128, Positive conditional cache size: 0, Positive unconditional cache size: 4128, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 676 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 6 mSDtfsCounter, 676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2131occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5473 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:36:58,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...