/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:38:11,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:38:11,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:38:11,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:38:11,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:38:11,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:38:11,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:38:11,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:38:11,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:38:11,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:38:11,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:38:11,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:38:11,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:38:11,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:38:11,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:38:11,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:38:11,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:38:11,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:38:11,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:38:11,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:38:11,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:38:11,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:38:11,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:38:11,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:38:11,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:38:11,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:38:11,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:38:11,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:38:11,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:38:11,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:38:11,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:38:11,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:38:11,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:38:11,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:38:11,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:38:11,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:38:11,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:38:11,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:38:11,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:38:11,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:38:11,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:38:11,216 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 14:38:11,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:38:11,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:38:11,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:38:11,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:38:11,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:38:11,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:38:11,244 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:38:11,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:38:11,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:38:11,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:38:11,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:38:11,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:38:11,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:38:11,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:38:11,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:38:11,247 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 [2022-12-12 14:38:11,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:38:11,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:38:11,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:38:11,556 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:38:11,557 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:38:11,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 14:38:12,463 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:38:12,741 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:38:12,742 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 14:38:12,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1220461/e30288301b794f9dbaf11c25a86a2f11/FLAGf149bdc82 [2022-12-12 14:38:12,777 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1220461/e30288301b794f9dbaf11c25a86a2f11 [2022-12-12 14:38:12,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:38:12,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:38:12,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:38:12,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:38:12,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:38:12,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:38:12" (1/1) ... [2022-12-12 14:38:12,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c77fa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:12, skipping insertion in model container [2022-12-12 14:38:12,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:38:12" (1/1) ... [2022-12-12 14:38:12,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:38:12,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:38:12,978 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-12 14:38:13,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:38:13,166 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:38:13,176 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-12 14:38:13,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:13,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:13,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:38:13,247 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:38:13,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13 WrapperNode [2022-12-12 14:38:13,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:38:13,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:38:13,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:38:13,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:38:13,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,283 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-12 14:38:13,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:38:13,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:38:13,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:38:13,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:38:13,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:38:13,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:38:13,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:38:13,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:38:13,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (1/1) ... [2022-12-12 14:38:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:38:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:38:13,329 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 14:38:13,347 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 14:38:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:38:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:38:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:38:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:38:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:38:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:38:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:38:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:38:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:38:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:38:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:38:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:38:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:38:13,362 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 14:38:13,509 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:38:13,511 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:38:13,847 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:38:13,948 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:38:13,948 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:38:13,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:38:13 BoogieIcfgContainer [2022-12-12 14:38:13,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:38:13,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:38:13,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:38:13,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:38:13,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:38:12" (1/3) ... [2022-12-12 14:38:13,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9545944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:38:13, skipping insertion in model container [2022-12-12 14:38:13,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:13" (2/3) ... [2022-12-12 14:38:13,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9545944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:38:13, skipping insertion in model container [2022-12-12 14:38:13,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:38:13" (3/3) ... [2022-12-12 14:38:13,957 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 14:38:13,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:38:13,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:38:13,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:38:14,004 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:38:14,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-12 14:38:14,076 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-12 14:38:14,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:38:14,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 14:38:14,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-12 14:38:14,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-12 14:38:14,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:38:14,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-12 14:38:14,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-12 14:38:14,135 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-12 14:38:14,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:38:14,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 14:38:14,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-12 14:38:14,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-12 14:38:19,810 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-12 14:38:19,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:38:19,825 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;@758604bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:38:19,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 14:38:19,828 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-12 14:38:19,828 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:38:19,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:19,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:38:19,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash 379366899, now seen corresponding path program 1 times [2022-12-12 14:38:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:19,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057589098] [2022-12-12 14:38:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:20,090 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 14:38:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:20,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057589098] [2022-12-12 14:38:20,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057589098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:20,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:20,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:38:20,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001425270] [2022-12-12 14:38:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:20,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:38:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:38:20,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:38:20,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-12 14:38:20,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 14:38:20,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:20,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-12 14:38:20,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:20,436 INFO L130 PetriNetUnfolder]: 944/1804 cut-off events. [2022-12-12 14:38:20,437 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 14:38:20,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1804 events. 944/1804 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 12073 event pairs, 100 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 3365. Up to 1325 conditions per place. [2022-12-12 14:38:20,453 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 40/69 dead transitions. [2022-12-12 14:38:20,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 268 flow [2022-12-12 14:38:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:38:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:38:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-12 14:38:20,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-12 14:38:20,464 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2022-12-12 14:38:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 268 flow [2022-12-12 14:38:20,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:20,468 INFO L231 Difference]: Finished difference. Result has 49 places, 22 transitions, 52 flow [2022-12-12 14:38:20,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=49, PETRI_TRANSITIONS=22} [2022-12-12 14:38:20,472 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-12 14:38:20,472 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 22 transitions, 52 flow [2022-12-12 14:38:20,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 14:38:20,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:20,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:20,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:38:20,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash -500557936, now seen corresponding path program 1 times [2022-12-12 14:38:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:20,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385229092] [2022-12-12 14:38:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:20,861 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 14:38:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:20,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385229092] [2022-12-12 14:38:20,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385229092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:20,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:20,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:38:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427616952] [2022-12-12 14:38:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:20,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:38:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:38:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:38:20,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 14:38:20,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 22 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 14:38:20,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:20,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 14:38:20,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:20,919 INFO L130 PetriNetUnfolder]: 173/350 cut-off events. [2022-12-12 14:38:20,920 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-12 14:38:20,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 350 events. 173/350 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1505 event pairs, 77 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 684. Up to 290 conditions per place. [2022-12-12 14:38:20,922 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-12 14:38:20,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 116 flow [2022-12-12 14:38:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:38:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:38:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-12 14:38:20,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-12 14:38:20,923 INFO L175 Difference]: Start difference. First operand has 49 places, 22 transitions, 52 flow. Second operand 3 states and 42 transitions. [2022-12-12 14:38:20,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 116 flow [2022-12-12 14:38:20,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:20,924 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 67 flow [2022-12-12 14:38:20,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-12 14:38:20,925 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -21 predicate places. [2022-12-12 14:38:20,925 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 67 flow [2022-12-12 14:38:20,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 14:38:20,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:20,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:38:20,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1662571766, now seen corresponding path program 1 times [2022-12-12 14:38:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:20,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201645394] [2022-12-12 14:38:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:21,306 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 14:38:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:21,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201645394] [2022-12-12 14:38:21,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201645394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:21,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:21,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888220768] [2022-12-12 14:38:21,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:21,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:21,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 14:38:21,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 14:38:21,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:21,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 14:38:21,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:21,398 INFO L130 PetriNetUnfolder]: 169/344 cut-off events. [2022-12-12 14:38:21,399 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-12 14:38:21,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 344 events. 169/344 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1460 event pairs, 75 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 729. Up to 271 conditions per place. [2022-12-12 14:38:21,401 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 23 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2022-12-12 14:38:21,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 147 flow [2022-12-12 14:38:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-12 14:38:21,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30113636363636365 [2022-12-12 14:38:21,402 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 67 flow. Second operand 4 states and 53 transitions. [2022-12-12 14:38:21,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 147 flow [2022-12-12 14:38:21,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:38:21,403 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 89 flow [2022-12-12 14:38:21,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-12 14:38:21,404 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -18 predicate places. [2022-12-12 14:38:21,404 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 89 flow [2022-12-12 14:38:21,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 14:38:21,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:21,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:21,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:38:21,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:21,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2132275356, now seen corresponding path program 1 times [2022-12-12 14:38:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:21,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344851757] [2022-12-12 14:38:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:21,643 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 14:38:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:21,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344851757] [2022-12-12 14:38:21,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344851757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:21,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:21,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093693436] [2022-12-12 14:38:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:21,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 14:38:21,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 14:38:21,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:21,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 14:38:21,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:21,748 INFO L130 PetriNetUnfolder]: 204/386 cut-off events. [2022-12-12 14:38:21,748 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-12 14:38:21,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 386 events. 204/386 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1532 event pairs, 46 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 919. Up to 298 conditions per place. [2022-12-12 14:38:21,751 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 29 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2022-12-12 14:38:21,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 212 flow [2022-12-12 14:38:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-12 14:38:21,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-12 14:38:21,754 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 89 flow. Second operand 4 states and 54 transitions. [2022-12-12 14:38:21,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 212 flow [2022-12-12 14:38:21,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:21,758 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 133 flow [2022-12-12 14:38:21,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-12 14:38:21,759 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-12 14:38:21,760 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 133 flow [2022-12-12 14:38:21,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 14:38:21,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:21,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:21,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:38:21,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2147355310, now seen corresponding path program 2 times [2022-12-12 14:38:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:21,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072717759] [2022-12-12 14:38:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:22,047 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 14:38:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:22,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072717759] [2022-12-12 14:38:22,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072717759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:22,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:22,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729847817] [2022-12-12 14:38:22,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:22,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:22,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:22,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 14:38:22,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 14:38:22,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:22,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 14:38:22,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:22,116 INFO L130 PetriNetUnfolder]: 163/322 cut-off events. [2022-12-12 14:38:22,116 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-12-12 14:38:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 322 events. 163/322 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1310 event pairs, 40 based on Foata normal form. 4/281 useless extension candidates. Maximal degree in co-relation 868. Up to 238 conditions per place. [2022-12-12 14:38:22,118 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 28 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-12 14:38:22,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 233 flow [2022-12-12 14:38:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-12 14:38:22,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30113636363636365 [2022-12-12 14:38:22,119 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 133 flow. Second operand 4 states and 53 transitions. [2022-12-12 14:38:22,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 233 flow [2022-12-12 14:38:22,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:38:22,121 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 148 flow [2022-12-12 14:38:22,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-12 14:38:22,121 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2022-12-12 14:38:22,121 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 148 flow [2022-12-12 14:38:22,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 14:38:22,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:22,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:22,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:38:22,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1676890108, now seen corresponding path program 1 times [2022-12-12 14:38:22,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:22,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373982421] [2022-12-12 14:38:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:22,383 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 14:38:22,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:22,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373982421] [2022-12-12 14:38:22,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373982421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:22,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:22,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073633757] [2022-12-12 14:38:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:22,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:22,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:22,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 14:38:22,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 14:38:22,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:22,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 14:38:22,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:22,480 INFO L130 PetriNetUnfolder]: 168/331 cut-off events. [2022-12-12 14:38:22,481 INFO L131 PetriNetUnfolder]: For 374/374 co-relation queries the response was YES. [2022-12-12 14:38:22,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 331 events. 168/331 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1359 event pairs, 47 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 932. Up to 241 conditions per place. [2022-12-12 14:38:22,483 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 28 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2022-12-12 14:38:22,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 270 flow [2022-12-12 14:38:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-12 14:38:22,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2022-12-12 14:38:22,485 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 148 flow. Second operand 5 states and 64 transitions. [2022-12-12 14:38:22,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 270 flow [2022-12-12 14:38:22,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 256 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:22,489 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 186 flow [2022-12-12 14:38:22,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-12 14:38:22,491 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-12-12 14:38:22,491 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 186 flow [2022-12-12 14:38:22,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 14:38:22,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:22,491 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:38:22,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1676892898, now seen corresponding path program 2 times [2022-12-12 14:38:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:22,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181788881] [2022-12-12 14:38:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:22,853 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 14:38:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181788881] [2022-12-12 14:38:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181788881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:22,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:22,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829439074] [2022-12-12 14:38:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:22,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:38:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:22,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:38:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:38:22,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 14:38:22,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 14:38:22,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:22,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 14:38:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:22,965 INFO L130 PetriNetUnfolder]: 170/336 cut-off events. [2022-12-12 14:38:22,966 INFO L131 PetriNetUnfolder]: For 551/551 co-relation queries the response was YES. [2022-12-12 14:38:22,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 336 events. 170/336 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1406 event pairs, 48 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1027. Up to 245 conditions per place. [2022-12-12 14:38:22,968 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 29 selfloop transitions, 15 changer transitions 0/50 dead transitions. [2022-12-12 14:38:22,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 340 flow [2022-12-12 14:38:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-12 14:38:22,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2863636363636364 [2022-12-12 14:38:22,969 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 186 flow. Second operand 5 states and 63 transitions. [2022-12-12 14:38:22,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 340 flow [2022-12-12 14:38:22,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 318 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:22,971 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 257 flow [2022-12-12 14:38:22,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-12 14:38:22,972 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-12-12 14:38:22,972 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 257 flow [2022-12-12 14:38:22,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 14:38:22,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:22,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:22,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:38:22,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1675938718, now seen corresponding path program 3 times [2022-12-12 14:38:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:22,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322657309] [2022-12-12 14:38:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:23,375 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 14:38:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:23,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322657309] [2022-12-12 14:38:23,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322657309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:23,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:23,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456277350] [2022-12-12 14:38:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:23,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:38:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:38:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:38:23,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 14:38:23,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 14:38:23,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:23,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 14:38:23,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:23,544 INFO L130 PetriNetUnfolder]: 223/421 cut-off events. [2022-12-12 14:38:23,544 INFO L131 PetriNetUnfolder]: For 970/970 co-relation queries the response was YES. [2022-12-12 14:38:23,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 421 events. 223/421 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1729 event pairs, 40 based on Foata normal form. 5/373 useless extension candidates. Maximal degree in co-relation 1396. Up to 285 conditions per place. [2022-12-12 14:38:23,547 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 42 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2022-12-12 14:38:23,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 471 flow [2022-12-12 14:38:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:38:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:38:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-12 14:38:23,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.262987012987013 [2022-12-12 14:38:23,548 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 257 flow. Second operand 7 states and 81 transitions. [2022-12-12 14:38:23,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 471 flow [2022-12-12 14:38:23,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 457 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-12 14:38:23,551 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 343 flow [2022-12-12 14:38:23,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-12 14:38:23,552 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2022-12-12 14:38:23,552 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 343 flow [2022-12-12 14:38:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 14:38:23,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:23,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:38:23,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 6244571, now seen corresponding path program 1 times [2022-12-12 14:38:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318600197] [2022-12-12 14:38:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:23,624 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 14:38:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:23,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318600197] [2022-12-12 14:38:23,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318600197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:23,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:23,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:38:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501133140] [2022-12-12 14:38:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:23,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:38:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:38:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:38:23,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 14:38:23,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 14:38:23,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:23,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 14:38:23,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:23,683 INFO L130 PetriNetUnfolder]: 140/299 cut-off events. [2022-12-12 14:38:23,683 INFO L131 PetriNetUnfolder]: For 1011/1024 co-relation queries the response was YES. [2022-12-12 14:38:23,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 299 events. 140/299 cut-off events. For 1011/1024 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1304 event pairs, 42 based on Foata normal form. 17/245 useless extension candidates. Maximal degree in co-relation 1135. Up to 250 conditions per place. [2022-12-12 14:38:23,685 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 32 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2022-12-12 14:38:23,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 371 flow [2022-12-12 14:38:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:38:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:38:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-12 14:38:23,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-12 14:38:23,686 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 343 flow. Second operand 3 states and 45 transitions. [2022-12-12 14:38:23,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 371 flow [2022-12-12 14:38:23,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 322 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-12-12 14:38:23,689 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 238 flow [2022-12-12 14:38:23,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-12 14:38:23,689 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-12-12 14:38:23,690 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 238 flow [2022-12-12 14:38:23,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 14:38:23,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:23,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:38:23,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1505480173, now seen corresponding path program 1 times [2022-12-12 14:38:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:23,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736257593] [2022-12-12 14:38:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:23,773 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 14:38:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:23,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736257593] [2022-12-12 14:38:23,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736257593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:23,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:23,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301543075] [2022-12-12 14:38:23,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:23,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:38:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:38:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:38:23,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 14:38:23,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 14:38:23,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:23,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 14:38:23,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:23,820 INFO L130 PetriNetUnfolder]: 44/140 cut-off events. [2022-12-12 14:38:23,821 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-12 14:38:23,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 140 events. 44/140 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 541 event pairs, 6 based on Foata normal form. 21/126 useless extension candidates. Maximal degree in co-relation 551. Up to 55 conditions per place. [2022-12-12 14:38:23,822 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 26 selfloop transitions, 13 changer transitions 1/48 dead transitions. [2022-12-12 14:38:23,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 357 flow [2022-12-12 14:38:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-12 14:38:23,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2840909090909091 [2022-12-12 14:38:23,823 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 238 flow. Second operand 4 states and 50 transitions. [2022-12-12 14:38:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 357 flow [2022-12-12 14:38:23,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 322 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:23,825 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 244 flow [2022-12-12 14:38:23,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-12 14:38:23,826 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-12 14:38:23,826 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 244 flow [2022-12-12 14:38:23,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 14:38:23,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:23,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:23,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:38:23,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash 418361628, now seen corresponding path program 1 times [2022-12-12 14:38:23,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:23,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869136063] [2022-12-12 14:38:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:23,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:24,012 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 14:38:24,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:24,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869136063] [2022-12-12 14:38:24,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869136063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:24,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:24,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397413588] [2022-12-12 14:38:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:24,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:24,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:24,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-12 14:38:24,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 14:38:24,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:24,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-12 14:38:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:24,129 INFO L130 PetriNetUnfolder]: 62/206 cut-off events. [2022-12-12 14:38:24,129 INFO L131 PetriNetUnfolder]: For 291/303 co-relation queries the response was YES. [2022-12-12 14:38:24,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 206 events. 62/206 cut-off events. For 291/303 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 993 event pairs, 4 based on Foata normal form. 21/198 useless extension candidates. Maximal degree in co-relation 779. Up to 99 conditions per place. [2022-12-12 14:38:24,130 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 25 selfloop transitions, 3 changer transitions 34/67 dead transitions. [2022-12-12 14:38:24,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 527 flow [2022-12-12 14:38:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:38:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:38:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-12 14:38:24,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26515151515151514 [2022-12-12 14:38:24,131 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 244 flow. Second operand 6 states and 70 transitions. [2022-12-12 14:38:24,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 527 flow [2022-12-12 14:38:24,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 458 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-12 14:38:24,134 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 158 flow [2022-12-12 14:38:24,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-12 14:38:24,134 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-12-12 14:38:24,134 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 158 flow [2022-12-12 14:38:24,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 14:38:24,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:24,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:24,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:38:24,135 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash -50603445, now seen corresponding path program 1 times [2022-12-12 14:38:24,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:24,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702688690] [2022-12-12 14:38:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:24,564 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 14:38:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:24,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702688690] [2022-12-12 14:38:24,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702688690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:24,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:24,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273781616] [2022-12-12 14:38:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:38:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:38:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:38:24,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-12 14:38:24,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 30 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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 14:38:24,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:24,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-12 14:38:24,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:24,625 INFO L130 PetriNetUnfolder]: 30/134 cut-off events. [2022-12-12 14:38:24,625 INFO L131 PetriNetUnfolder]: For 125/131 co-relation queries the response was YES. [2022-12-12 14:38:24,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 134 events. 30/134 cut-off events. For 125/131 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 631 event pairs, 2 based on Foata normal form. 15/128 useless extension candidates. Maximal degree in co-relation 425. Up to 61 conditions per place. [2022-12-12 14:38:24,626 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 20 selfloop transitions, 4 changer transitions 11/41 dead transitions. [2022-12-12 14:38:24,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 281 flow [2022-12-12 14:38:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-12 14:38:24,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2545454545454545 [2022-12-12 14:38:24,627 INFO L175 Difference]: Start difference. First operand has 50 places, 30 transitions, 158 flow. Second operand 5 states and 56 transitions. [2022-12-12 14:38:24,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 281 flow [2022-12-12 14:38:24,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 263 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-12 14:38:24,628 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 142 flow [2022-12-12 14:38:24,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-12-12 14:38:24,629 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2022-12-12 14:38:24,629 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 142 flow [2022-12-12 14:38:24,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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 14:38:24,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:24,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:24,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:38:24,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:38:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1663247831, now seen corresponding path program 2 times [2022-12-12 14:38:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:24,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553198859] [2022-12-12 14:38:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:38:24,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:38:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:38:24,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:38:24,701 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:38:24,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 14:38:24,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 14:38:24,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 14:38:24,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 14:38:24,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 14:38:24,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:38:24,703 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:24,707 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:38:24,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:38:24,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:38:24 BasicIcfg [2022-12-12 14:38:24,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:38:24,760 INFO L158 Benchmark]: Toolchain (without parser) took 11979.94ms. Allocated memory was 208.7MB in the beginning and 451.9MB in the end (delta: 243.3MB). Free memory was 183.3MB in the beginning and 316.9MB in the end (delta: -133.6MB). Peak memory consumption was 110.2MB. Max. memory is 8.0GB. [2022-12-12 14:38:24,760 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 184.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:38:24,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.27ms. Allocated memory is still 208.7MB. Free memory was 183.3MB in the beginning and 158.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-12 14:38:24,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.57ms. Allocated memory is still 208.7MB. Free memory was 158.7MB in the beginning and 156.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 14:38:24,761 INFO L158 Benchmark]: Boogie Preprocessor took 20.86ms. Allocated memory is still 208.7MB. Free memory was 156.0MB in the beginning and 154.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:38:24,761 INFO L158 Benchmark]: RCFGBuilder took 645.20ms. Allocated memory is still 208.7MB. Free memory was 154.5MB in the beginning and 123.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 14:38:24,761 INFO L158 Benchmark]: TraceAbstraction took 10807.52ms. Allocated memory was 208.7MB in the beginning and 451.9MB in the end (delta: 243.3MB). Free memory was 122.0MB in the beginning and 316.9MB in the end (delta: -194.9MB). Peak memory consumption was 49.4MB. Max. memory is 8.0GB. [2022-12-12 14:38:24,762 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 184.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.27ms. Allocated memory is still 208.7MB. Free memory was 183.3MB in the beginning and 158.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.57ms. Allocated memory is still 208.7MB. Free memory was 158.7MB in the beginning and 156.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.86ms. Allocated memory is still 208.7MB. Free memory was 156.0MB in the beginning and 154.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 645.20ms. Allocated memory is still 208.7MB. Free memory was 154.5MB in the beginning and 123.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10807.52ms. Allocated memory was 208.7MB in the beginning and 451.9MB in the end (delta: 243.3MB). Free memory was 122.0MB in the beginning and 316.9MB in the end (delta: -194.9MB). Peak memory consumption was 49.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 90 PlacesBefore, 51 PlacesAfterwards, 85 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 1427, independent unconditional: 0, dependent: 200, dependent conditional: 200, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, independent: 839, independent conditional: 0, independent unconditional: 839, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, independent: 822, independent conditional: 0, independent unconditional: 822, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 380, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 364, dependent conditional: 0, dependent unconditional: 364, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1627, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 892, unknown conditional: 0, unknown unconditional: 892] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1282, Positive conditional cache size: 0, Positive unconditional cache size: 1282, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 687 IncrementalHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 15 mSDtfsCounter, 687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:38:24,777 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...