/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/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 18:50:27,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 18:50:27,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 18:50:27,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 18:50:27,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 18:50:27,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 18:50:27,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 18:50:27,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 18:50:27,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 18:50:27,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 18:50:27,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 18:50:27,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 18:50:27,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 18:50:27,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 18:50:27,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 18:50:27,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 18:50:27,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 18:50:27,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 18:50:27,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 18:50:27,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 18:50:27,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 18:50:27,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 18:50:27,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 18:50:27,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 18:50:27,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 18:50:27,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 18:50:27,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 18:50:27,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 18:50:27,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 18:50:27,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 18:50:27,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 18:50:27,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 18:50:27,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 18:50:27,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 18:50:27,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 18:50:27,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 18:50:27,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 18:50:27,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 18:50:27,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 18:50:27,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 18:50:27,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 18:50:27,596 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-12-11 18:50:27,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 18:50:27,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 18:50:27,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 18:50:27,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 18:50:27,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 18:50:27,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 18:50:27,625 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 18:50:27,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 18:50:27,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 18:50:27,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 18:50:27,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 18:50:27,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 18:50:27,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 18:50:27,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 18:50:27,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 18:50:27,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:50:27,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 18:50:27,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-11 18:50:27,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 18:50:27,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 18:50:27,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 18:50:27,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 18:50:27,885 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 18:50:27,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-11 18:50:28,838 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 18:50:29,017 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 18:50:29,018 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-11 18:50:29,049 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4ed2079/e99322e46ba4498cbb1254e42987c92c/FLAGfef8a0b47 [2022-12-11 18:50:29,058 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4ed2079/e99322e46ba4498cbb1254e42987c92c [2022-12-11 18:50:29,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 18:50:29,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 18:50:29,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 18:50:29,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 18:50:29,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 18:50:29,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7edd7dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29, skipping insertion in model container [2022-12-11 18:50:29,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 18:50:29,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 18:50:29,404 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-12-11 18:50:29,411 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-12-11 18:50:29,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:50:29,423 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 18:50:29,459 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-12-11 18:50:29,461 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-12-11 18:50:29,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:50:29,508 INFO L208 MainTranslator]: Completed translation [2022-12-11 18:50:29,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29 WrapperNode [2022-12-11 18:50:29,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 18:50:29,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 18:50:29,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 18:50:29,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 18:50:29,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,574 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-11 18:50:29,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 18:50:29,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 18:50:29,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 18:50:29,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 18:50:29,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 18:50:29,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 18:50:29,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 18:50:29,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 18:50:29,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (1/1) ... [2022-12-11 18:50:29,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:50:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:50:29,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 18:50:29,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 18:50:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-11 18:50:29,686 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-11 18:50:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-11 18:50:29,686 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-11 18:50:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 18:50:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 18:50:29,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 18:50:29,688 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 18:50:29,833 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 18:50:29,834 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 18:50:30,032 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 18:50:30,038 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 18:50:30,038 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-11 18:50:30,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:50:30 BoogieIcfgContainer [2022-12-11 18:50:30,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 18:50:30,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 18:50:30,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 18:50:30,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 18:50:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 06:50:29" (1/3) ... [2022-12-11 18:50:30,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348b6f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:50:30, skipping insertion in model container [2022-12-11 18:50:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:50:29" (2/3) ... [2022-12-11 18:50:30,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348b6f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:50:30, skipping insertion in model container [2022-12-11 18:50:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:50:30" (3/3) ... [2022-12-11 18:50:30,045 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-11 18:50:30,056 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 18:50:30,056 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 18:50:30,056 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 18:50:30,124 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 18:50:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-11 18:50:30,227 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-11 18:50:30,227 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 18:50:30,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-11 18:50:30,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-11 18:50:30,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-11 18:50:30,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 18:50:30,262 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;@1ed9ee21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 18:50:30,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 18:50:30,272 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-11 18:50:30,272 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:50:30,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:30,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:30,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash 813813323, now seen corresponding path program 1 times [2022-12-11 18:50:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:30,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025418114] [2022-12-11 18:50:30,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:30,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:30,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025418114] [2022-12-11 18:50:30,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025418114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:50:30,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:50:30,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 18:50:30,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818341387] [2022-12-11 18:50:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:50:30,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 18:50:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:30,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 18:50:30,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 18:50:30,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 215 [2022-12-11 18:50:30,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 204 transitions, 417 flow. Second operand has 2 states, 2 states have (on average 204.5) internal successors, (409), 2 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:30,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:30,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 215 [2022-12-11 18:50:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:30,623 INFO L130 PetriNetUnfolder]: 9/195 cut-off events. [2022-12-11 18:50:30,623 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 18:50:30,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 195 events. 9/195 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 275 event pairs, 0 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2022-12-11 18:50:30,629 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 3 selfloop transitions, 0 changer transitions 0/195 dead transitions. [2022-12-11 18:50:30,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 195 transitions, 405 flow [2022-12-11 18:50:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 18:50:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 18:50:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 415 transitions. [2022-12-11 18:50:30,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9651162790697675 [2022-12-11 18:50:30,644 INFO L175 Difference]: Start difference. First operand has 198 places, 204 transitions, 417 flow. Second operand 2 states and 415 transitions. [2022-12-11 18:50:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 195 transitions, 405 flow [2022-12-11 18:50:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 195 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-11 18:50:30,651 INFO L231 Difference]: Finished difference. Result has 191 places, 195 transitions, 394 flow [2022-12-11 18:50:30,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=394, PETRI_PLACES=191, PETRI_TRANSITIONS=195} [2022-12-11 18:50:30,656 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, -7 predicate places. [2022-12-11 18:50:30,657 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 195 transitions, 394 flow [2022-12-11 18:50:30,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 204.5) internal successors, (409), 2 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:30,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:30,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:30,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 18:50:30,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1104887516, now seen corresponding path program 1 times [2022-12-11 18:50:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646368267] [2022-12-11 18:50:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646368267] [2022-12-11 18:50:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646368267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:50:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:50:31,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 18:50:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270985255] [2022-12-11 18:50:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:50:31,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 18:50:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 18:50:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-11 18:50:31,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 215 [2022-12-11 18:50:31,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 195 transitions, 394 flow. Second operand has 12 states, 12 states have (on average 153.25) internal successors, (1839), 12 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-12-11 18:50:31,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:31,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 215 [2022-12-11 18:50:31,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:32,129 INFO L130 PetriNetUnfolder]: 611/2461 cut-off events. [2022-12-11 18:50:32,129 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-11 18:50:32,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 2461 events. 611/2461 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19460 event pairs, 459 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 3390. Up to 882 conditions per place. [2022-12-11 18:50:32,142 INFO L137 encePairwiseOnDemand]: 202/215 looper letters, 42 selfloop transitions, 12 changer transitions 0/191 dead transitions. [2022-12-11 18:50:32,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 191 transitions, 494 flow [2022-12-11 18:50:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 18:50:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 18:50:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2005 transitions. [2022-12-11 18:50:32,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7173524150268337 [2022-12-11 18:50:32,156 INFO L175 Difference]: Start difference. First operand has 191 places, 195 transitions, 394 flow. Second operand 13 states and 2005 transitions. [2022-12-11 18:50:32,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 191 transitions, 494 flow [2022-12-11 18:50:32,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 191 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-11 18:50:32,161 INFO L231 Difference]: Finished difference. Result has 200 places, 191 transitions, 410 flow [2022-12-11 18:50:32,161 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=410, PETRI_PLACES=200, PETRI_TRANSITIONS=191} [2022-12-11 18:50:32,162 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2022-12-11 18:50:32,162 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 191 transitions, 410 flow [2022-12-11 18:50:32,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 153.25) internal successors, (1839), 12 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-12-11 18:50:32,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:32,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:32,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 18:50:32,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1353821565, now seen corresponding path program 1 times [2022-12-11 18:50:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:32,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424830615] [2022-12-11 18:50:32,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:32,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424830615] [2022-12-11 18:50:32,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424830615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:50:32,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:50:32,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 18:50:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772181206] [2022-12-11 18:50:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:50:32,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:50:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:50:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:50:32,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 215 [2022-12-11 18:50:32,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 191 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:32,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:32,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 215 [2022-12-11 18:50:32,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:32,359 INFO L130 PetriNetUnfolder]: 16/288 cut-off events. [2022-12-11 18:50:32,359 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-11 18:50:32,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 674 event pairs, 2 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 327. Up to 12 conditions per place. [2022-12-11 18:50:32,360 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 7 selfloop transitions, 2 changer transitions 5/194 dead transitions. [2022-12-11 18:50:32,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 194 transitions, 443 flow [2022-12-11 18:50:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:50:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:50:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-12-11 18:50:32,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9410852713178295 [2022-12-11 18:50:32,362 INFO L175 Difference]: Start difference. First operand has 200 places, 191 transitions, 410 flow. Second operand 3 states and 607 transitions. [2022-12-11 18:50:32,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 194 transitions, 443 flow [2022-12-11 18:50:32,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 194 transitions, 420 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-12-11 18:50:32,365 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 389 flow [2022-12-11 18:50:32,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2022-12-11 18:50:32,366 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, -6 predicate places. [2022-12-11 18:50:32,366 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 389 flow [2022-12-11 18:50:32,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:32,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:32,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:32,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 18:50:32,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1703980672, now seen corresponding path program 1 times [2022-12-11 18:50:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:32,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385010476] [2022-12-11 18:50:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385010476] [2022-12-11 18:50:32,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385010476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:50:32,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:50:32,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 18:50:32,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788504016] [2022-12-11 18:50:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:50:32,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:50:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:50:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:50:32,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 215 [2022-12-11 18:50:32,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 389 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:32,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:32,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 215 [2022-12-11 18:50:32,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:32,459 INFO L130 PetriNetUnfolder]: 20/315 cut-off events. [2022-12-11 18:50:32,459 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 18:50:32,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 315 events. 20/315 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 652 event pairs, 6 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 380. Up to 24 conditions per place. [2022-12-11 18:50:32,460 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 13 selfloop transitions, 2 changer transitions 1/193 dead transitions. [2022-12-11 18:50:32,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 193 transitions, 431 flow [2022-12-11 18:50:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:50:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:50:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-12-11 18:50:32,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9410852713178295 [2022-12-11 18:50:32,462 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 389 flow. Second operand 3 states and 607 transitions. [2022-12-11 18:50:32,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 193 transitions, 431 flow [2022-12-11 18:50:32,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:50:32,464 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 395 flow [2022-12-11 18:50:32,465 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2022-12-11 18:50:32,466 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, -6 predicate places. [2022-12-11 18:50:32,466 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 395 flow [2022-12-11 18:50:32,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:32,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:32,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:32,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 18:50:32,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash 591682952, now seen corresponding path program 1 times [2022-12-11 18:50:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:32,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772782209] [2022-12-11 18:50:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772782209] [2022-12-11 18:50:32,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772782209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:50:32,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495882469] [2022-12-11 18:50:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:32,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:32,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:50:32,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:50:32,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 18:50:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:32,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-11 18:50:32,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:50:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:32,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:50:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:32,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495882469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:50:32,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:50:32,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-11 18:50:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677652332] [2022-12-11 18:50:32,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:50:32,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 18:50:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 18:50:32,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-11 18:50:32,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-11 18:50:32,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 395 flow. Second operand has 10 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:32,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:32,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-11 18:50:32,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:32,961 INFO L130 PetriNetUnfolder]: 30/398 cut-off events. [2022-12-11 18:50:32,961 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-11 18:50:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 398 events. 30/398 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 675 event pairs, 4 based on Foata normal form. 4/391 useless extension candidates. Maximal degree in co-relation 512. Up to 19 conditions per place. [2022-12-11 18:50:32,963 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 20 selfloop transitions, 9 changer transitions 0/205 dead transitions. [2022-12-11 18:50:32,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 205 transitions, 503 flow [2022-12-11 18:50:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 18:50:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 18:50:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-12-11 18:50:32,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9276485788113695 [2022-12-11 18:50:32,966 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 395 flow. Second operand 9 states and 1795 transitions. [2022-12-11 18:50:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 205 transitions, 503 flow [2022-12-11 18:50:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-11 18:50:32,969 INFO L231 Difference]: Finished difference. Result has 201 places, 194 transitions, 443 flow [2022-12-11 18:50:32,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=201, PETRI_TRANSITIONS=194} [2022-12-11 18:50:32,969 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 3 predicate places. [2022-12-11 18:50:32,969 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 443 flow [2022-12-11 18:50:32,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:32,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:32,971 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:32,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-11 18:50:33,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:33,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1864176200, now seen corresponding path program 2 times [2022-12-11 18:50:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:33,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524994885] [2022-12-11 18:50:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-11 18:50:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:33,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524994885] [2022-12-11 18:50:33,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524994885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:50:33,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:50:33,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 18:50:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223491368] [2022-12-11 18:50:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:50:33,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:50:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:50:33,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:50:33,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 215 [2022-12-11 18:50:33,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:33,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:33,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 215 [2022-12-11 18:50:33,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:33,367 INFO L130 PetriNetUnfolder]: 21/466 cut-off events. [2022-12-11 18:50:33,368 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-11 18:50:33,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 466 events. 21/466 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 738 event pairs, 1 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 554. Up to 19 conditions per place. [2022-12-11 18:50:33,369 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 12 selfloop transitions, 3 changer transitions 3/196 dead transitions. [2022-12-11 18:50:33,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 196 transitions, 482 flow [2022-12-11 18:50:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:50:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:50:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2022-12-11 18:50:33,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9255813953488372 [2022-12-11 18:50:33,371 INFO L175 Difference]: Start difference. First operand has 201 places, 194 transitions, 443 flow. Second operand 3 states and 597 transitions. [2022-12-11 18:50:33,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 196 transitions, 482 flow [2022-12-11 18:50:33,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 196 transitions, 476 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-11 18:50:33,374 INFO L231 Difference]: Finished difference. Result has 202 places, 191 transitions, 437 flow [2022-12-11 18:50:33,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=202, PETRI_TRANSITIONS=191} [2022-12-11 18:50:33,375 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 4 predicate places. [2022-12-11 18:50:33,375 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 191 transitions, 437 flow [2022-12-11 18:50:33,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:33,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:33,376 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:33,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 18:50:33,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2067440204, now seen corresponding path program 1 times [2022-12-11 18:50:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510511362] [2022-12-11 18:50:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:33,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510511362] [2022-12-11 18:50:33,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510511362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:50:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111713200] [2022-12-11 18:50:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:33,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:33,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:50:33,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:50:33,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 18:50:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:33,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-11 18:50:33,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:50:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:33,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:50:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:33,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111713200] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:50:33,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:50:33,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-11 18:50:33,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882417444] [2022-12-11 18:50:33,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:50:33,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 18:50:33,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:33,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 18:50:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-11 18:50:33,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-11 18:50:34,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 191 transitions, 437 flow. Second operand has 18 states, 18 states have (on average 198.33333333333334) internal successors, (3570), 18 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:34,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:34,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-11 18:50:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:34,204 INFO L130 PetriNetUnfolder]: 58/706 cut-off events. [2022-12-11 18:50:34,204 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-11 18:50:34,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 706 events. 58/706 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1359 event pairs, 4 based on Foata normal form. 8/695 useless extension candidates. Maximal degree in co-relation 1006. Up to 39 conditions per place. [2022-12-11 18:50:34,208 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 40 selfloop transitions, 21 changer transitions 1/234 dead transitions. [2022-12-11 18:50:34,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 234 transitions, 735 flow [2022-12-11 18:50:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-11 18:50:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-11 18:50:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4181 transitions. [2022-12-11 18:50:34,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9260243632336655 [2022-12-11 18:50:34,215 INFO L175 Difference]: Start difference. First operand has 202 places, 191 transitions, 437 flow. Second operand 21 states and 4181 transitions. [2022-12-11 18:50:34,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 234 transitions, 735 flow [2022-12-11 18:50:34,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 234 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-11 18:50:34,224 INFO L231 Difference]: Finished difference. Result has 223 places, 203 transitions, 562 flow [2022-12-11 18:50:34,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=562, PETRI_PLACES=223, PETRI_TRANSITIONS=203} [2022-12-11 18:50:34,226 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 25 predicate places. [2022-12-11 18:50:34,226 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 203 transitions, 562 flow [2022-12-11 18:50:34,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 198.33333333333334) internal successors, (3570), 18 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:34,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:34,228 INFO L214 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:34,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-11 18:50:34,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-11 18:50:34,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1431209616, now seen corresponding path program 2 times [2022-12-11 18:50:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:34,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101888092] [2022-12-11 18:50:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:34,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101888092] [2022-12-11 18:50:34,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101888092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:50:34,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679718735] [2022-12-11 18:50:34,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 18:50:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:50:34,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:50:34,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 18:50:35,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 18:50:35,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 18:50:35,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-11 18:50:35,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:50:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:35,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:50:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:35,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679718735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:50:35,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:50:35,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-12-11 18:50:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784685447] [2022-12-11 18:50:35,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:50:35,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-11 18:50:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-11 18:50:35,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-12-11 18:50:35,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-11 18:50:35,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 203 transitions, 562 flow. Second operand has 34 states, 34 states have (on average 198.41176470588235) internal successors, (6746), 34 states have internal predecessors, (6746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:35,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:35,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-11 18:50:35,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:36,424 INFO L130 PetriNetUnfolder]: 114/1320 cut-off events. [2022-12-11 18:50:36,424 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-11 18:50:36,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 1320 events. 114/1320 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2744 event pairs, 4 based on Foata normal form. 16/1301 useless extension candidates. Maximal degree in co-relation 2082. Up to 79 conditions per place. [2022-12-11 18:50:36,428 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 80 selfloop transitions, 45 changer transitions 0/297 dead transitions. [2022-12-11 18:50:36,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 297 transitions, 1300 flow [2022-12-11 18:50:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-11 18:50:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-11 18:50:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 8953 transitions. [2022-12-11 18:50:36,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.925374677002584 [2022-12-11 18:50:36,440 INFO L175 Difference]: Start difference. First operand has 223 places, 203 transitions, 562 flow. Second operand 45 states and 8953 transitions. [2022-12-11 18:50:36,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 297 transitions, 1300 flow [2022-12-11 18:50:36,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 297 transitions, 1260 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-11 18:50:36,450 INFO L231 Difference]: Finished difference. Result has 269 places, 228 transitions, 840 flow [2022-12-11 18:50:36,450 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=840, PETRI_PLACES=269, PETRI_TRANSITIONS=228} [2022-12-11 18:50:36,452 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 71 predicate places. [2022-12-11 18:50:36,452 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 228 transitions, 840 flow [2022-12-11 18:50:36,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 198.41176470588235) internal successors, (6746), 34 states have internal predecessors, (6746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:36,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:36,454 INFO L214 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:36,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 18:50:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:36,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash -532051056, now seen corresponding path program 3 times [2022-12-11 18:50:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335350740] [2022-12-11 18:50:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335350740] [2022-12-11 18:50:37,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335350740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:50:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806143442] [2022-12-11 18:50:37,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 18:50:37,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:50:38,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:50:38,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 18:50:38,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 18:50:38,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 18:50:38,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-11 18:50:38,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:50:40,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-11 18:50:40,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 18:50:40,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-11 18:50:40,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 18:50:40,590 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-11 18:50:40,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-11 18:50:40,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 18:50:40,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-11 18:50:40,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-11 18:50:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 428 proven. 305 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2022-12-11 18:50:40,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:50:41,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 18:50:41,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-12-11 18:50:41,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 18:50:41,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-12-11 18:50:41,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-12-11 18:50:41,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-11 18:50:41,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 18:50:41,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-12-11 18:50:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 428 proven. 305 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2022-12-11 18:50:41,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806143442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:50:41,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:50:41,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 13] total 56 [2022-12-11 18:50:41,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552461782] [2022-12-11 18:50:41,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:50:41,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-11 18:50:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-11 18:50:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2691, Unknown=6, NotChecked=0, Total=3080 [2022-12-11 18:50:41,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 215 [2022-12-11 18:50:41,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 228 transitions, 840 flow. Second operand has 56 states, 56 states have (on average 150.60714285714286) internal successors, (8434), 56 states have internal predecessors, (8434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:41,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:41,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 215 [2022-12-11 18:50:41,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:50:51,672 INFO L130 PetriNetUnfolder]: 2125/7256 cut-off events. [2022-12-11 18:50:51,673 INFO L131 PetriNetUnfolder]: For 2828/2828 co-relation queries the response was YES. [2022-12-11 18:50:51,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15517 conditions, 7256 events. 2125/7256 cut-off events. For 2828/2828 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 38907 event pairs, 31 based on Foata normal form. 8/7164 useless extension candidates. Maximal degree in co-relation 15494. Up to 687 conditions per place. [2022-12-11 18:50:51,718 INFO L137 encePairwiseOnDemand]: 191/215 looper letters, 888 selfloop transitions, 408 changer transitions 0/1415 dead transitions. [2022-12-11 18:50:51,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1415 transitions, 6842 flow [2022-12-11 18:50:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-12-11 18:50:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-12-11 18:50:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 30073 transitions. [2022-12-11 18:50:51,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6958926298738863 [2022-12-11 18:50:51,745 INFO L175 Difference]: Start difference. First operand has 269 places, 228 transitions, 840 flow. Second operand 201 states and 30073 transitions. [2022-12-11 18:50:51,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 1415 transitions, 6842 flow [2022-12-11 18:50:51,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1415 transitions, 6727 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-12-11 18:50:51,780 INFO L231 Difference]: Finished difference. Result has 535 places, 667 transitions, 3690 flow [2022-12-11 18:50:51,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=3690, PETRI_PLACES=535, PETRI_TRANSITIONS=667} [2022-12-11 18:50:51,781 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 337 predicate places. [2022-12-11 18:50:51,781 INFO L495 AbstractCegarLoop]: Abstraction has has 535 places, 667 transitions, 3690 flow [2022-12-11 18:50:51,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 150.60714285714286) internal successors, (8434), 56 states have internal predecessors, (8434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:51,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:50:51,786 INFO L214 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:50:51,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 18:50:51,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:51,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:50:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:50:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash -454681543, now seen corresponding path program 1 times [2022-12-11 18:50:51,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:50:51,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256587249] [2022-12-11 18:50:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:50:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 3454 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:50:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256587249] [2022-12-11 18:50:53,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256587249] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:50:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133690476] [2022-12-11 18:50:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:50:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:50:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:50:53,424 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:50:53,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 18:50:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:50:53,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-11 18:50:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:50:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 3454 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:54,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:50:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 3454 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:50:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133690476] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:50:55,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:50:55,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-12-11 18:50:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996826016] [2022-12-11 18:50:55,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:50:55,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-11 18:50:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:50:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-11 18:50:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-12-11 18:50:55,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-11 18:50:55,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 667 transitions, 3690 flow. Second operand has 70 states, 70 states have (on average 198.4857142857143) internal successors, (13894), 70 states have internal predecessors, (13894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:50:55,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:50:55,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-11 18:50:55,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:51:00,412 INFO L130 PetriNetUnfolder]: 960/7881 cut-off events. [2022-12-11 18:51:00,412 INFO L131 PetriNetUnfolder]: For 129349/129381 co-relation queries the response was YES. [2022-12-11 18:51:00,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28161 conditions, 7881 events. 960/7881 cut-off events. For 129349/129381 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 35836 event pairs, 7 based on Foata normal form. 102/7975 useless extension candidates. Maximal degree in co-relation 28053. Up to 590 conditions per place. [2022-12-11 18:51:00,480 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 170 selfloop transitions, 162 changer transitions 0/892 dead transitions. [2022-12-11 18:51:00,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 892 transitions, 6026 flow [2022-12-11 18:51:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-11 18:51:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-12-11 18:51:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 19690 transitions. [2022-12-11 18:51:00,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9250645994832042 [2022-12-11 18:51:00,492 INFO L175 Difference]: Start difference. First operand has 535 places, 667 transitions, 3690 flow. Second operand 99 states and 19690 transitions. [2022-12-11 18:51:00,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 892 transitions, 6026 flow [2022-12-11 18:51:00,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 892 transitions, 5840 flow, removed 4 selfloop flow, removed 48 redundant places. [2022-12-11 18:51:00,743 INFO L231 Difference]: Finished difference. Result has 603 places, 734 transitions, 4774 flow [2022-12-11 18:51:00,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=3504, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=4774, PETRI_PLACES=603, PETRI_TRANSITIONS=734} [2022-12-11 18:51:00,744 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 405 predicate places. [2022-12-11 18:51:00,744 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 734 transitions, 4774 flow [2022-12-11 18:51:00,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 198.4857142857143) internal successors, (13894), 70 states have internal predecessors, (13894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:51:00,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:51:00,748 INFO L214 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:51:00,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 18:51:00,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-11 18:51:00,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:51:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:51:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2056445406, now seen corresponding path program 2 times [2022-12-11 18:51:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:51:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966631112] [2022-12-11 18:51:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:51:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:51:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:51:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15281 backedges. 0 proven. 15281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:51:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:51:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966631112] [2022-12-11 18:51:05,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966631112] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:51:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612912011] [2022-12-11 18:51:05,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 18:51:05,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:51:05,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:51:05,727 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:51:05,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 18:51:06,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 18:51:06,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 18:51:06,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 2428 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-11 18:51:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:51:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15281 backedges. 0 proven. 15281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:51:07,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:51:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15281 backedges. 0 proven. 15281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:51:10,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612912011] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:51:10,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:51:10,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-12-11 18:51:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014038549] [2022-12-11 18:51:10,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:51:10,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-12-11 18:51:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:51:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-12-11 18:51:10,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-12-11 18:51:10,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-11 18:51:10,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 734 transitions, 4774 flow. Second operand has 138 states, 138 states have (on average 198.47826086956522) internal successors, (27390), 138 states have internal predecessors, (27390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:51:10,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:51:10,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-11 18:51:10,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:51:30,832 INFO L130 PetriNetUnfolder]: 1878/15769 cut-off events. [2022-12-11 18:51:30,832 INFO L131 PetriNetUnfolder]: For 356527/356593 co-relation queries the response was YES. [2022-12-11 18:51:30,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59028 conditions, 15769 events. 1878/15769 cut-off events. For 356527/356593 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 72291 event pairs, 7 based on Foata normal form. 204/15965 useless extension candidates. Maximal degree in co-relation 58903. Up to 1474 conditions per place. [2022-12-11 18:51:30,979 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 340 selfloop transitions, 298 changer transitions 0/1198 dead transitions. [2022-12-11 18:51:30,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 1198 transitions, 10154 flow [2022-12-11 18:51:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-12-11 18:51:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-12-11 18:51:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 39971 transitions. [2022-12-11 18:51:30,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9249334721740137 [2022-12-11 18:51:30,997 INFO L175 Difference]: Start difference. First operand has 603 places, 734 transitions, 4774 flow. Second operand 201 states and 39971 transitions. [2022-12-11 18:51:30,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 803 places, 1198 transitions, 10154 flow [2022-12-11 18:51:31,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 1198 transitions, 9657 flow, removed 156 selfloop flow, removed 47 redundant places. [2022-12-11 18:51:31,687 INFO L231 Difference]: Finished difference. Result has 791 places, 871 transitions, 7215 flow [2022-12-11 18:51:31,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=4481, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=7215, PETRI_PLACES=791, PETRI_TRANSITIONS=871} [2022-12-11 18:51:31,688 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 593 predicate places. [2022-12-11 18:51:31,688 INFO L495 AbstractCegarLoop]: Abstraction has has 791 places, 871 transitions, 7215 flow [2022-12-11 18:51:31,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 198.47826086956522) internal successors, (27390), 138 states have internal predecessors, (27390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:51:31,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:51:31,695 INFO L214 CegarLoopForPetriNet]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-11 18:51:31,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 18:51:31,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:51:31,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:51:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:51:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash 742576875, now seen corresponding path program 3 times [2022-12-11 18:51:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:51:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805590013] [2022-12-11 18:51:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:51:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:51:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:51:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 64054 backedges. 0 proven. 64054 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 18:51:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:51:55,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805590013] [2022-12-11 18:51:55,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805590013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 18:51:55,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097556804] [2022-12-11 18:51:55,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 18:51:55,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 18:51:55,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:51:55,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 18:51:55,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 18:51:56,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-11 18:51:56,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 18:51:56,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-11 18:51:56,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 18:52:01,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-11 18:52:01,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 18:52:01,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-11 18:52:01,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 18:52:01,552 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-11 18:52:01,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-11 18:52:01,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 18:52:01,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-11 18:52:01,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-11 18:52:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 18:52:01,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-11 18:52:02,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 18:52:02,265 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-11 18:52:02,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-11 18:52:02,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 18:52:02,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-11 18:52:02,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-11 18:52:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 64054 backedges. 3880 proven. 1454 refuted. 0 times theorem prover too weak. 58720 trivial. 0 not checked. [2022-12-11 18:52:02,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 18:52:02,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)) 800))) is different from false [2022-12-11 18:52:02,850 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-12-11 18:52:02,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)) 800))) is different from false [2022-12-11 18:52:02,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1))))) is different from false [2022-12-11 18:52:03,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2809 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)) 800))) (= 800 .cse4)))) is different from false [2022-12-11 18:52:03,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2815)) .cse2)))))))) is different from false [2022-12-11 18:52:03,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2815)) .cse1)))) (= .cse4 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))) is different from false [2022-12-11 18:52:03,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= 800 .cse2) (not (= 800 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse4))))))))) is different from false [2022-12-11 18:52:03,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2815)) .cse1) 800)))))))) is different from false [2022-12-11 18:52:03,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 18:52:03,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 164 [2022-12-11 18:52:03,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 18:52:03,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 262 [2022-12-11 18:52:03,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 230 [2022-12-11 18:52:03,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 189 [2022-12-11 18:52:03,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-11 18:52:03,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 18:52:03,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 103 [2022-12-11 18:52:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64054 backedges. 1621 proven. 2216 refuted. 0 times theorem prover too weak. 58720 trivial. 1497 not checked. [2022-12-11 18:52:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097556804] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 18:52:06,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 18:52:06,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 19, 24] total 176 [2022-12-11 18:52:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274595352] [2022-12-11 18:52:06,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 18:52:06,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 176 states [2022-12-11 18:52:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:52:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2022-12-11 18:52:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4992, Invalid=22746, Unknown=20, NotChecked=3042, Total=30800 [2022-12-11 18:52:06,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 215 [2022-12-11 18:52:06,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 871 transitions, 7215 flow. Second operand has 176 states, 176 states have (on average 150.47727272727272) internal successors, (26484), 176 states have internal predecessors, (26484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 18:52:06,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:52:06,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 215 [2022-12-11 18:52:06,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand