/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:36:18,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:36:18,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:36:18,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:36:18,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:36:18,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:36:18,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:36:18,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:36:18,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:36:18,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:36:18,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:36:18,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:36:18,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:36:18,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:36:18,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:36:18,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:36:18,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:36:18,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:36:18,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:36:18,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:36:18,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:36:18,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:36:18,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:36:18,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:36:18,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:36:18,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:36:18,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:36:18,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:36:18,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:36:18,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:36:18,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:36:18,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:36:18,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:36:18,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:36:18,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:36:18,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:36:18,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:36:18,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:36:18,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:36:18,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:36:18,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:36:18,632 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-NoLbe.epf [2022-09-20 20:36:18,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:36:18,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:36:18,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:36:18,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:36:18,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:36:18,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:36:18,646 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:36:18,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:36:18,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:36:18,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:36:18,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:36:18,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:36:18,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:36:18,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:36:18,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:36:18,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:36:18,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:36:18,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:36:18,649 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-09-20 20:36:18,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:36:18,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:36:18,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:36:18,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:36:18,799 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:36:18,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-09-20 20:36:18,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbc43389/9a032995b91d45fdae18ce3c4303e599/FLAGa348788fe [2022-09-20 20:36:19,193 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:36:19,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-09-20 20:36:19,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbc43389/9a032995b91d45fdae18ce3c4303e599/FLAGa348788fe [2022-09-20 20:36:19,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbc43389/9a032995b91d45fdae18ce3c4303e599 [2022-09-20 20:36:19,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:36:19,587 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:36:19,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:36:19,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:36:19,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:36:19,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:36:19" (1/1) ... [2022-09-20 20:36:19,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1342a22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:19, skipping insertion in model container [2022-09-20 20:36:19,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:36:19" (1/1) ... [2022-09-20 20:36:19,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:36:19,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:36:19,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-09-20 20:36:19,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:36:19,948 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:36:19,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-09-20 20:36:20,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:36:20,040 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:36:20,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20 WrapperNode [2022-09-20 20:36:20,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:36:20,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:36:20,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:36:20,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:36:20,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,107 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292 [2022-09-20 20:36:20,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:36:20,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:36:20,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:36:20,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:36:20,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:36:20,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:36:20,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:36:20,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:36:20,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (1/1) ... [2022-09-20 20:36:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:36:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:36:20,184 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-09-20 20:36:20,186 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-09-20 20:36:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:36:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:36:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:36:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:36:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:36:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 20:36:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 20:36:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:36:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:36:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:36:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:36:20,210 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:36:20,292 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:36:20,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:36:20,648 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:36:20,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:36:20,858 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:36:20,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:36:20 BoogieIcfgContainer [2022-09-20 20:36:20,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:36:20,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:36:20,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:36:20,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:36:20,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:36:19" (1/3) ... [2022-09-20 20:36:20,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1c4501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:36:20, skipping insertion in model container [2022-09-20 20:36:20,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:36:20" (2/3) ... [2022-09-20 20:36:20,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1c4501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:36:20, skipping insertion in model container [2022-09-20 20:36:20,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:36:20" (3/3) ... [2022-09-20 20:36:20,868 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2022-09-20 20:36:20,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:36:20,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:36:20,879 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:36:20,932 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:36:20,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-09-20 20:36:21,014 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-09-20 20:36:21,015 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:36:21,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-09-20 20:36:21,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-09-20 20:36:21,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-09-20 20:36:21,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:36:21,041 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;@22155668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:36:21,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 20:36:21,051 INFO L130 PetriNetUnfolder]: 0/78 cut-off events. [2022-09-20 20:36:21,051 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:36:21,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:21,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:21,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1812777549, now seen corresponding path program 1 times [2022-09-20 20:36:21,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:21,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243429524] [2022-09-20 20:36:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:21,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243429524] [2022-09-20 20:36:21,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243429524] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:21,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:21,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:36:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311827804] [2022-09-20 20:36:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:21,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:36:21,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:36:21,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:36:21,366 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 138 [2022-09-20 20:36:21,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-09-20 20:36:21,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:21,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 138 [2022-09-20 20:36:21,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:21,525 INFO L130 PetriNetUnfolder]: 57/352 cut-off events. [2022-09-20 20:36:21,525 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 20:36:21,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 352 events. 57/352 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1386 event pairs, 11 based on Foata normal form. 14/349 useless extension candidates. Maximal degree in co-relation 423. Up to 75 conditions per place. [2022-09-20 20:36:21,531 INFO L137 encePairwiseOnDemand]: 133/138 looper letters, 14 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-09-20 20:36:21,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 135 transitions, 317 flow [2022-09-20 20:36:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:36:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:36:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-09-20 20:36:21,544 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-09-20 20:36:21,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-09-20 20:36:21,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-09-20 20:36:21,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:21,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-09-20 20:36:21,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-09-20 20:36:21,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-09-20 20:36:21,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-09-20 20:36:21,560 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 280 flow. Second operand 3 states and 390 transitions. [2022-09-20 20:36:21,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 135 transitions, 317 flow [2022-09-20 20:36:21,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 135 transitions, 312 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 20:36:21,570 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 272 flow [2022-09-20 20:36:21,571 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2022-09-20 20:36:21,575 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-09-20 20:36:21,576 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 272 flow [2022-09-20 20:36:21,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-09-20 20:36:21,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:21,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:21,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:36:21,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 706789698, now seen corresponding path program 1 times [2022-09-20 20:36:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:21,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185405781] [2022-09-20 20:36:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:21,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185405781] [2022-09-20 20:36:21,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185405781] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:21,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:21,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:36:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905610233] [2022-09-20 20:36:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:21,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:36:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:36:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:36:21,853 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2022-09-20 20:36:21,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-09-20 20:36:21,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:21,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2022-09-20 20:36:21,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:22,366 INFO L130 PetriNetUnfolder]: 954/2749 cut-off events. [2022-09-20 20:36:22,367 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-09-20 20:36:22,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 2749 events. 954/2749 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22447 event pairs, 435 based on Foata normal form. 0/2665 useless extension candidates. Maximal degree in co-relation 4314. Up to 816 conditions per place. [2022-09-20 20:36:22,382 INFO L137 encePairwiseOnDemand]: 131/138 looper letters, 24 selfloop transitions, 3 changer transitions 56/181 dead transitions. [2022-09-20 20:36:22,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 181 transitions, 534 flow [2022-09-20 20:36:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:36:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:36:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1107 transitions. [2022-09-20 20:36:22,385 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8913043478260869 [2022-09-20 20:36:22,386 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1107 transitions. [2022-09-20 20:36:22,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1107 transitions. [2022-09-20 20:36:22,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:22,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1107 transitions. [2022-09-20 20:36:22,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.0) internal successors, (1107), 9 states have internal predecessors, (1107), 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-09-20 20:36:22,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 20:36:22,391 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 20:36:22,391 INFO L175 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 9 states and 1107 transitions. [2022-09-20 20:36:22,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 181 transitions, 534 flow [2022-09-20 20:36:22,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 181 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:36:22,396 INFO L231 Difference]: Finished difference. Result has 154 places, 118 transitions, 283 flow [2022-09-20 20:36:22,396 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=154, PETRI_TRANSITIONS=118} [2022-09-20 20:36:22,397 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2022-09-20 20:36:22,397 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 118 transitions, 283 flow [2022-09-20 20:36:22,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-09-20 20:36:22,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:22,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:36:22,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -722609919, now seen corresponding path program 1 times [2022-09-20 20:36:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:22,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401561892] [2022-09-20 20:36:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:22,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401561892] [2022-09-20 20:36:22,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401561892] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:22,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:22,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:36:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447007090] [2022-09-20 20:36:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:22,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:36:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:36:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:36:22,675 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-09-20 20:36:22,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 118 transitions, 283 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 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-09-20 20:36:22,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:22,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-09-20 20:36:22,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:23,084 INFO L130 PetriNetUnfolder]: 795/1672 cut-off events. [2022-09-20 20:36:23,084 INFO L131 PetriNetUnfolder]: For 1318/1329 co-relation queries the response was YES. [2022-09-20 20:36:23,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1672 events. 795/1672 cut-off events. For 1318/1329 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11283 event pairs, 329 based on Foata normal form. 42/1618 useless extension candidates. Maximal degree in co-relation 3761. Up to 691 conditions per place. [2022-09-20 20:36:23,096 INFO L137 encePairwiseOnDemand]: 126/138 looper letters, 20 selfloop transitions, 11 changer transitions 43/173 dead transitions. [2022-09-20 20:36:23,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 173 transitions, 575 flow [2022-09-20 20:36:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:36:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:36:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1673 transitions. [2022-09-20 20:36:23,100 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8659420289855072 [2022-09-20 20:36:23,100 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1673 transitions. [2022-09-20 20:36:23,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1673 transitions. [2022-09-20 20:36:23,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:23,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1673 transitions. [2022-09-20 20:36:23,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 119.5) internal successors, (1673), 14 states have internal predecessors, (1673), 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-09-20 20:36:23,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:23,107 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:23,107 INFO L175 Difference]: Start difference. First operand has 154 places, 118 transitions, 283 flow. Second operand 14 states and 1673 transitions. [2022-09-20 20:36:23,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 173 transitions, 575 flow [2022-09-20 20:36:23,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 173 transitions, 554 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 20:36:23,114 INFO L231 Difference]: Finished difference. Result has 154 places, 126 transitions, 370 flow [2022-09-20 20:36:23,114 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=370, PETRI_PLACES=154, PETRI_TRANSITIONS=126} [2022-09-20 20:36:23,114 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2022-09-20 20:36:23,115 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 126 transitions, 370 flow [2022-09-20 20:36:23,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 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-09-20 20:36:23,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:23,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:23,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:36:23,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 309069792, now seen corresponding path program 1 times [2022-09-20 20:36:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:23,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284946305] [2022-09-20 20:36:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:23,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284946305] [2022-09-20 20:36:23,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284946305] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:23,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:23,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:36:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882272203] [2022-09-20 20:36:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:23,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:36:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:23,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:36:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:36:23,204 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2022-09-20 20:36:23,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 126 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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-09-20 20:36:23,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:23,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2022-09-20 20:36:23,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:23,604 INFO L130 PetriNetUnfolder]: 904/1865 cut-off events. [2022-09-20 20:36:23,604 INFO L131 PetriNetUnfolder]: For 5900/6013 co-relation queries the response was YES. [2022-09-20 20:36:23,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 1865 events. 904/1865 cut-off events. For 5900/6013 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12317 event pairs, 150 based on Foata normal form. 54/1843 useless extension candidates. Maximal degree in co-relation 6271. Up to 607 conditions per place. [2022-09-20 20:36:23,619 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 37 selfloop transitions, 11 changer transitions 14/165 dead transitions. [2022-09-20 20:36:23,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 745 flow [2022-09-20 20:36:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:36:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:36:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1098 transitions. [2022-09-20 20:36:23,622 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2022-09-20 20:36:23,622 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1098 transitions. [2022-09-20 20:36:23,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1098 transitions. [2022-09-20 20:36:23,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:23,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1098 transitions. [2022-09-20 20:36:23,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 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-09-20 20:36:23,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 20:36:23,627 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 20:36:23,627 INFO L175 Difference]: Start difference. First operand has 154 places, 126 transitions, 370 flow. Second operand 9 states and 1098 transitions. [2022-09-20 20:36:23,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 745 flow [2022-09-20 20:36:23,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 729 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-09-20 20:36:23,635 INFO L231 Difference]: Finished difference. Result has 152 places, 135 transitions, 457 flow [2022-09-20 20:36:23,635 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=152, PETRI_TRANSITIONS=135} [2022-09-20 20:36:23,637 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 7 predicate places. [2022-09-20 20:36:23,639 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 135 transitions, 457 flow [2022-09-20 20:36:23,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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-09-20 20:36:23,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:23,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:23,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:36:23,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash -666767064, now seen corresponding path program 1 times [2022-09-20 20:36:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:23,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711546650] [2022-09-20 20:36:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36: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-09-20 20:36:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:23,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711546650] [2022-09-20 20:36:23,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711546650] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:23,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:23,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:36:23,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441072715] [2022-09-20 20:36:23,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:23,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:36:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:36:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:36:23,775 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-09-20 20:36:23,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 135 transitions, 457 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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-09-20 20:36:23,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:23,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-09-20 20:36:23,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:24,298 INFO L130 PetriNetUnfolder]: 1333/2745 cut-off events. [2022-09-20 20:36:24,298 INFO L131 PetriNetUnfolder]: For 9054/9137 co-relation queries the response was YES. [2022-09-20 20:36:24,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9604 conditions, 2745 events. 1333/2745 cut-off events. For 9054/9137 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 19252 event pairs, 271 based on Foata normal form. 26/2672 useless extension candidates. Maximal degree in co-relation 9525. Up to 940 conditions per place. [2022-09-20 20:36:24,318 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 37 selfloop transitions, 10 changer transitions 64/210 dead transitions. [2022-09-20 20:36:24,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 210 transitions, 1207 flow [2022-09-20 20:36:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:36:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:36:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1675 transitions. [2022-09-20 20:36:24,321 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8669772256728778 [2022-09-20 20:36:24,321 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1675 transitions. [2022-09-20 20:36:24,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1675 transitions. [2022-09-20 20:36:24,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:24,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1675 transitions. [2022-09-20 20:36:24,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 119.64285714285714) internal successors, (1675), 14 states have internal predecessors, (1675), 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-09-20 20:36:24,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:24,327 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:24,327 INFO L175 Difference]: Start difference. First operand has 152 places, 135 transitions, 457 flow. Second operand 14 states and 1675 transitions. [2022-09-20 20:36:24,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 210 transitions, 1207 flow [2022-09-20 20:36:24,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 210 transitions, 1207 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 20:36:24,338 INFO L231 Difference]: Finished difference. Result has 176 places, 131 transitions, 478 flow [2022-09-20 20:36:24,338 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=478, PETRI_PLACES=176, PETRI_TRANSITIONS=131} [2022-09-20 20:36:24,338 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 31 predicate places. [2022-09-20 20:36:24,339 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 131 transitions, 478 flow [2022-09-20 20:36:24,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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-09-20 20:36:24,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:24,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:36:24,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1172032610, now seen corresponding path program 2 times [2022-09-20 20:36:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:24,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277072891] [2022-09-20 20:36:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:24,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277072891] [2022-09-20 20:36:24,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277072891] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:24,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:24,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:36:24,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891955701] [2022-09-20 20:36:24,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:24,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:36:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:24,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:36:24,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:36:24,449 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-09-20 20:36:24,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 131 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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-09-20 20:36:24,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:24,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-09-20 20:36:24,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:24,873 INFO L130 PetriNetUnfolder]: 693/1583 cut-off events. [2022-09-20 20:36:24,874 INFO L131 PetriNetUnfolder]: For 11235/11308 co-relation queries the response was YES. [2022-09-20 20:36:24,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7353 conditions, 1583 events. 693/1583 cut-off events. For 11235/11308 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9903 event pairs, 137 based on Foata normal form. 38/1552 useless extension candidates. Maximal degree in co-relation 7260. Up to 547 conditions per place. [2022-09-20 20:36:24,890 INFO L137 encePairwiseOnDemand]: 128/138 looper letters, 38 selfloop transitions, 12 changer transitions 37/186 dead transitions. [2022-09-20 20:36:24,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 186 transitions, 1263 flow [2022-09-20 20:36:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:36:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:36:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1675 transitions. [2022-09-20 20:36:24,893 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8669772256728778 [2022-09-20 20:36:24,893 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1675 transitions. [2022-09-20 20:36:24,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1675 transitions. [2022-09-20 20:36:24,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:24,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1675 transitions. [2022-09-20 20:36:24,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 119.64285714285714) internal successors, (1675), 14 states have internal predecessors, (1675), 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-09-20 20:36:24,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:24,898 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:24,898 INFO L175 Difference]: Start difference. First operand has 176 places, 131 transitions, 478 flow. Second operand 14 states and 1675 transitions. [2022-09-20 20:36:24,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 186 transitions, 1263 flow [2022-09-20 20:36:24,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 186 transitions, 1144 flow, removed 51 selfloop flow, removed 12 redundant places. [2022-09-20 20:36:24,907 INFO L231 Difference]: Finished difference. Result has 172 places, 134 transitions, 544 flow [2022-09-20 20:36:24,908 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=544, PETRI_PLACES=172, PETRI_TRANSITIONS=134} [2022-09-20 20:36:24,908 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 27 predicate places. [2022-09-20 20:36:24,908 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 134 transitions, 544 flow [2022-09-20 20:36:24,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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-09-20 20:36:24,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:24,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:24,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:36:24,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:24,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1251894028, now seen corresponding path program 1 times [2022-09-20 20:36:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:24,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085550084] [2022-09-20 20:36:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:24,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085550084] [2022-09-20 20:36:25,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085550084] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:25,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:25,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:36:25,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949908581] [2022-09-20 20:36:25,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:25,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:36:25,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:25,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:36:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:36:25,067 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:25,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 134 transitions, 544 flow. Second operand has 12 states, 12 states have (on average 113.5) internal successors, (1362), 12 states have internal predecessors, (1362), 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-09-20 20:36:25,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:25,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:25,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:25,461 INFO L130 PetriNetUnfolder]: 572/1325 cut-off events. [2022-09-20 20:36:25,462 INFO L131 PetriNetUnfolder]: For 13112/13460 co-relation queries the response was YES. [2022-09-20 20:36:25,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7007 conditions, 1325 events. 572/1325 cut-off events. For 13112/13460 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8189 event pairs, 132 based on Foata normal form. 28/1298 useless extension candidates. Maximal degree in co-relation 6911. Up to 562 conditions per place. [2022-09-20 20:36:25,479 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 40 selfloop transitions, 14 changer transitions 25/176 dead transitions. [2022-09-20 20:36:25,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 176 transitions, 1242 flow [2022-09-20 20:36:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:36:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:36:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1861 transitions. [2022-09-20 20:36:25,482 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8428442028985508 [2022-09-20 20:36:25,483 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1861 transitions. [2022-09-20 20:36:25,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1861 transitions. [2022-09-20 20:36:25,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:25,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1861 transitions. [2022-09-20 20:36:25,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.3125) internal successors, (1861), 16 states have internal predecessors, (1861), 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-09-20 20:36:25,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-09-20 20:36:25,489 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-09-20 20:36:25,489 INFO L175 Difference]: Start difference. First operand has 172 places, 134 transitions, 544 flow. Second operand 16 states and 1861 transitions. [2022-09-20 20:36:25,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 176 transitions, 1242 flow [2022-09-20 20:36:25,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 176 transitions, 1074 flow, removed 77 selfloop flow, removed 11 redundant places. [2022-09-20 20:36:25,499 INFO L231 Difference]: Finished difference. Result has 177 places, 136 transitions, 594 flow [2022-09-20 20:36:25,499 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=594, PETRI_PLACES=177, PETRI_TRANSITIONS=136} [2022-09-20 20:36:25,500 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 32 predicate places. [2022-09-20 20:36:25,500 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 136 transitions, 594 flow [2022-09-20 20:36:25,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 113.5) internal successors, (1362), 12 states have internal predecessors, (1362), 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-09-20 20:36:25,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:25,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:25,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:36:25,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash 109398897, now seen corresponding path program 1 times [2022-09-20 20:36:25,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:25,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136670897] [2022-09-20 20:36:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:25,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:25,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:25,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136670897] [2022-09-20 20:36:25,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136670897] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:25,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:25,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:36:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478590447] [2022-09-20 20:36:25,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:25,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:36:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:25,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:36:25,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:36:25,712 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 20:36:25,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 136 transitions, 594 flow. Second operand has 13 states, 13 states have (on average 112.38461538461539) internal successors, (1461), 13 states have internal predecessors, (1461), 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-09-20 20:36:25,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:25,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 20:36:25,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:26,202 INFO L130 PetriNetUnfolder]: 647/1463 cut-off events. [2022-09-20 20:36:26,202 INFO L131 PetriNetUnfolder]: For 15770/16085 co-relation queries the response was YES. [2022-09-20 20:36:26,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7677 conditions, 1463 events. 647/1463 cut-off events. For 15770/16085 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8944 event pairs, 166 based on Foata normal form. 48/1427 useless extension candidates. Maximal degree in co-relation 7576. Up to 563 conditions per place. [2022-09-20 20:36:26,221 INFO L137 encePairwiseOnDemand]: 124/138 looper letters, 32 selfloop transitions, 16 changer transitions 48/192 dead transitions. [2022-09-20 20:36:26,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 192 transitions, 1468 flow [2022-09-20 20:36:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 20:36:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 20:36:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2075 transitions. [2022-09-20 20:36:26,225 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8353462157809984 [2022-09-20 20:36:26,225 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2075 transitions. [2022-09-20 20:36:26,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2075 transitions. [2022-09-20 20:36:26,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:26,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2075 transitions. [2022-09-20 20:36:26,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 115.27777777777777) internal successors, (2075), 18 states have internal predecessors, (2075), 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-09-20 20:36:26,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 138.0) internal successors, (2622), 19 states have internal predecessors, (2622), 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-09-20 20:36:26,232 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 138.0) internal successors, (2622), 19 states have internal predecessors, (2622), 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-09-20 20:36:26,232 INFO L175 Difference]: Start difference. First operand has 177 places, 136 transitions, 594 flow. Second operand 18 states and 2075 transitions. [2022-09-20 20:36:26,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 192 transitions, 1468 flow [2022-09-20 20:36:26,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 192 transitions, 1312 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-09-20 20:36:26,245 INFO L231 Difference]: Finished difference. Result has 183 places, 139 transitions, 680 flow [2022-09-20 20:36:26,246 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=680, PETRI_PLACES=183, PETRI_TRANSITIONS=139} [2022-09-20 20:36:26,246 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 38 predicate places. [2022-09-20 20:36:26,246 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 139 transitions, 680 flow [2022-09-20 20:36:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 112.38461538461539) internal successors, (1461), 13 states have internal predecessors, (1461), 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-09-20 20:36:26,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:26,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:26,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:36:26,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash -311989988, now seen corresponding path program 1 times [2022-09-20 20:36:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:26,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716590389] [2022-09-20 20:36:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:26,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716590389] [2022-09-20 20:36:26,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716590389] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:26,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:26,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:36:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083506455] [2022-09-20 20:36:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:26,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:36:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:36:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:36:26,349 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-09-20 20:36:26,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 139 transitions, 680 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-09-20 20:36:26,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:26,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-09-20 20:36:26,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:26,780 INFO L130 PetriNetUnfolder]: 614/1365 cut-off events. [2022-09-20 20:36:26,781 INFO L131 PetriNetUnfolder]: For 18095/18652 co-relation queries the response was YES. [2022-09-20 20:36:26,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8430 conditions, 1365 events. 614/1365 cut-off events. For 18095/18652 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8212 event pairs, 118 based on Foata normal form. 36/1349 useless extension candidates. Maximal degree in co-relation 8327. Up to 611 conditions per place. [2022-09-20 20:36:26,796 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 38 selfloop transitions, 18 changer transitions 25/180 dead transitions. [2022-09-20 20:36:26,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 1456 flow [2022-09-20 20:36:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:36:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:36:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1317 transitions. [2022-09-20 20:36:26,798 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8675889328063241 [2022-09-20 20:36:26,798 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1317 transitions. [2022-09-20 20:36:26,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1317 transitions. [2022-09-20 20:36:26,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:26,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1317 transitions. [2022-09-20 20:36:26,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.72727272727273) internal successors, (1317), 11 states have internal predecessors, (1317), 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-09-20 20:36:26,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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-09-20 20:36:26,803 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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-09-20 20:36:26,803 INFO L175 Difference]: Start difference. First operand has 183 places, 139 transitions, 680 flow. Second operand 11 states and 1317 transitions. [2022-09-20 20:36:26,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 1456 flow [2022-09-20 20:36:26,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 180 transitions, 1337 flow, removed 50 selfloop flow, removed 12 redundant places. [2022-09-20 20:36:26,818 INFO L231 Difference]: Finished difference. Result has 180 places, 147 transitions, 803 flow [2022-09-20 20:36:26,818 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=803, PETRI_PLACES=180, PETRI_TRANSITIONS=147} [2022-09-20 20:36:26,818 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 35 predicate places. [2022-09-20 20:36:26,818 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 147 transitions, 803 flow [2022-09-20 20:36:26,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-09-20 20:36:26,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:26,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:36:26,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 597741338, now seen corresponding path program 2 times [2022-09-20 20:36:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:26,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103504288] [2022-09-20 20:36:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:26,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103504288] [2022-09-20 20:36:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103504288] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:26,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:26,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:36:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631973110] [2022-09-20 20:36:26,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:26,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:36:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:36:26,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:36:26,944 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:26,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 147 transitions, 803 flow. Second operand has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 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-09-20 20:36:26,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:26,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:26,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:27,293 INFO L130 PetriNetUnfolder]: 615/1440 cut-off events. [2022-09-20 20:36:27,293 INFO L131 PetriNetUnfolder]: For 21528/21859 co-relation queries the response was YES. [2022-09-20 20:36:27,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9075 conditions, 1440 events. 615/1440 cut-off events. For 21528/21859 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8720 event pairs, 118 based on Foata normal form. 73/1451 useless extension candidates. Maximal degree in co-relation 8972. Up to 630 conditions per place. [2022-09-20 20:36:27,310 INFO L137 encePairwiseOnDemand]: 125/138 looper letters, 46 selfloop transitions, 22 changer transitions 13/178 dead transitions. [2022-09-20 20:36:27,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 178 transitions, 1442 flow [2022-09-20 20:36:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:36:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:36:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1176 transitions. [2022-09-20 20:36:27,312 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8521739130434782 [2022-09-20 20:36:27,312 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1176 transitions. [2022-09-20 20:36:27,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1176 transitions. [2022-09-20 20:36:27,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:27,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1176 transitions. [2022-09-20 20:36:27,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.6) internal successors, (1176), 10 states have internal predecessors, (1176), 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-09-20 20:36:27,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-09-20 20:36:27,315 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-09-20 20:36:27,315 INFO L175 Difference]: Start difference. First operand has 180 places, 147 transitions, 803 flow. Second operand 10 states and 1176 transitions. [2022-09-20 20:36:27,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 178 transitions, 1442 flow [2022-09-20 20:36:27,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 178 transitions, 1253 flow, removed 94 selfloop flow, removed 10 redundant places. [2022-09-20 20:36:27,336 INFO L231 Difference]: Finished difference. Result has 177 places, 154 transitions, 868 flow [2022-09-20 20:36:27,336 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=868, PETRI_PLACES=177, PETRI_TRANSITIONS=154} [2022-09-20 20:36:27,337 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 32 predicate places. [2022-09-20 20:36:27,337 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 154 transitions, 868 flow [2022-09-20 20:36:27,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 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-09-20 20:36:27,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:27,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:36:27,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:27,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 583997791, now seen corresponding path program 1 times [2022-09-20 20:36:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:27,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554569582] [2022-09-20 20:36:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:27,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:27,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554569582] [2022-09-20 20:36:27,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554569582] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:27,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:27,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:36:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720068718] [2022-09-20 20:36:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:36:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:36:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:36:27,499 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 20:36:27,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 154 transitions, 868 flow. Second operand has 13 states, 13 states have (on average 112.46153846153847) internal successors, (1462), 13 states have internal predecessors, (1462), 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-09-20 20:36:27,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:27,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 20:36:27,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:27,942 INFO L130 PetriNetUnfolder]: 549/1328 cut-off events. [2022-09-20 20:36:27,943 INFO L131 PetriNetUnfolder]: For 16463/16781 co-relation queries the response was YES. [2022-09-20 20:36:27,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7675 conditions, 1328 events. 549/1328 cut-off events. For 16463/16781 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7934 event pairs, 110 based on Foata normal form. 43/1307 useless extension candidates. Maximal degree in co-relation 7573. Up to 636 conditions per place. [2022-09-20 20:36:27,955 INFO L137 encePairwiseOnDemand]: 126/138 looper letters, 53 selfloop transitions, 17 changer transitions 25/191 dead transitions. [2022-09-20 20:36:27,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 191 transitions, 1526 flow [2022-09-20 20:36:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:36:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:36:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1952 transitions. [2022-09-20 20:36:27,958 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8320545609548167 [2022-09-20 20:36:27,958 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1952 transitions. [2022-09-20 20:36:27,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1952 transitions. [2022-09-20 20:36:27,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:27,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1952 transitions. [2022-09-20 20:36:27,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 114.82352941176471) internal successors, (1952), 17 states have internal predecessors, (1952), 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-09-20 20:36:27,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 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-09-20 20:36:27,963 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 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-09-20 20:36:27,963 INFO L175 Difference]: Start difference. First operand has 177 places, 154 transitions, 868 flow. Second operand 17 states and 1952 transitions. [2022-09-20 20:36:27,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 191 transitions, 1526 flow [2022-09-20 20:36:27,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 191 transitions, 1399 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-09-20 20:36:27,979 INFO L231 Difference]: Finished difference. Result has 192 places, 156 transitions, 873 flow [2022-09-20 20:36:27,979 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=873, PETRI_PLACES=192, PETRI_TRANSITIONS=156} [2022-09-20 20:36:27,980 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 47 predicate places. [2022-09-20 20:36:27,980 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 156 transitions, 873 flow [2022-09-20 20:36:27,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 112.46153846153847) internal successors, (1462), 13 states have internal predecessors, (1462), 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-09-20 20:36:27,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:27,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:27,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:36:27,980 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 861504438, now seen corresponding path program 3 times [2022-09-20 20:36:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:27,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733584542] [2022-09-20 20:36:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:28,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733584542] [2022-09-20 20:36:28,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733584542] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:28,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:28,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:36:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051663313] [2022-09-20 20:36:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:28,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:36:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:36:28,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:36:28,103 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 20:36:28,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 156 transitions, 873 flow. Second operand has 10 states, 10 states have (on average 112.9) internal successors, (1129), 10 states have internal predecessors, (1129), 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-09-20 20:36:28,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:28,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 20:36:28,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:28,529 INFO L130 PetriNetUnfolder]: 602/1470 cut-off events. [2022-09-20 20:36:28,529 INFO L131 PetriNetUnfolder]: For 23069/23392 co-relation queries the response was YES. [2022-09-20 20:36:28,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9322 conditions, 1470 events. 602/1470 cut-off events. For 23069/23392 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9258 event pairs, 110 based on Foata normal form. 36/1440 useless extension candidates. Maximal degree in co-relation 9211. Up to 505 conditions per place. [2022-09-20 20:36:28,545 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 56 selfloop transitions, 18 changer transitions 26/196 dead transitions. [2022-09-20 20:36:28,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 196 transitions, 1787 flow [2022-09-20 20:36:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:36:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:36:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1400 transitions. [2022-09-20 20:36:28,548 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8454106280193237 [2022-09-20 20:36:28,548 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1400 transitions. [2022-09-20 20:36:28,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1400 transitions. [2022-09-20 20:36:28,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:28,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1400 transitions. [2022-09-20 20:36:28,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.66666666666667) internal successors, (1400), 12 states have internal predecessors, (1400), 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-09-20 20:36:28,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-09-20 20:36:28,551 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-09-20 20:36:28,551 INFO L175 Difference]: Start difference. First operand has 192 places, 156 transitions, 873 flow. Second operand 12 states and 1400 transitions. [2022-09-20 20:36:28,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 196 transitions, 1787 flow [2022-09-20 20:36:28,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 196 transitions, 1625 flow, removed 73 selfloop flow, removed 14 redundant places. [2022-09-20 20:36:28,573 INFO L231 Difference]: Finished difference. Result has 187 places, 158 transitions, 943 flow [2022-09-20 20:36:28,573 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=943, PETRI_PLACES=187, PETRI_TRANSITIONS=158} [2022-09-20 20:36:28,574 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 42 predicate places. [2022-09-20 20:36:28,574 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 158 transitions, 943 flow [2022-09-20 20:36:28,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.9) internal successors, (1129), 10 states have internal predecessors, (1129), 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-09-20 20:36:28,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:28,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:28,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:36:28,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1438111518, now seen corresponding path program 1 times [2022-09-20 20:36:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:28,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183731820] [2022-09-20 20:36:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:28,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:28,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183731820] [2022-09-20 20:36:28,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183731820] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:28,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:28,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:36:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196326979] [2022-09-20 20:36:28,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:28,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:36:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:36:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:36:28,736 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-09-20 20:36:28,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 158 transitions, 943 flow. Second operand has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 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-09-20 20:36:28,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:28,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-09-20 20:36:28,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:29,165 INFO L130 PetriNetUnfolder]: 510/1285 cut-off events. [2022-09-20 20:36:29,165 INFO L131 PetriNetUnfolder]: For 25432/26006 co-relation queries the response was YES. [2022-09-20 20:36:29,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8657 conditions, 1285 events. 510/1285 cut-off events. For 25432/26006 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7859 event pairs, 76 based on Foata normal form. 67/1291 useless extension candidates. Maximal degree in co-relation 8549. Up to 576 conditions per place. [2022-09-20 20:36:29,180 INFO L137 encePairwiseOnDemand]: 125/138 looper letters, 55 selfloop transitions, 24 changer transitions 19/193 dead transitions. [2022-09-20 20:36:29,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 193 transitions, 1784 flow [2022-09-20 20:36:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:36:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:36:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1605 transitions. [2022-09-20 20:36:29,182 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8307453416149069 [2022-09-20 20:36:29,182 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1605 transitions. [2022-09-20 20:36:29,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1605 transitions. [2022-09-20 20:36:29,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:29,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1605 transitions. [2022-09-20 20:36:29,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.64285714285714) internal successors, (1605), 14 states have internal predecessors, (1605), 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-09-20 20:36:29,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:29,186 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-09-20 20:36:29,186 INFO L175 Difference]: Start difference. First operand has 187 places, 158 transitions, 943 flow. Second operand 14 states and 1605 transitions. [2022-09-20 20:36:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 193 transitions, 1784 flow [2022-09-20 20:36:29,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 193 transitions, 1709 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-09-20 20:36:29,205 INFO L231 Difference]: Finished difference. Result has 195 places, 163 transitions, 1069 flow [2022-09-20 20:36:29,206 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1069, PETRI_PLACES=195, PETRI_TRANSITIONS=163} [2022-09-20 20:36:29,206 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 50 predicate places. [2022-09-20 20:36:29,206 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 163 transitions, 1069 flow [2022-09-20 20:36:29,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 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-09-20 20:36:29,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:29,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:29,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 20:36:29,207 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1222344982, now seen corresponding path program 2 times [2022-09-20 20:36:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:29,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450519253] [2022-09-20 20:36:29,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:29,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450519253] [2022-09-20 20:36:29,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450519253] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:29,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:29,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-09-20 20:36:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401092660] [2022-09-20 20:36:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 20:36:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 20:36:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-09-20 20:36:29,413 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-09-20 20:36:29,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 163 transitions, 1069 flow. Second operand has 14 states, 14 states have (on average 111.5) internal successors, (1561), 14 states have internal predecessors, (1561), 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-09-20 20:36:29,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:29,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-09-20 20:36:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:30,025 INFO L130 PetriNetUnfolder]: 554/1436 cut-off events. [2022-09-20 20:36:30,025 INFO L131 PetriNetUnfolder]: For 38196/39120 co-relation queries the response was YES. [2022-09-20 20:36:30,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10491 conditions, 1436 events. 554/1436 cut-off events. For 38196/39120 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9122 event pairs, 82 based on Foata normal form. 73/1435 useless extension candidates. Maximal degree in co-relation 10377. Up to 612 conditions per place. [2022-09-20 20:36:30,041 INFO L137 encePairwiseOnDemand]: 123/138 looper letters, 52 selfloop transitions, 28 changer transitions 26/201 dead transitions. [2022-09-20 20:36:30,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 2116 flow [2022-09-20 20:36:30,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 20:36:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 20:36:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2047 transitions. [2022-09-20 20:36:30,044 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-09-20 20:36:30,044 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2047 transitions. [2022-09-20 20:36:30,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2047 transitions. [2022-09-20 20:36:30,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:30,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2047 transitions. [2022-09-20 20:36:30,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 113.72222222222223) internal successors, (2047), 18 states have internal predecessors, (2047), 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-09-20 20:36:30,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 138.0) internal successors, (2622), 19 states have internal predecessors, (2622), 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-09-20 20:36:30,049 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 138.0) internal successors, (2622), 19 states have internal predecessors, (2622), 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-09-20 20:36:30,049 INFO L175 Difference]: Start difference. First operand has 195 places, 163 transitions, 1069 flow. Second operand 18 states and 2047 transitions. [2022-09-20 20:36:30,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 2116 flow [2022-09-20 20:36:30,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 201 transitions, 1865 flow, removed 110 selfloop flow, removed 11 redundant places. [2022-09-20 20:36:30,076 INFO L231 Difference]: Finished difference. Result has 206 places, 169 transitions, 1212 flow [2022-09-20 20:36:30,076 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1212, PETRI_PLACES=206, PETRI_TRANSITIONS=169} [2022-09-20 20:36:30,077 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 61 predicate places. [2022-09-20 20:36:30,077 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 169 transitions, 1212 flow [2022-09-20 20:36:30,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 111.5) internal successors, (1561), 14 states have internal predecessors, (1561), 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-09-20 20:36:30,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:30,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:30,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 20:36:30,077 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash -274858860, now seen corresponding path program 3 times [2022-09-20 20:36:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:30,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507206338] [2022-09-20 20:36:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:30,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:30,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507206338] [2022-09-20 20:36:30,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507206338] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:30,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:30,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:36:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205068598] [2022-09-20 20:36:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:30,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:36:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:36:30,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:36:30,288 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:30,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 169 transitions, 1212 flow. Second operand has 13 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 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-09-20 20:36:30,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:30,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:30,717 INFO L130 PetriNetUnfolder]: 549/1424 cut-off events. [2022-09-20 20:36:30,717 INFO L131 PetriNetUnfolder]: For 36384/37787 co-relation queries the response was YES. [2022-09-20 20:36:30,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10577 conditions, 1424 events. 549/1424 cut-off events. For 36384/37787 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9190 event pairs, 68 based on Foata normal form. 109/1476 useless extension candidates. Maximal degree in co-relation 10459. Up to 582 conditions per place. [2022-09-20 20:36:30,735 INFO L137 encePairwiseOnDemand]: 124/138 looper letters, 53 selfloop transitions, 31 changer transitions 25/206 dead transitions. [2022-09-20 20:36:30,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 2318 flow [2022-09-20 20:36:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:36:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:36:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1749 transitions. [2022-09-20 20:36:30,737 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8449275362318841 [2022-09-20 20:36:30,737 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1749 transitions. [2022-09-20 20:36:30,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1749 transitions. [2022-09-20 20:36:30,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:30,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1749 transitions. [2022-09-20 20:36:30,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.6) internal successors, (1749), 15 states have internal predecessors, (1749), 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-09-20 20:36:30,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 138.0) internal successors, (2208), 16 states have internal predecessors, (2208), 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-09-20 20:36:30,742 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 138.0) internal successors, (2208), 16 states have internal predecessors, (2208), 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-09-20 20:36:30,742 INFO L175 Difference]: Start difference. First operand has 206 places, 169 transitions, 1212 flow. Second operand 15 states and 1749 transitions. [2022-09-20 20:36:30,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 2318 flow [2022-09-20 20:36:30,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 206 transitions, 2099 flow, removed 95 selfloop flow, removed 18 redundant places. [2022-09-20 20:36:30,780 INFO L231 Difference]: Finished difference. Result has 200 places, 171 transitions, 1247 flow [2022-09-20 20:36:30,780 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1247, PETRI_PLACES=200, PETRI_TRANSITIONS=171} [2022-09-20 20:36:30,780 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 55 predicate places. [2022-09-20 20:36:30,780 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 171 transitions, 1247 flow [2022-09-20 20:36:30,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 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-09-20 20:36:30,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:30,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:30,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 20:36:30,781 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash 544536768, now seen corresponding path program 4 times [2022-09-20 20:36:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:30,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475407870] [2022-09-20 20:36:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:30,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475407870] [2022-09-20 20:36:30,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475407870] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:30,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:30,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:36:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897418689] [2022-09-20 20:36:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:30,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:36:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:36:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:36:30,919 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:30,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 171 transitions, 1247 flow. Second operand has 11 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 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-09-20 20:36:30,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:30,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:30,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:31,419 INFO L130 PetriNetUnfolder]: 522/1638 cut-off events. [2022-09-20 20:36:31,419 INFO L131 PetriNetUnfolder]: For 40587/41113 co-relation queries the response was YES. [2022-09-20 20:36:31,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 1638 events. 522/1638 cut-off events. For 40587/41113 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11717 event pairs, 48 based on Foata normal form. 93/1664 useless extension candidates. Maximal degree in co-relation 10848. Up to 449 conditions per place. [2022-09-20 20:36:31,440 INFO L137 encePairwiseOnDemand]: 124/138 looper letters, 51 selfloop transitions, 44 changer transitions 19/211 dead transitions. [2022-09-20 20:36:31,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 211 transitions, 2343 flow [2022-09-20 20:36:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:36:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:36:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1980 transitions. [2022-09-20 20:36:31,442 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8439897698209718 [2022-09-20 20:36:31,443 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1980 transitions. [2022-09-20 20:36:31,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1980 transitions. [2022-09-20 20:36:31,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:31,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1980 transitions. [2022-09-20 20:36:31,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 116.47058823529412) internal successors, (1980), 17 states have internal predecessors, (1980), 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-09-20 20:36:31,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 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-09-20 20:36:31,448 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 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-09-20 20:36:31,449 INFO L175 Difference]: Start difference. First operand has 200 places, 171 transitions, 1247 flow. Second operand 17 states and 1980 transitions. [2022-09-20 20:36:31,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 211 transitions, 2343 flow [2022-09-20 20:36:31,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 211 transitions, 2084 flow, removed 102 selfloop flow, removed 14 redundant places. [2022-09-20 20:36:31,482 INFO L231 Difference]: Finished difference. Result has 203 places, 173 transitions, 1353 flow [2022-09-20 20:36:31,482 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1353, PETRI_PLACES=203, PETRI_TRANSITIONS=173} [2022-09-20 20:36:31,482 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 58 predicate places. [2022-09-20 20:36:31,483 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 173 transitions, 1353 flow [2022-09-20 20:36:31,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 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-09-20 20:36:31,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:31,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:31,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 20:36:31,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 626058526, now seen corresponding path program 1 times [2022-09-20 20:36:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587176842] [2022-09-20 20:36:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587176842] [2022-09-20 20:36:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587176842] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:31,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:31,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:36:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078321097] [2022-09-20 20:36:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:31,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:36:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:36:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:36:31,567 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:31,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 173 transitions, 1353 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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-09-20 20:36:31,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:31,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:31,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:33,542 INFO L130 PetriNetUnfolder]: 7890/13915 cut-off events. [2022-09-20 20:36:33,543 INFO L131 PetriNetUnfolder]: For 357667/360281 co-relation queries the response was YES. [2022-09-20 20:36:33,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79248 conditions, 13915 events. 7890/13915 cut-off events. For 357667/360281 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 114710 event pairs, 291 based on Foata normal form. 612/14066 useless extension candidates. Maximal degree in co-relation 79140. Up to 4958 conditions per place. [2022-09-20 20:36:33,680 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 302 selfloop transitions, 20 changer transitions 15/437 dead transitions. [2022-09-20 20:36:33,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 437 transitions, 6264 flow [2022-09-20 20:36:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:36:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:36:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1212 transitions. [2022-09-20 20:36:33,683 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8782608695652174 [2022-09-20 20:36:33,683 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1212 transitions. [2022-09-20 20:36:33,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1212 transitions. [2022-09-20 20:36:33,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:33,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1212 transitions. [2022-09-20 20:36:33,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.2) internal successors, (1212), 10 states have internal predecessors, (1212), 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-09-20 20:36:33,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-09-20 20:36:33,686 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-09-20 20:36:33,686 INFO L175 Difference]: Start difference. First operand has 203 places, 173 transitions, 1353 flow. Second operand 10 states and 1212 transitions. [2022-09-20 20:36:33,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 437 transitions, 6264 flow [2022-09-20 20:36:33,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 437 transitions, 5882 flow, removed 103 selfloop flow, removed 14 redundant places. [2022-09-20 20:36:33,913 INFO L231 Difference]: Finished difference. Result has 198 places, 191 transitions, 1415 flow [2022-09-20 20:36:33,914 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1415, PETRI_PLACES=198, PETRI_TRANSITIONS=191} [2022-09-20 20:36:33,914 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 53 predicate places. [2022-09-20 20:36:33,914 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 191 transitions, 1415 flow [2022-09-20 20:36:33,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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-09-20 20:36:33,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:33,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:33,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 20:36:33,914 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 877085541, now seen corresponding path program 1 times [2022-09-20 20:36:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:33,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525547952] [2022-09-20 20:36:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525547952] [2022-09-20 20:36:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525547952] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:36:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736046890] [2022-09-20 20:36:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:34,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:36:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:36:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:36:34,046 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-09-20 20:36:34,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 191 transitions, 1415 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-09-20 20:36:34,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:34,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-09-20 20:36:34,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:35,526 INFO L130 PetriNetUnfolder]: 3000/8595 cut-off events. [2022-09-20 20:36:35,526 INFO L131 PetriNetUnfolder]: For 110431/117995 co-relation queries the response was YES. [2022-09-20 20:36:35,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44031 conditions, 8595 events. 3000/8595 cut-off events. For 110431/117995 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 94351 event pairs, 811 based on Foata normal form. 336/8221 useless extension candidates. Maximal degree in co-relation 43924. Up to 1778 conditions per place. [2022-09-20 20:36:35,622 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 168 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2022-09-20 20:36:35,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 294 transitions, 3555 flow [2022-09-20 20:36:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:36:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:36:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2022-09-20 20:36:35,623 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8737060041407867 [2022-09-20 20:36:35,623 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2022-09-20 20:36:35,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2022-09-20 20:36:35,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:35,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2022-09-20 20:36:35,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 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-09-20 20:36:35,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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-09-20 20:36:35,625 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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-09-20 20:36:35,625 INFO L175 Difference]: Start difference. First operand has 198 places, 191 transitions, 1415 flow. Second operand 7 states and 844 transitions. [2022-09-20 20:36:35,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 294 transitions, 3555 flow [2022-09-20 20:36:35,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 294 transitions, 3543 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-09-20 20:36:35,708 INFO L231 Difference]: Finished difference. Result has 208 places, 195 transitions, 1494 flow [2022-09-20 20:36:35,708 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1494, PETRI_PLACES=208, PETRI_TRANSITIONS=195} [2022-09-20 20:36:35,709 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 63 predicate places. [2022-09-20 20:36:35,709 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 195 transitions, 1494 flow [2022-09-20 20:36:35,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-09-20 20:36:35,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:35,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:35,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-20 20:36:35,709 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 593412373, now seen corresponding path program 2 times [2022-09-20 20:36:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:35,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051505901] [2022-09-20 20:36:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:35,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-09-20 20:36:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:35,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051505901] [2022-09-20 20:36:35,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051505901] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:35,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:35,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:36:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428824071] [2022-09-20 20:36:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:35,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:36:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:35,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:36:35,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:36:35,775 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:35,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 195 transitions, 1494 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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-09-20 20:36:35,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:35,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:35,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:39,608 INFO L130 PetriNetUnfolder]: 11736/21947 cut-off events. [2022-09-20 20:36:39,609 INFO L131 PetriNetUnfolder]: For 537938/547034 co-relation queries the response was YES. [2022-09-20 20:36:39,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136212 conditions, 21947 events. 11736/21947 cut-off events. For 537938/547034 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 208252 event pairs, 346 based on Foata normal form. 1729/22946 useless extension candidates. Maximal degree in co-relation 136101. Up to 5751 conditions per place. [2022-09-20 20:36:39,800 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 302 selfloop transitions, 38 changer transitions 85/526 dead transitions. [2022-09-20 20:36:39,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 526 transitions, 7733 flow [2022-09-20 20:36:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:36:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:36:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1579 transitions. [2022-09-20 20:36:39,820 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8801560758082497 [2022-09-20 20:36:39,820 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1579 transitions. [2022-09-20 20:36:39,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1579 transitions. [2022-09-20 20:36:39,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:39,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1579 transitions. [2022-09-20 20:36:39,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.46153846153847) internal successors, (1579), 13 states have internal predecessors, (1579), 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-09-20 20:36:39,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 20:36:39,823 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 20:36:39,823 INFO L175 Difference]: Start difference. First operand has 208 places, 195 transitions, 1494 flow. Second operand 13 states and 1579 transitions. [2022-09-20 20:36:39,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 526 transitions, 7733 flow [2022-09-20 20:36:40,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 526 transitions, 7728 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-09-20 20:36:40,357 INFO L231 Difference]: Finished difference. Result has 225 places, 198 transitions, 1544 flow [2022-09-20 20:36:40,357 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1544, PETRI_PLACES=225, PETRI_TRANSITIONS=198} [2022-09-20 20:36:40,357 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 80 predicate places. [2022-09-20 20:36:40,357 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 198 transitions, 1544 flow [2022-09-20 20:36:40,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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-09-20 20:36:40,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:40,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:40,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-20 20:36:40,358 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -613325920, now seen corresponding path program 1 times [2022-09-20 20:36:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431010351] [2022-09-20 20:36:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:40,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431010351] [2022-09-20 20:36:40,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431010351] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:40,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:40,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:36:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465646013] [2022-09-20 20:36:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:40,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:36:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:36:40,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:36:40,415 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2022-09-20 20:36:40,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 198 transitions, 1544 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-09-20 20:36:40,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:40,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2022-09-20 20:36:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:42,773 INFO L130 PetriNetUnfolder]: 4060/14074 cut-off events. [2022-09-20 20:36:42,774 INFO L131 PetriNetUnfolder]: For 121586/141269 co-relation queries the response was YES. [2022-09-20 20:36:42,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62883 conditions, 14074 events. 4060/14074 cut-off events. For 121586/141269 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 186074 event pairs, 521 based on Foata normal form. 368/13390 useless extension candidates. Maximal degree in co-relation 62764. Up to 4122 conditions per place. [2022-09-20 20:36:42,930 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 103 selfloop transitions, 11 changer transitions 48/304 dead transitions. [2022-09-20 20:36:42,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 304 transitions, 4009 flow [2022-09-20 20:36:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:36:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:36:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1096 transitions. [2022-09-20 20:36:42,932 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8824476650563607 [2022-09-20 20:36:42,932 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1096 transitions. [2022-09-20 20:36:42,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1096 transitions. [2022-09-20 20:36:42,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:42,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1096 transitions. [2022-09-20 20:36:42,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.77777777777777) internal successors, (1096), 9 states have internal predecessors, (1096), 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-09-20 20:36:42,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 20:36:42,934 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 20:36:42,934 INFO L175 Difference]: Start difference. First operand has 225 places, 198 transitions, 1544 flow. Second operand 9 states and 1096 transitions. [2022-09-20 20:36:42,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 304 transitions, 4009 flow [2022-09-20 20:36:43,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 304 transitions, 3783 flow, removed 82 selfloop flow, removed 11 redundant places. [2022-09-20 20:36:43,807 INFO L231 Difference]: Finished difference. Result has 226 places, 206 transitions, 1557 flow [2022-09-20 20:36:43,807 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1557, PETRI_PLACES=226, PETRI_TRANSITIONS=206} [2022-09-20 20:36:43,808 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 81 predicate places. [2022-09-20 20:36:43,808 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 206 transitions, 1557 flow [2022-09-20 20:36:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-09-20 20:36:43,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:43,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:43,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-20 20:36:43,808 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash -727031149, now seen corresponding path program 1 times [2022-09-20 20:36:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:43,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140168103] [2022-09-20 20:36:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:43,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:43,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140168103] [2022-09-20 20:36:43,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140168103] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:43,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:43,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:36:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134343129] [2022-09-20 20:36:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:43,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:36:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:36:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:36:43,893 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:43,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 206 transitions, 1557 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 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-09-20 20:36:43,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:43,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:49,197 INFO L130 PetriNetUnfolder]: 15986/30379 cut-off events. [2022-09-20 20:36:49,197 INFO L131 PetriNetUnfolder]: For 707182/716124 co-relation queries the response was YES. [2022-09-20 20:36:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187357 conditions, 30379 events. 15986/30379 cut-off events. For 707182/716124 co-relation queries the response was YES. Maximal size of possible extension queue 2463. Compared 317351 event pairs, 115 based on Foata normal form. 2150/31379 useless extension candidates. Maximal degree in co-relation 187237. Up to 7313 conditions per place. [2022-09-20 20:36:49,529 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 90 selfloop transitions, 15 changer transitions 351/555 dead transitions. [2022-09-20 20:36:49,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 555 transitions, 8288 flow [2022-09-20 20:36:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:36:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:36:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1944 transitions. [2022-09-20 20:36:49,531 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8804347826086957 [2022-09-20 20:36:49,532 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1944 transitions. [2022-09-20 20:36:49,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1944 transitions. [2022-09-20 20:36:49,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:49,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1944 transitions. [2022-09-20 20:36:49,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.5) internal successors, (1944), 16 states have internal predecessors, (1944), 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-09-20 20:36:49,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-09-20 20:36:49,536 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-09-20 20:36:49,536 INFO L175 Difference]: Start difference. First operand has 226 places, 206 transitions, 1557 flow. Second operand 16 states and 1944 transitions. [2022-09-20 20:36:49,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 555 transitions, 8288 flow [2022-09-20 20:36:51,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 555 transitions, 8099 flow, removed 84 selfloop flow, removed 2 redundant places. [2022-09-20 20:36:51,607 INFO L231 Difference]: Finished difference. Result has 245 places, 150 transitions, 1072 flow [2022-09-20 20:36:51,608 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1072, PETRI_PLACES=245, PETRI_TRANSITIONS=150} [2022-09-20 20:36:51,608 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 100 predicate places. [2022-09-20 20:36:51,608 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 150 transitions, 1072 flow [2022-09-20 20:36:51,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 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-09-20 20:36:51,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:51,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:51,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-20 20:36:51,609 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1313815258, now seen corresponding path program 1 times [2022-09-20 20:36:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:51,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631124401] [2022-09-20 20:36:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631124401] [2022-09-20 20:36:51,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631124401] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:51,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:51,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:36:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84532820] [2022-09-20 20:36:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:51,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:36:51,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:36:51,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:36:51,694 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-09-20 20:36:51,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 150 transitions, 1072 flow. Second operand has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:36:51,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:51,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-09-20 20:36:51,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:52,333 INFO L130 PetriNetUnfolder]: 1146/3107 cut-off events. [2022-09-20 20:36:52,334 INFO L131 PetriNetUnfolder]: For 67328/68207 co-relation queries the response was YES. [2022-09-20 20:36:52,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18829 conditions, 3107 events. 1146/3107 cut-off events. For 67328/68207 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 26703 event pairs, 20 based on Foata normal form. 154/3145 useless extension candidates. Maximal degree in co-relation 18761. Up to 645 conditions per place. [2022-09-20 20:36:52,353 INFO L137 encePairwiseOnDemand]: 128/138 looper letters, 76 selfloop transitions, 19 changer transitions 29/223 dead transitions. [2022-09-20 20:36:52,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 223 transitions, 2755 flow [2022-09-20 20:36:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:36:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:36:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1417 transitions. [2022-09-20 20:36:52,355 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8556763285024155 [2022-09-20 20:36:52,355 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1417 transitions. [2022-09-20 20:36:52,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1417 transitions. [2022-09-20 20:36:52,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:52,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1417 transitions. [2022-09-20 20:36:52,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.08333333333333) internal successors, (1417), 12 states have internal predecessors, (1417), 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-09-20 20:36:52,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-09-20 20:36:52,358 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-09-20 20:36:52,358 INFO L175 Difference]: Start difference. First operand has 245 places, 150 transitions, 1072 flow. Second operand 12 states and 1417 transitions. [2022-09-20 20:36:52,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 223 transitions, 2755 flow [2022-09-20 20:36:52,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 223 transitions, 1858 flow, removed 337 selfloop flow, removed 46 redundant places. [2022-09-20 20:36:52,469 INFO L231 Difference]: Finished difference. Result has 190 places, 149 transitions, 734 flow [2022-09-20 20:36:52,469 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=734, PETRI_PLACES=190, PETRI_TRANSITIONS=149} [2022-09-20 20:36:52,469 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 45 predicate places. [2022-09-20 20:36:52,469 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 149 transitions, 734 flow [2022-09-20 20:36:52,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:36:52,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:52,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:52,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-20 20:36:52,470 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 610321824, now seen corresponding path program 1 times [2022-09-20 20:36:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:52,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167309245] [2022-09-20 20:36:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:36:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:36:52,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:36:52,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167309245] [2022-09-20 20:36:52,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167309245] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:36:52,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:36:52,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:36:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535066866] [2022-09-20 20:36:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:36:52,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:36:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:36:52,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:36:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:36:52,545 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-09-20 20:36:52,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 149 transitions, 734 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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-09-20 20:36:52,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:36:52,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-09-20 20:36:52,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:36:52,919 INFO L130 PetriNetUnfolder]: 817/3106 cut-off events. [2022-09-20 20:36:52,919 INFO L131 PetriNetUnfolder]: For 13679/14279 co-relation queries the response was YES. [2022-09-20 20:36:52,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 3106 events. 817/3106 cut-off events. For 13679/14279 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 30687 event pairs, 28 based on Foata normal form. 33/2969 useless extension candidates. Maximal degree in co-relation 10625. Up to 527 conditions per place. [2022-09-20 20:36:52,942 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 27 selfloop transitions, 1 changer transitions 61/200 dead transitions. [2022-09-20 20:36:52,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 200 transitions, 1426 flow [2022-09-20 20:36:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:36:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:36:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2022-09-20 20:36:52,944 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8643892339544513 [2022-09-20 20:36:52,944 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2022-09-20 20:36:52,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2022-09-20 20:36:52,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:36:52,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2022-09-20 20:36:52,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-09-20 20:36:52,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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-09-20 20:36:52,946 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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-09-20 20:36:52,946 INFO L175 Difference]: Start difference. First operand has 190 places, 149 transitions, 734 flow. Second operand 7 states and 835 transitions. [2022-09-20 20:36:52,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 200 transitions, 1426 flow [2022-09-20 20:36:52,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 1098 flow, removed 117 selfloop flow, removed 30 redundant places. [2022-09-20 20:36:52,999 INFO L231 Difference]: Finished difference. Result has 167 places, 137 transitions, 443 flow [2022-09-20 20:36:52,999 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=443, PETRI_PLACES=167, PETRI_TRANSITIONS=137} [2022-09-20 20:36:53,000 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 22 predicate places. [2022-09-20 20:36:53,000 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 137 transitions, 443 flow [2022-09-20 20:36:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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-09-20 20:36:53,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:36:53,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:53,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-20 20:36:53,000 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:36:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:36:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -540346860, now seen corresponding path program 2 times [2022-09-20 20:36:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:36:53,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038450924] [2022-09-20 20:36:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:36:53,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:36:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:36:53,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:36:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:36:53,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:36:53,119 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:36:53,120 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 20:36:53,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 20:36:53,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 20:36:53,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 20:36:53,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 20:36:53,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 20:36:53,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 20:36:53,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-09-20 20:36:53,123 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:36:53,127 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:36:53,127 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:36:53,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:36:53 BasicIcfg [2022-09-20 20:36:53,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:36:53,264 INFO L158 Benchmark]: Toolchain (without parser) took 33676.43ms. Allocated memory was 227.5MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 194.9MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-09-20 20:36:53,264 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 227.5MB. Free memory was 184.7MB in the beginning and 184.7MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:36:53,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.43ms. Allocated memory is still 227.5MB. Free memory was 194.7MB in the beginning and 187.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-09-20 20:36:53,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.78ms. Allocated memory is still 227.5MB. Free memory was 187.6MB in the beginning and 184.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-20 20:36:53,265 INFO L158 Benchmark]: Boogie Preprocessor took 33.05ms. Allocated memory is still 227.5MB. Free memory was 184.2MB in the beginning and 182.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:36:53,265 INFO L158 Benchmark]: RCFGBuilder took 718.46ms. Allocated memory was 227.5MB in the beginning and 291.5MB in the end (delta: 64.0MB). Free memory was 181.9MB in the beginning and 227.3MB in the end (delta: -45.4MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. [2022-09-20 20:36:53,265 INFO L158 Benchmark]: TraceAbstraction took 32399.61ms. Allocated memory was 291.5MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 226.7MB in the beginning and 4.5GB in the end (delta: -4.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-09-20 20:36:53,266 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 227.5MB. Free memory was 184.7MB in the beginning and 184.7MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 452.43ms. Allocated memory is still 227.5MB. Free memory was 194.7MB in the beginning and 187.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.78ms. Allocated memory is still 227.5MB. Free memory was 187.6MB in the beginning and 184.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.05ms. Allocated memory is still 227.5MB. Free memory was 184.2MB in the beginning and 182.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 718.46ms. Allocated memory was 227.5MB in the beginning and 291.5MB in the end (delta: 64.0MB). Free memory was 181.9MB in the beginning and 227.3MB in the end (delta: -45.4MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. * TraceAbstraction took 32399.61ms. Allocated memory was 291.5MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 226.7MB in the beginning and 4.5GB in the end (delta: -4.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L728] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L729] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L730] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L731] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L732] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L733] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L734] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L735] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L736] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L737] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L738] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L739] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L740] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L741] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L742] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L743] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L744] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] 0 pthread_t t1081; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=-3, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t1082; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=-2, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t1083; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=-1, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t1084; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L876] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L879] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L881] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.2s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1352 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1352 mSDsluCounter, 1146 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2039 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3750 IncrementalHoareTripleChecker+Invalid, 4259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 221 mSDtfsCounter, 3750 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=20, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2271 NumberOfCodeBlocks, 2271 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2141 ConstructedInterpolants, 0 QuantifiedInterpolants, 12541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-09-20 20:36:53,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...