/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:24:51,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:24:51,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:24:51,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:24:51,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:24:51,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:24:51,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:24:51,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:24:51,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:24:51,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:24:51,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:24:51,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:24:51,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:24:51,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:24:51,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:24:51,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:24:51,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:24:51,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:24:51,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:24:51,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:24:51,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:24:51,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:24:51,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:24:51,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:24:51,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:24:51,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:24:51,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:24:51,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:24:51,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:24:51,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:24:51,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:24:51,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:24:51,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:24:51,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:24:51,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:24:51,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:24:51,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:24:51,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:24:51,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:24:51,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:24:51,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:24:51,591 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 22:24:51,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:24:51,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:24:51,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:24:51,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:24:51,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:24:51,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:24:51,612 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:24:51,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:24:51,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:24:51,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:24:51,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:24:51,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:24:51,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:24:51,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:24:51,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:24:51,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:24:51,615 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:24:51,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:24:51,615 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 22:24:51,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:24:51,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:24:51,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:24:51,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:24:51,851 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:24:51,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-09-20 22:24:51,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/332ad7cc4/270fb1e829264e4299611157a9a705ce/FLAGbd1e948c5 [2022-09-20 22:24:52,395 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:24:52,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-09-20 22:24:52,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/332ad7cc4/270fb1e829264e4299611157a9a705ce/FLAGbd1e948c5 [2022-09-20 22:24:52,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/332ad7cc4/270fb1e829264e4299611157a9a705ce [2022-09-20 22:24:52,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:24:52,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:24:52,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:24:52,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:24:52,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:24:52,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:24:52" (1/1) ... [2022-09-20 22:24:52,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8cbf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:52, skipping insertion in model container [2022-09-20 22:24:52,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:24:52" (1/1) ... [2022-09-20 22:24:52,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:24:52,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:24:53,101 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/mix021_tso.oepc.i[949,962] [2022-09-20 22:24:53,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:24:53,306 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:24:53,322 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/mix021_tso.oepc.i[949,962] [2022-09-20 22:24:53,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:24:53,422 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:24:53,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53 WrapperNode [2022-09-20 22:24:53,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:24:53,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:24:53,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:24:53,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:24:53,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,514 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-09-20 22:24:53,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:24:53,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:24:53,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:24:53,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:24:53,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:24:53,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:24:53,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:24:53,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:24:53,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (1/1) ... [2022-09-20 22:24:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:24:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:24:53,605 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 22:24:53,628 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 22:24:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:24:53,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:24:53,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:24:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:24:53,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:24:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:24:53,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:24:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:24:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:24:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:24:53,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:24:53,649 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 22:24:53,787 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:24:53,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:24:54,279 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:24:54,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:24:54,566 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:24:54,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:24:54 BoogieIcfgContainer [2022-09-20 22:24:54,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:24:54,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:24:54,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:24:54,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:24:54,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:24:52" (1/3) ... [2022-09-20 22:24:54,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0c33a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:24:54, skipping insertion in model container [2022-09-20 22:24:54,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:53" (2/3) ... [2022-09-20 22:24:54,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0c33a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:24:54, skipping insertion in model container [2022-09-20 22:24:54,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:24:54" (3/3) ... [2022-09-20 22:24:54,576 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-09-20 22:24:54,592 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:24:54,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:24:54,593 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:24:54,649 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:24:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-09-20 22:24:54,725 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-09-20 22:24:54,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:24:54,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-09-20 22:24:54,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-09-20 22:24:54,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-09-20 22:24:54,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:24:54,748 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;@46ad3800, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:24:54,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:24:54,761 INFO L130 PetriNetUnfolder]: 0/77 cut-off events. [2022-09-20 22:24:54,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:24:54,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:54,762 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] [2022-09-20 22:24:54,762 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 22:24:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1884608713, now seen corresponding path program 1 times [2022-09-20 22:24:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478331308] [2022-09-20 22:24:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:55,067 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 22:24:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:55,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478331308] [2022-09-20 22:24:55,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478331308] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:55,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:55,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:24:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006776023] [2022-09-20 22:24:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:55,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:24:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:55,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:24:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:24:55,110 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2022-09-20 22:24:55,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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 22:24:55,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:55,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2022-09-20 22:24:55,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:55,312 INFO L130 PetriNetUnfolder]: 57/350 cut-off events. [2022-09-20 22:24:55,312 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 22:24:55,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 350 events. 57/350 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1363 event pairs, 11 based on Foata normal form. 14/345 useless extension candidates. Maximal degree in co-relation 422. Up to 75 conditions per place. [2022-09-20 22:24:55,317 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 14 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2022-09-20 22:24:55,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 313 flow [2022-09-20 22:24:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:24:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:24:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-09-20 22:24:55,333 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-09-20 22:24:55,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-09-20 22:24:55,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-09-20 22:24:55,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:55,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-09-20 22:24:55,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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 22:24:55,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 22:24:55,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 22:24:55,353 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-09-20 22:24:55,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 313 flow [2022-09-20 22:24:55,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:24:55,362 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-09-20 22:24:55,364 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-09-20 22:24:55,371 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-09-20 22:24:55,371 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-09-20 22:24:55,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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 22:24:55,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:55,372 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] [2022-09-20 22:24:55,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:24:55,373 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 22:24:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash -966961645, now seen corresponding path program 1 times [2022-09-20 22:24:55,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:55,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120432628] [2022-09-20 22:24:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:55,687 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 22:24:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:55,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120432628] [2022-09-20 22:24:55,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120432628] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:55,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:55,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:24:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920948182] [2022-09-20 22:24:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:55,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:24:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:24:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:24:55,692 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-09-20 22:24:55,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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 22:24:55,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:55,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-09-20 22:24:55,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:56,129 INFO L130 PetriNetUnfolder]: 330/1147 cut-off events. [2022-09-20 22:24:56,130 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-09-20 22:24:56,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 1147 events. 330/1147 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7714 event pairs, 59 based on Foata normal form. 0/1115 useless extension candidates. Maximal degree in co-relation 1722. Up to 257 conditions per place. [2022-09-20 22:24:56,138 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 19 selfloop transitions, 2 changer transitions 47/165 dead transitions. [2022-09-20 22:24:56,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 165 transitions, 466 flow [2022-09-20 22:24:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:24:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:24:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1083 transitions. [2022-09-20 22:24:56,144 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2022-09-20 22:24:56,144 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1083 transitions. [2022-09-20 22:24:56,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1083 transitions. [2022-09-20 22:24:56,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:56,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1083 transitions. [2022-09-20 22:24:56,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 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 22:24:56,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:24:56,152 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:24:56,152 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1083 transitions. [2022-09-20 22:24:56,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 165 transitions, 466 flow [2022-09-20 22:24:56,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 165 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:24:56,156 INFO L231 Difference]: Finished difference. Result has 152 places, 114 transitions, 256 flow [2022-09-20 22:24:56,157 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=152, PETRI_TRANSITIONS=114} [2022-09-20 22:24:56,157 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-09-20 22:24:56,158 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 114 transitions, 256 flow [2022-09-20 22:24:56,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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 22:24:56,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:56,158 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 22:24:56,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:24:56,159 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 22:24:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash -117504330, now seen corresponding path program 1 times [2022-09-20 22:24:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977378405] [2022-09-20 22:24:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:56,405 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 22:24:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977378405] [2022-09-20 22:24:56,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977378405] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:56,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:56,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:24:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005364867] [2022-09-20 22:24:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:24:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:24:56,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:24:56,410 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-09-20 22:24:56,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 114 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 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 22:24:56,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:56,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-09-20 22:24:56,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:56,874 INFO L130 PetriNetUnfolder]: 805/1618 cut-off events. [2022-09-20 22:24:56,874 INFO L131 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2022-09-20 22:24:56,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 1618 events. 805/1618 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9793 event pairs, 101 based on Foata normal form. 36/1614 useless extension candidates. Maximal degree in co-relation 3181. Up to 721 conditions per place. [2022-09-20 22:24:56,886 INFO L137 encePairwiseOnDemand]: 129/136 looper letters, 24 selfloop transitions, 3 changer transitions 40/163 dead transitions. [2022-09-20 22:24:56,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 163 transitions, 512 flow [2022-09-20 22:24:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:24:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:24:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-09-20 22:24:56,889 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8872549019607843 [2022-09-20 22:24:56,889 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-09-20 22:24:56,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-09-20 22:24:56,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:56,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-09-20 22:24:56,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 0 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 22:24:56,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:24:56,895 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:24:56,896 INFO L175 Difference]: Start difference. First operand has 152 places, 114 transitions, 256 flow. Second operand 9 states and 1086 transitions. [2022-09-20 22:24:56,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 163 transitions, 512 flow [2022-09-20 22:24:56,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 163 transitions, 480 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 22:24:56,908 INFO L231 Difference]: Finished difference. Result has 139 places, 116 transitions, 283 flow [2022-09-20 22:24:56,908 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=139, PETRI_TRANSITIONS=116} [2022-09-20 22:24:56,909 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-09-20 22:24:56,909 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 283 flow [2022-09-20 22:24:56,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 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 22:24:56,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:56,910 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] [2022-09-20 22:24:56,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:24:56,910 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 22:24:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 722216309, now seen corresponding path program 1 times [2022-09-20 22:24:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703578370] [2022-09-20 22:24:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:57,113 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 22:24:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:57,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703578370] [2022-09-20 22:24:57,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703578370] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:57,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:57,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:24:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070868736] [2022-09-20 22:24:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:57,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:24:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:57,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:24:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:24:57,121 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:24:57,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 116 transitions, 283 flow. Second operand has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 0 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 22:24:57,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:57,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:24:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:57,740 INFO L130 PetriNetUnfolder]: 796/1599 cut-off events. [2022-09-20 22:24:57,740 INFO L131 PetriNetUnfolder]: For 1394/1405 co-relation queries the response was YES. [2022-09-20 22:24:57,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 1599 events. 796/1599 cut-off events. For 1394/1405 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9882 event pairs, 197 based on Foata normal form. 45/1568 useless extension candidates. Maximal degree in co-relation 3729. Up to 661 conditions per place. [2022-09-20 22:24:57,758 INFO L137 encePairwiseOnDemand]: 122/136 looper letters, 21 selfloop transitions, 12 changer transitions 43/171 dead transitions. [2022-09-20 22:24:57,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 171 transitions, 583 flow [2022-09-20 22:24:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:24:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:24:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1839 transitions. [2022-09-20 22:24:57,763 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8451286764705882 [2022-09-20 22:24:57,763 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1839 transitions. [2022-09-20 22:24:57,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1839 transitions. [2022-09-20 22:24:57,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:57,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1839 transitions. [2022-09-20 22:24:57,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.9375) internal successors, (1839), 16 states have internal predecessors, (1839), 0 states have call successors, (0), 0 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 22:24:57,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 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 22:24:57,774 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 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 22:24:57,774 INFO L175 Difference]: Start difference. First operand has 139 places, 116 transitions, 283 flow. Second operand 16 states and 1839 transitions. [2022-09-20 22:24:57,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 171 transitions, 583 flow [2022-09-20 22:24:57,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 171 transitions, 562 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 22:24:57,783 INFO L231 Difference]: Finished difference. Result has 155 places, 123 transitions, 377 flow [2022-09-20 22:24:57,783 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=377, PETRI_PLACES=155, PETRI_TRANSITIONS=123} [2022-09-20 22:24:57,785 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 12 predicate places. [2022-09-20 22:24:57,785 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 123 transitions, 377 flow [2022-09-20 22:24:57,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 0 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 22:24:57,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:57,797 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] [2022-09-20 22:24:57,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:24:57,797 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 22:24:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2114986116, now seen corresponding path program 1 times [2022-09-20 22:24:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308763748] [2022-09-20 22:24:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:58,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308763748] [2022-09-20 22:24:58,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308763748] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:58,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:58,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:24:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176376349] [2022-09-20 22:24:58,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:58,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:24:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:24:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:24:58,051 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-09-20 22:24:58,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 123 transitions, 377 flow. Second operand has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:24:58,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:58,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-09-20 22:24:58,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:58,657 INFO L130 PetriNetUnfolder]: 686/1491 cut-off events. [2022-09-20 22:24:58,658 INFO L131 PetriNetUnfolder]: For 5033/5161 co-relation queries the response was YES. [2022-09-20 22:24:58,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 1491 events. 686/1491 cut-off events. For 5033/5161 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9063 event pairs, 168 based on Foata normal form. 29/1447 useless extension candidates. Maximal degree in co-relation 5399. Up to 546 conditions per place. [2022-09-20 22:24:58,680 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 32 selfloop transitions, 8 changer transitions 37/175 dead transitions. [2022-09-20 22:24:58,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 175 transitions, 901 flow [2022-09-20 22:24:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:24:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:24:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1543 transitions. [2022-09-20 22:24:58,684 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.872737556561086 [2022-09-20 22:24:58,684 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1543 transitions. [2022-09-20 22:24:58,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1543 transitions. [2022-09-20 22:24:58,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:58,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1543 transitions. [2022-09-20 22:24:58,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.6923076923077) internal successors, (1543), 13 states have internal predecessors, (1543), 0 states have call successors, (0), 0 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 22:24:58,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:24:58,691 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:24:58,691 INFO L175 Difference]: Start difference. First operand has 155 places, 123 transitions, 377 flow. Second operand 13 states and 1543 transitions. [2022-09-20 22:24:58,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 175 transitions, 901 flow [2022-09-20 22:24:58,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 175 transitions, 871 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-09-20 22:24:58,700 INFO L231 Difference]: Finished difference. Result has 162 places, 127 transitions, 450 flow [2022-09-20 22:24:58,700 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=450, PETRI_PLACES=162, PETRI_TRANSITIONS=127} [2022-09-20 22:24:58,702 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 19 predicate places. [2022-09-20 22:24:58,702 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 127 transitions, 450 flow [2022-09-20 22:24:58,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:24:58,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:58,703 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] [2022-09-20 22:24:58,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:24:58,703 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 22:24:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -486152830, now seen corresponding path program 2 times [2022-09-20 22:24:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:58,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220401716] [2022-09-20 22:24:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:58,886 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 22:24:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:58,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220401716] [2022-09-20 22:24:58,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220401716] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:58,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:58,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:24:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763859839] [2022-09-20 22:24:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:58,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:24:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:24:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:24:58,889 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:24:58,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 127 transitions, 450 flow. Second operand has 11 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 0 states have call successors, (0), 0 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 22:24:58,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:58,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:24:58,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:59,376 INFO L130 PetriNetUnfolder]: 580/1313 cut-off events. [2022-09-20 22:24:59,376 INFO L131 PetriNetUnfolder]: For 9292/9526 co-relation queries the response was YES. [2022-09-20 22:24:59,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 1313 events. 580/1313 cut-off events. For 9292/9526 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7855 event pairs, 134 based on Foata normal form. 30/1272 useless extension candidates. Maximal degree in co-relation 6075. Up to 506 conditions per place. [2022-09-20 22:24:59,396 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 32 selfloop transitions, 8 changer transitions 25/160 dead transitions. [2022-09-20 22:24:59,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 956 flow [2022-09-20 22:24:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:24:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:24:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1488 transitions. [2022-09-20 22:24:59,401 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8416289592760181 [2022-09-20 22:24:59,401 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1488 transitions. [2022-09-20 22:24:59,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1488 transitions. [2022-09-20 22:24:59,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:59,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1488 transitions. [2022-09-20 22:24:59,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.46153846153847) internal successors, (1488), 13 states have internal predecessors, (1488), 0 states have call successors, (0), 0 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 22:24:59,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:24:59,408 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:24:59,408 INFO L175 Difference]: Start difference. First operand has 162 places, 127 transitions, 450 flow. Second operand 13 states and 1488 transitions. [2022-09-20 22:24:59,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 956 flow [2022-09-20 22:24:59,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 160 transitions, 895 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-09-20 22:24:59,420 INFO L231 Difference]: Finished difference. Result has 165 places, 127 transitions, 447 flow [2022-09-20 22:24:59,421 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=447, PETRI_PLACES=165, PETRI_TRANSITIONS=127} [2022-09-20 22:24:59,422 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 22 predicate places. [2022-09-20 22:24:59,422 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 127 transitions, 447 flow [2022-09-20 22:24:59,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 0 states have call successors, (0), 0 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 22:24:59,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:59,423 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] [2022-09-20 22:24:59,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:24:59,423 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 22:24:59,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1504487851, now seen corresponding path program 1 times [2022-09-20 22:24:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465002949] [2022-09-20 22:24:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:59,601 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 22:24:59,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:59,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465002949] [2022-09-20 22:24:59,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465002949] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:59,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:59,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 22:24:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131977538] [2022-09-20 22:24:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:59,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:24:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:24:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:24:59,604 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:24:59,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 127 transitions, 447 flow. Second operand has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 0 states have call successors, (0), 0 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 22:24:59,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:59,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:24:59,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:00,077 INFO L130 PetriNetUnfolder]: 564/1240 cut-off events. [2022-09-20 22:25:00,077 INFO L131 PetriNetUnfolder]: For 9065/9434 co-relation queries the response was YES. [2022-09-20 22:25:00,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 1240 events. 564/1240 cut-off events. For 9065/9434 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7387 event pairs, 69 based on Foata normal form. 41/1212 useless extension candidates. Maximal degree in co-relation 5774. Up to 506 conditions per place. [2022-09-20 22:25:00,095 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 26 selfloop transitions, 13 changer transitions 29/163 dead transitions. [2022-09-20 22:25:00,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 163 transitions, 947 flow [2022-09-20 22:25:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:25:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:25:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1602 transitions. [2022-09-20 22:25:00,100 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8413865546218487 [2022-09-20 22:25:00,100 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1602 transitions. [2022-09-20 22:25:00,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1602 transitions. [2022-09-20 22:25:00,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:00,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1602 transitions. [2022-09-20 22:25:00,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.42857142857143) internal successors, (1602), 14 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 22:25:00,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 22:25:00,108 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 22:25:00,108 INFO L175 Difference]: Start difference. First operand has 165 places, 127 transitions, 447 flow. Second operand 14 states and 1602 transitions. [2022-09-20 22:25:00,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 163 transitions, 947 flow [2022-09-20 22:25:00,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 163 transitions, 886 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-09-20 22:25:00,120 INFO L231 Difference]: Finished difference. Result has 165 places, 129 transitions, 504 flow [2022-09-20 22:25:00,121 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=504, PETRI_PLACES=165, PETRI_TRANSITIONS=129} [2022-09-20 22:25:00,121 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 22 predicate places. [2022-09-20 22:25:00,121 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 129 transitions, 504 flow [2022-09-20 22:25:00,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 0 states have call successors, (0), 0 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 22:25:00,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:00,122 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 22:25:00,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:25:00,122 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 22:25:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 827956648, now seen corresponding path program 1 times [2022-09-20 22:25:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:00,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031850340] [2022-09-20 22:25:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:00,296 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 22:25:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:00,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031850340] [2022-09-20 22:25:00,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031850340] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:00,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:00,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:25:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238001729] [2022-09-20 22:25:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:00,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:25:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:25:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:25:00,299 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-09-20 22:25:00,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 129 transitions, 504 flow. Second operand has 9 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:25:00,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:00,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-09-20 22:25:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:00,771 INFO L130 PetriNetUnfolder]: 502/1244 cut-off events. [2022-09-20 22:25:00,771 INFO L131 PetriNetUnfolder]: For 13382/13613 co-relation queries the response was YES. [2022-09-20 22:25:00,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6477 conditions, 1244 events. 502/1244 cut-off events. For 13382/13613 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7505 event pairs, 49 based on Foata normal form. 34/1215 useless extension candidates. Maximal degree in co-relation 6386. Up to 469 conditions per place. [2022-09-20 22:25:00,798 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 32 selfloop transitions, 12 changer transitions 25/165 dead transitions. [2022-09-20 22:25:00,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 1152 flow [2022-09-20 22:25:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:25:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:25:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1395 transitions. [2022-09-20 22:25:00,806 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8547794117647058 [2022-09-20 22:25:00,806 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1395 transitions. [2022-09-20 22:25:00,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1395 transitions. [2022-09-20 22:25:00,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:00,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1395 transitions. [2022-09-20 22:25:00,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.25) internal successors, (1395), 12 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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 22:25:00,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 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 22:25:00,813 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 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 22:25:00,813 INFO L175 Difference]: Start difference. First operand has 165 places, 129 transitions, 504 flow. Second operand 12 states and 1395 transitions. [2022-09-20 22:25:00,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 1152 flow [2022-09-20 22:25:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 165 transitions, 1099 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-09-20 22:25:00,826 INFO L231 Difference]: Finished difference. Result has 168 places, 132 transitions, 579 flow [2022-09-20 22:25:00,827 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=579, PETRI_PLACES=168, PETRI_TRANSITIONS=132} [2022-09-20 22:25:00,828 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 25 predicate places. [2022-09-20 22:25:00,829 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 132 transitions, 579 flow [2022-09-20 22:25:00,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:25:00,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:00,829 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 22:25:00,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:25:00,830 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 22:25:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash 855068472, now seen corresponding path program 2 times [2022-09-20 22:25:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632309614] [2022-09-20 22:25:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:01,039 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 22:25:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:01,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632309614] [2022-09-20 22:25:01,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632309614] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:01,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:01,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:25:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090772542] [2022-09-20 22:25:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:01,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:25:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:25:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:25:01,043 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:25:01,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 132 transitions, 579 flow. Second operand has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 0 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 22:25:01,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:01,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:25:01,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:01,501 INFO L130 PetriNetUnfolder]: 500/1223 cut-off events. [2022-09-20 22:25:01,501 INFO L131 PetriNetUnfolder]: For 23566/23824 co-relation queries the response was YES. [2022-09-20 22:25:01,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 1223 events. 500/1223 cut-off events. For 23566/23824 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7350 event pairs, 110 based on Foata normal form. 25/1182 useless extension candidates. Maximal degree in co-relation 7912. Up to 491 conditions per place. [2022-09-20 22:25:01,530 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 35 selfloop transitions, 19 changer transitions 13/162 dead transitions. [2022-09-20 22:25:01,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 162 transitions, 1275 flow [2022-09-20 22:25:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:25:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:25:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1151 transitions. [2022-09-20 22:25:01,533 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8463235294117647 [2022-09-20 22:25:01,533 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1151 transitions. [2022-09-20 22:25:01,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1151 transitions. [2022-09-20 22:25:01,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:01,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1151 transitions. [2022-09-20 22:25:01,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.1) internal successors, (1151), 10 states have internal predecessors, (1151), 0 states have call successors, (0), 0 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 22:25:01,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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 22:25:01,539 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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 22:25:01,539 INFO L175 Difference]: Start difference. First operand has 168 places, 132 transitions, 579 flow. Second operand 10 states and 1151 transitions. [2022-09-20 22:25:01,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 162 transitions, 1275 flow [2022-09-20 22:25:01,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 162 transitions, 1078 flow, removed 86 selfloop flow, removed 10 redundant places. [2022-09-20 22:25:01,557 INFO L231 Difference]: Finished difference. Result has 166 places, 142 transitions, 718 flow [2022-09-20 22:25:01,557 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=718, PETRI_PLACES=166, PETRI_TRANSITIONS=142} [2022-09-20 22:25:01,557 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 23 predicate places. [2022-09-20 22:25:01,558 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 142 transitions, 718 flow [2022-09-20 22:25:01,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 0 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 22:25:01,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:01,558 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 22:25:01,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:25:01,559 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 22:25:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1041877400, now seen corresponding path program 3 times [2022-09-20 22:25:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:01,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987095467] [2022-09-20 22:25:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:01,735 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 22:25:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987095467] [2022-09-20 22:25:01,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987095467] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:01,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:01,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:25:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193412310] [2022-09-20 22:25:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:01,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:25:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:25:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:25:01,738 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:25:01,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 142 transitions, 718 flow. Second operand has 11 states, 11 states have (on average 110.72727272727273) internal successors, (1218), 11 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 22:25:01,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:01,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:25:01,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:02,234 INFO L130 PetriNetUnfolder]: 572/1284 cut-off events. [2022-09-20 22:25:02,234 INFO L131 PetriNetUnfolder]: For 24650/25399 co-relation queries the response was YES. [2022-09-20 22:25:02,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8942 conditions, 1284 events. 572/1284 cut-off events. For 24650/25399 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7676 event pairs, 51 based on Foata normal form. 34/1262 useless extension candidates. Maximal degree in co-relation 8848. Up to 503 conditions per place. [2022-09-20 22:25:02,264 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 48 selfloop transitions, 13 changer transitions 25/180 dead transitions. [2022-09-20 22:25:02,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 180 transitions, 1610 flow [2022-09-20 22:25:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:25:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:25:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1480 transitions. [2022-09-20 22:25:02,268 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8371040723981901 [2022-09-20 22:25:02,268 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1480 transitions. [2022-09-20 22:25:02,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1480 transitions. [2022-09-20 22:25:02,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:02,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1480 transitions. [2022-09-20 22:25:02,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.84615384615384) internal successors, (1480), 13 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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 22:25:02,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:25:02,282 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:25:02,282 INFO L175 Difference]: Start difference. First operand has 166 places, 142 transitions, 718 flow. Second operand 13 states and 1480 transitions. [2022-09-20 22:25:02,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 180 transitions, 1610 flow [2022-09-20 22:25:02,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 180 transitions, 1344 flow, removed 126 selfloop flow, removed 9 redundant places. [2022-09-20 22:25:02,320 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 710 flow [2022-09-20 22:25:02,320 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=710, PETRI_PLACES=173, PETRI_TRANSITIONS=145} [2022-09-20 22:25:02,325 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 30 predicate places. [2022-09-20 22:25:02,325 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 710 flow [2022-09-20 22:25:02,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.72727272727273) internal successors, (1218), 11 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 22:25:02,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:02,332 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 22:25:02,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:25:02,332 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 22:25:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 338212738, now seen corresponding path program 1 times [2022-09-20 22:25:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:02,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809930989] [2022-09-20 22:25:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:02,591 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 22:25:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:02,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809930989] [2022-09-20 22:25:02,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809930989] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:02,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:02,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:25:02,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687781739] [2022-09-20 22:25:02,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:02,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:25:02,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:02,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:25:02,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:25:02,594 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:25:02,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 145 transitions, 710 flow. Second operand has 12 states, 12 states have (on average 111.58333333333333) internal successors, (1339), 12 states have internal predecessors, (1339), 0 states have call successors, (0), 0 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 22:25:02,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:02,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:25:02,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:03,098 INFO L130 PetriNetUnfolder]: 519/1344 cut-off events. [2022-09-20 22:25:03,098 INFO L131 PetriNetUnfolder]: For 25814/26139 co-relation queries the response was YES. [2022-09-20 22:25:03,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8682 conditions, 1344 events. 519/1344 cut-off events. For 25814/26139 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8351 event pairs, 88 based on Foata normal form. 55/1336 useless extension candidates. Maximal degree in co-relation 8587. Up to 537 conditions per place. [2022-09-20 22:25:03,123 INFO L137 encePairwiseOnDemand]: 122/136 looper letters, 45 selfloop transitions, 20 changer transitions 25/185 dead transitions. [2022-09-20 22:25:03,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 185 transitions, 1720 flow [2022-09-20 22:25:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 22:25:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 22:25:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1719 transitions. [2022-09-20 22:25:03,127 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8426470588235294 [2022-09-20 22:25:03,127 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1719 transitions. [2022-09-20 22:25:03,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1719 transitions. [2022-09-20 22:25:03,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:03,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1719 transitions. [2022-09-20 22:25:03,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.6) internal successors, (1719), 15 states have internal predecessors, (1719), 0 states have call successors, (0), 0 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 22:25:03,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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 22:25:03,133 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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 22:25:03,133 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 710 flow. Second operand 15 states and 1719 transitions. [2022-09-20 22:25:03,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 185 transitions, 1720 flow [2022-09-20 22:25:03,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 185 transitions, 1498 flow, removed 106 selfloop flow, removed 10 redundant places. [2022-09-20 22:25:03,154 INFO L231 Difference]: Finished difference. Result has 178 places, 147 transitions, 781 flow [2022-09-20 22:25:03,155 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=781, PETRI_PLACES=178, PETRI_TRANSITIONS=147} [2022-09-20 22:25:03,155 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 35 predicate places. [2022-09-20 22:25:03,155 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 147 transitions, 781 flow [2022-09-20 22:25:03,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.58333333333333) internal successors, (1339), 12 states have internal predecessors, (1339), 0 states have call successors, (0), 0 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 22:25:03,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:03,156 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 22:25:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:25:03,157 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 22:25:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -618235578, now seen corresponding path program 1 times [2022-09-20 22:25:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248693299] [2022-09-20 22:25:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:03,239 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 22:25:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:03,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248693299] [2022-09-20 22:25:03,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248693299] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:03,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:03,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:25:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656358785] [2022-09-20 22:25:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:03,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:25:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:25:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:25:03,241 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:25:03,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 147 transitions, 781 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 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 22:25:03,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:03,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:25:03,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:05,027 INFO L130 PetriNetUnfolder]: 5367/9179 cut-off events. [2022-09-20 22:25:05,028 INFO L131 PetriNetUnfolder]: For 214080/216077 co-relation queries the response was YES. [2022-09-20 22:25:05,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52632 conditions, 9179 events. 5367/9179 cut-off events. For 214080/216077 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 69630 event pairs, 244 based on Foata normal form. 452/9245 useless extension candidates. Maximal degree in co-relation 52539. Up to 3147 conditions per place. [2022-09-20 22:25:05,263 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 186 selfloop transitions, 18 changer transitions 12/313 dead transitions. [2022-09-20 22:25:05,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 313 transitions, 3399 flow [2022-09-20 22:25:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:25:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:25:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1192 transitions. [2022-09-20 22:25:05,266 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8764705882352941 [2022-09-20 22:25:05,266 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1192 transitions. [2022-09-20 22:25:05,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1192 transitions. [2022-09-20 22:25:05,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:05,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1192 transitions. [2022-09-20 22:25:05,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.2) internal successors, (1192), 10 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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 22:25:05,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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 22:25:05,273 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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 22:25:05,274 INFO L175 Difference]: Start difference. First operand has 178 places, 147 transitions, 781 flow. Second operand 10 states and 1192 transitions. [2022-09-20 22:25:05,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 313 transitions, 3399 flow [2022-09-20 22:25:05,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 313 transitions, 3022 flow, removed 118 selfloop flow, removed 14 redundant places. [2022-09-20 22:25:05,445 INFO L231 Difference]: Finished difference. Result has 173 places, 163 transitions, 837 flow [2022-09-20 22:25:05,445 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=837, PETRI_PLACES=173, PETRI_TRANSITIONS=163} [2022-09-20 22:25:05,446 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 30 predicate places. [2022-09-20 22:25:05,446 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 163 transitions, 837 flow [2022-09-20 22:25:05,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 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 22:25:05,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:05,447 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 22:25:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:25:05,447 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 22:25:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1273037753, now seen corresponding path program 1 times [2022-09-20 22:25:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775517330] [2022-09-20 22:25:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:05,741 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 22:25:05,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:05,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775517330] [2022-09-20 22:25:05,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775517330] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:05,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:05,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 22:25:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745112844] [2022-09-20 22:25:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:05,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 22:25:05,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:05,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 22:25:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-09-20 22:25:05,745 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 136 [2022-09-20 22:25:05,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 163 transitions, 837 flow. Second operand has 13 states, 13 states have (on average 108.6923076923077) internal successors, (1413), 13 states have internal predecessors, (1413), 0 states have call successors, (0), 0 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 22:25:05,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:05,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 136 [2022-09-20 22:25:05,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:06,713 INFO L130 PetriNetUnfolder]: 1298/3931 cut-off events. [2022-09-20 22:25:06,713 INFO L131 PetriNetUnfolder]: For 30014/32239 co-relation queries the response was YES. [2022-09-20 22:25:06,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17675 conditions, 3931 events. 1298/3931 cut-off events. For 30014/32239 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 37978 event pairs, 248 based on Foata normal form. 120/3705 useless extension candidates. Maximal degree in co-relation 17578. Up to 891 conditions per place. [2022-09-20 22:25:06,773 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 60 selfloop transitions, 26 changer transitions 0/194 dead transitions. [2022-09-20 22:25:06,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 194 transitions, 1559 flow [2022-09-20 22:25:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:25:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:25:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1557 transitions. [2022-09-20 22:25:06,777 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8177521008403361 [2022-09-20 22:25:06,777 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1557 transitions. [2022-09-20 22:25:06,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1557 transitions. [2022-09-20 22:25:06,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:06,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1557 transitions. [2022-09-20 22:25:06,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 111.21428571428571) internal successors, (1557), 14 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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 22:25:06,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 22:25:06,783 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 22:25:06,783 INFO L175 Difference]: Start difference. First operand has 173 places, 163 transitions, 837 flow. Second operand 14 states and 1557 transitions. [2022-09-20 22:25:06,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 194 transitions, 1559 flow [2022-09-20 22:25:06,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 194 transitions, 1557 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:25:06,818 INFO L231 Difference]: Finished difference. Result has 192 places, 176 transitions, 1226 flow [2022-09-20 22:25:06,818 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1226, PETRI_PLACES=192, PETRI_TRANSITIONS=176} [2022-09-20 22:25:06,819 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 49 predicate places. [2022-09-20 22:25:06,819 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 176 transitions, 1226 flow [2022-09-20 22:25:06,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.6923076923077) internal successors, (1413), 13 states have internal predecessors, (1413), 0 states have call successors, (0), 0 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 22:25:06,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:06,820 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 22:25:06,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:25:06,820 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 22:25:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash -129100093, now seen corresponding path program 1 times [2022-09-20 22:25:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:06,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760793209] [2022-09-20 22:25:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:06,914 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 22:25:06,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:06,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760793209] [2022-09-20 22:25:06,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760793209] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:06,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:06,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:25:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682637362] [2022-09-20 22:25:06,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:06,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:25:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:06,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:25:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:25:06,916 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:25:06,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 176 transitions, 1226 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 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 22:25:06,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:06,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:25:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:09,090 INFO L130 PetriNetUnfolder]: 6087/11530 cut-off events. [2022-09-20 22:25:09,090 INFO L131 PetriNetUnfolder]: For 261511/264138 co-relation queries the response was YES. [2022-09-20 22:25:09,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69380 conditions, 11530 events. 6087/11530 cut-off events. For 261511/264138 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 99980 event pairs, 214 based on Foata normal form. 781/12066 useless extension candidates. Maximal degree in co-relation 69279. Up to 2939 conditions per place. [2022-09-20 22:25:09,358 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 224 selfloop transitions, 36 changer transitions 47/404 dead transitions. [2022-09-20 22:25:09,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 404 transitions, 5458 flow [2022-09-20 22:25:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:25:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:25:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1551 transitions. [2022-09-20 22:25:09,362 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.877262443438914 [2022-09-20 22:25:09,362 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1551 transitions. [2022-09-20 22:25:09,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1551 transitions. [2022-09-20 22:25:09,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:09,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1551 transitions. [2022-09-20 22:25:09,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.3076923076923) internal successors, (1551), 13 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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 22:25:09,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:25:09,367 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 22:25:09,367 INFO L175 Difference]: Start difference. First operand has 192 places, 176 transitions, 1226 flow. Second operand 13 states and 1551 transitions. [2022-09-20 22:25:09,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 404 transitions, 5458 flow [2022-09-20 22:25:09,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 404 transitions, 5018 flow, removed 164 selfloop flow, removed 6 redundant places. [2022-09-20 22:25:09,569 INFO L231 Difference]: Finished difference. Result has 204 places, 182 transitions, 1186 flow [2022-09-20 22:25:09,569 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1186, PETRI_PLACES=204, PETRI_TRANSITIONS=182} [2022-09-20 22:25:09,570 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 61 predicate places. [2022-09-20 22:25:09,570 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 182 transitions, 1186 flow [2022-09-20 22:25:09,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 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 22:25:09,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:09,571 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 22:25:09,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 22:25:09,571 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 22:25:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2061866118, now seen corresponding path program 1 times [2022-09-20 22:25:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:09,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617481915] [2022-09-20 22:25:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:09,658 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 22:25:09,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617481915] [2022-09-20 22:25:09,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617481915] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:09,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:09,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:25:09,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113897678] [2022-09-20 22:25:09,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:09,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:25:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:25:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:25:09,661 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-09-20 22:25:09,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 182 transitions, 1186 flow. Second operand has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 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 22:25:09,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:09,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-09-20 22:25:09,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:11,039 INFO L130 PetriNetUnfolder]: 2362/7472 cut-off events. [2022-09-20 22:25:11,039 INFO L131 PetriNetUnfolder]: For 70748/80143 co-relation queries the response was YES. [2022-09-20 22:25:11,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34468 conditions, 7472 events. 2362/7472 cut-off events. For 70748/80143 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 86122 event pairs, 318 based on Foata normal form. 181/7029 useless extension candidates. Maximal degree in co-relation 34362. Up to 2002 conditions per place. [2022-09-20 22:25:11,140 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 92 selfloop transitions, 5 changer transitions 16/249 dead transitions. [2022-09-20 22:25:11,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 249 transitions, 2577 flow [2022-09-20 22:25:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:25:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:25:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2022-09-20 22:25:11,142 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8665966386554622 [2022-09-20 22:25:11,142 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2022-09-20 22:25:11,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2022-09-20 22:25:11,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:11,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2022-09-20 22:25:11,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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 22:25:11,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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 22:25:11,145 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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 22:25:11,145 INFO L175 Difference]: Start difference. First operand has 204 places, 182 transitions, 1186 flow. Second operand 7 states and 825 transitions. [2022-09-20 22:25:11,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 249 transitions, 2577 flow [2022-09-20 22:25:11,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 249 transitions, 2392 flow, removed 84 selfloop flow, removed 10 redundant places. [2022-09-20 22:25:11,605 INFO L231 Difference]: Finished difference. Result has 199 places, 185 transitions, 1136 flow [2022-09-20 22:25:11,606 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1136, PETRI_PLACES=199, PETRI_TRANSITIONS=185} [2022-09-20 22:25:11,606 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 56 predicate places. [2022-09-20 22:25:11,606 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 185 transitions, 1136 flow [2022-09-20 22:25:11,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 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 22:25:11,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:11,607 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 22:25:11,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 22:25:11,607 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 22:25:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1941174636, now seen corresponding path program 2 times [2022-09-20 22:25:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:11,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189517533] [2022-09-20 22:25:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:11,690 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 22:25:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:11,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189517533] [2022-09-20 22:25:11,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189517533] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:11,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:11,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:25:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080191825] [2022-09-20 22:25:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:11,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:25:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:25:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:25:11,692 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-09-20 22:25:11,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 185 transitions, 1136 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 22:25:11,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:11,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-09-20 22:25:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:14,371 INFO L130 PetriNetUnfolder]: 4026/13587 cut-off events. [2022-09-20 22:25:14,371 INFO L131 PetriNetUnfolder]: For 102553/109077 co-relation queries the response was YES. [2022-09-20 22:25:14,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55468 conditions, 13587 events. 4026/13587 cut-off events. For 102553/109077 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 175643 event pairs, 632 based on Foata normal form. 345/12912 useless extension candidates. Maximal degree in co-relation 55365. Up to 2096 conditions per place. [2022-09-20 22:25:14,557 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 71 selfloop transitions, 16 changer transitions 63/287 dead transitions. [2022-09-20 22:25:14,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 287 transitions, 3192 flow [2022-09-20 22:25:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:25:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:25:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-09-20 22:25:14,560 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2022-09-20 22:25:14,560 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-09-20 22:25:14,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-09-20 22:25:14,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:14,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-09-20 22:25:14,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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 22:25:14,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:25:14,564 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:25:14,564 INFO L175 Difference]: Start difference. First operand has 199 places, 185 transitions, 1136 flow. Second operand 9 states and 1078 transitions. [2022-09-20 22:25:14,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 287 transitions, 3192 flow [2022-09-20 22:25:15,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 287 transitions, 3175 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-09-20 22:25:15,247 INFO L231 Difference]: Finished difference. Result has 213 places, 192 transitions, 1333 flow [2022-09-20 22:25:15,247 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1333, PETRI_PLACES=213, PETRI_TRANSITIONS=192} [2022-09-20 22:25:15,248 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 70 predicate places. [2022-09-20 22:25:15,248 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 192 transitions, 1333 flow [2022-09-20 22:25:15,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 22:25:15,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:15,248 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] [2022-09-20 22:25:15,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 22:25:15,249 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 22:25:15,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash -86312813, now seen corresponding path program 1 times [2022-09-20 22:25:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:15,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223171196] [2022-09-20 22:25:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:15,364 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 22:25:15,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223171196] [2022-09-20 22:25:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223171196] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:15,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:25:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589217102] [2022-09-20 22:25:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:25:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:25:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:25:15,367 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:25:15,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 192 transitions, 1333 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 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 22:25:15,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:15,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:25:15,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:20,874 INFO L130 PetriNetUnfolder]: 13680/26309 cut-off events. [2022-09-20 22:25:20,874 INFO L131 PetriNetUnfolder]: For 502774/510302 co-relation queries the response was YES. [2022-09-20 22:25:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154114 conditions, 26309 events. 13680/26309 cut-off events. For 502774/510302 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 271407 event pairs, 129 based on Foata normal form. 1589/26929 useless extension candidates. Maximal degree in co-relation 154004. Up to 6456 conditions per place. [2022-09-20 22:25:21,288 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 84 selfloop transitions, 15 changer transitions 237/433 dead transitions. [2022-09-20 22:25:21,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 433 transitions, 5702 flow [2022-09-20 22:25:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:25:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:25:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1910 transitions. [2022-09-20 22:25:21,292 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8777573529411765 [2022-09-20 22:25:21,292 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1910 transitions. [2022-09-20 22:25:21,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1910 transitions. [2022-09-20 22:25:21,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:21,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1910 transitions. [2022-09-20 22:25:21,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.375) internal successors, (1910), 16 states have internal predecessors, (1910), 0 states have call successors, (0), 0 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 22:25:21,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 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 22:25:21,299 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 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 22:25:21,300 INFO L175 Difference]: Start difference. First operand has 213 places, 192 transitions, 1333 flow. Second operand 16 states and 1910 transitions. [2022-09-20 22:25:21,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 433 transitions, 5702 flow [2022-09-20 22:25:22,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 433 transitions, 5252 flow, removed 128 selfloop flow, removed 7 redundant places. [2022-09-20 22:25:22,680 INFO L231 Difference]: Finished difference. Result has 227 places, 146 transitions, 910 flow [2022-09-20 22:25:22,681 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=910, PETRI_PLACES=227, PETRI_TRANSITIONS=146} [2022-09-20 22:25:22,681 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 84 predicate places. [2022-09-20 22:25:22,681 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 146 transitions, 910 flow [2022-09-20 22:25:22,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 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 22:25:22,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:22,682 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] [2022-09-20 22:25:22,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 22:25:22,682 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 22:25:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1084361291, now seen corresponding path program 1 times [2022-09-20 22:25:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:22,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810094812] [2022-09-20 22:25:22,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:22,798 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 22:25:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810094812] [2022-09-20 22:25:22,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810094812] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:22,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:22,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:25:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699374918] [2022-09-20 22:25:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:22,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:25:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:25:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:25:22,800 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-09-20 22:25:22,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 146 transitions, 910 flow. Second operand has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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 22:25:22,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:22,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-09-20 22:25:22,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:23,582 INFO L130 PetriNetUnfolder]: 1223/3262 cut-off events. [2022-09-20 22:25:23,582 INFO L131 PetriNetUnfolder]: For 47472/48869 co-relation queries the response was YES. [2022-09-20 22:25:23,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17887 conditions, 3262 events. 1223/3262 cut-off events. For 47472/48869 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 27808 event pairs, 56 based on Foata normal form. 138/3299 useless extension candidates. Maximal degree in co-relation 17825. Up to 653 conditions per place. [2022-09-20 22:25:23,616 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 70 selfloop transitions, 19 changer transitions 41/227 dead transitions. [2022-09-20 22:25:23,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 227 transitions, 2380 flow [2022-09-20 22:25:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:25:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:25:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1396 transitions. [2022-09-20 22:25:23,619 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8553921568627451 [2022-09-20 22:25:23,619 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1396 transitions. [2022-09-20 22:25:23,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1396 transitions. [2022-09-20 22:25:23,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:23,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1396 transitions. [2022-09-20 22:25:23,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.33333333333333) internal successors, (1396), 12 states have internal predecessors, (1396), 0 states have call successors, (0), 0 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 22:25:23,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 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 22:25:23,624 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 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 22:25:23,624 INFO L175 Difference]: Start difference. First operand has 227 places, 146 transitions, 910 flow. Second operand 12 states and 1396 transitions. [2022-09-20 22:25:23,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 227 transitions, 2380 flow [2022-09-20 22:25:23,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 227 transitions, 1762 flow, removed 276 selfloop flow, removed 34 redundant places. [2022-09-20 22:25:23,742 INFO L231 Difference]: Finished difference. Result has 181 places, 145 transitions, 674 flow [2022-09-20 22:25:23,742 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=674, PETRI_PLACES=181, PETRI_TRANSITIONS=145} [2022-09-20 22:25:23,743 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 38 predicate places. [2022-09-20 22:25:23,743 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 145 transitions, 674 flow [2022-09-20 22:25:23,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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 22:25:23,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:23,743 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] [2022-09-20 22:25:23,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-20 22:25:23,744 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 22:25:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash -967964597, now seen corresponding path program 1 times [2022-09-20 22:25:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:23,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939281755] [2022-09-20 22:25:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:23,841 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 22:25:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:23,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939281755] [2022-09-20 22:25:23,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939281755] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:23,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:23,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:25:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595859354] [2022-09-20 22:25:23,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:23,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:25:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:25:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:25:23,843 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-09-20 22:25:23,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 145 transitions, 674 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 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 22:25:23,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:23,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-09-20 22:25:23,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:24,366 INFO L130 PetriNetUnfolder]: 843/3149 cut-off events. [2022-09-20 22:25:24,366 INFO L131 PetriNetUnfolder]: For 11721/12347 co-relation queries the response was YES. [2022-09-20 22:25:24,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10468 conditions, 3149 events. 843/3149 cut-off events. For 11721/12347 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 31492 event pairs, 47 based on Foata normal form. 36/2988 useless extension candidates. Maximal degree in co-relation 10376. Up to 545 conditions per place. [2022-09-20 22:25:24,395 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 27 selfloop transitions, 1 changer transitions 55/192 dead transitions. [2022-09-20 22:25:24,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 192 transitions, 1244 flow [2022-09-20 22:25:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:25:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:25:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-09-20 22:25:24,397 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8623949579831933 [2022-09-20 22:25:24,397 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-09-20 22:25:24,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-09-20 22:25:24,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:24,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-09-20 22:25:24,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 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 22:25:24,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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 22:25:24,400 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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 22:25:24,400 INFO L175 Difference]: Start difference. First operand has 181 places, 145 transitions, 674 flow. Second operand 7 states and 821 transitions. [2022-09-20 22:25:24,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 192 transitions, 1244 flow [2022-09-20 22:25:24,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 192 transitions, 951 flow, removed 111 selfloop flow, removed 25 redundant places. [2022-09-20 22:25:24,453 INFO L231 Difference]: Finished difference. Result has 163 places, 135 transitions, 438 flow [2022-09-20 22:25:24,454 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=438, PETRI_PLACES=163, PETRI_TRANSITIONS=135} [2022-09-20 22:25:24,454 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 20 predicate places. [2022-09-20 22:25:24,454 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 135 transitions, 438 flow [2022-09-20 22:25:24,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 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 22:25:24,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:24,455 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] [2022-09-20 22:25:24,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-20 22:25:24,455 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 22:25:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1000398503, now seen corresponding path program 2 times [2022-09-20 22:25:24,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:24,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508189156] [2022-09-20 22:25:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:25:24,499 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:25:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:25:24,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:25:24,588 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:25:24,589 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 22:25:24,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 22:25:24,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 22:25:24,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 22:25:24,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 22:25:24,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 22:25:24,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 22:25:24,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-20 22:25:24,591 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:25:24,596 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:25:24,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:25:24,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:25:24 BasicIcfg [2022-09-20 22:25:24,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:25:24,744 INFO L158 Benchmark]: Toolchain (without parser) took 31852.34ms. Allocated memory was 175.1MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 142.5MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-09-20 22:25:24,744 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 175.1MB. Free memory was 131.8MB in the beginning and 131.7MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:25:24,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.59ms. Allocated memory was 175.1MB in the beginning and 259.0MB in the end (delta: 83.9MB). Free memory was 142.5MB in the beginning and 215.5MB in the end (delta: -73.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-09-20 22:25:24,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.78ms. Allocated memory is still 259.0MB. Free memory was 215.5MB in the beginning and 212.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:25:24,744 INFO L158 Benchmark]: Boogie Preprocessor took 59.07ms. Allocated memory is still 259.0MB. Free memory was 212.3MB in the beginning and 210.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:25:24,745 INFO L158 Benchmark]: RCFGBuilder took 992.96ms. Allocated memory is still 259.0MB. Free memory was 210.2MB in the beginning and 127.9MB in the end (delta: 82.3MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. [2022-09-20 22:25:24,745 INFO L158 Benchmark]: TraceAbstraction took 30171.29ms. Allocated memory was 259.0MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 127.4MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-09-20 22:25:24,746 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.15ms. Allocated memory is still 175.1MB. Free memory was 131.8MB in the beginning and 131.7MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 532.59ms. Allocated memory was 175.1MB in the beginning and 259.0MB in the end (delta: 83.9MB). Free memory was 142.5MB in the beginning and 215.5MB in the end (delta: -73.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 90.78ms. Allocated memory is still 259.0MB. Free memory was 215.5MB in the beginning and 212.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.07ms. Allocated memory is still 259.0MB. Free memory was 212.3MB in the beginning and 210.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 992.96ms. Allocated memory is still 259.0MB. Free memory was 210.2MB in the beginning and 127.9MB in the end (delta: 82.3MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. * TraceAbstraction took 30171.29ms. Allocated memory was 259.0MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 127.4MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.1GB. 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] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L846] 0 pthread_t t577; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577={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] [L847] FCALL, FORK 0 pthread_create(&t577, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-3, t577={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] [L848] 0 pthread_t t578; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={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] [L849] FCALL, FORK 0 pthread_create(&t578, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=-2, t577={5:0}, t578={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] [L850] 0 pthread_t t579; 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}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={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] [L851] FCALL, FORK 0 pthread_create(&t579, ((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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=-1, t577={5:0}, t578={6:0}, t579={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] [L852] 0 pthread_t t580; 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}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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] [L853] FCALL, FORK 0 pthread_create(&t580, ((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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L798] 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}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L815] 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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L750] 1 a = 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}, 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] [L753] 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}, 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] [L765] 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}, 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] [L758] 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}, 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] [L768] 2 y = 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}, 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] [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 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}, 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] [L824] 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) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 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 [L808] 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}, 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] [L831] 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}, 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] [L855] 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}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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] [L857] 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}, 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] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] 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) [L859] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 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 [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L870] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 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}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=49, weak$$choice2=255, 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] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression 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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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: 853]: 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: 847]: 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: 851]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1064 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1064 mSDsluCounter, 803 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1591 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2848 IncrementalHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 157 mSDtfsCounter, 2848 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1333occurred in iteration=16, InterpolantAutomatonStates: 215, 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.4s InterpolantComputationTime, 1860 NumberOfCodeBlocks, 1860 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 9002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 22:25:24,786 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...