/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 20:19:40,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 20:19:40,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 20:19:40,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 20:19:40,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 20:19:40,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 20:19:40,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 20:19:40,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 20:19:40,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 20:19:40,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 20:19:40,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 20:19:40,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 20:19:40,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 20:19:40,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 20:19:40,654 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 20:19:40,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 20:19:40,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 20:19:40,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 20:19:40,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 20:19:40,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 20:19:40,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 20:19:40,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 20:19:40,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 20:19:40,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 20:19:40,661 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 20:19:40,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 20:19:40,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 20:19:40,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 20:19:40,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 20:19:40,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 20:19:40,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:19:40,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 20:19:40,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 20:19:40,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 20:19:40,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 20:19:40,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 20:19:40,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 20:19:40,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 20:19:40,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 20:19:40,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 20:19:40,665 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 20:19:40,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 20:19:40,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 20:19:40,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 20:19:40,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 20:19:40,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 20:19:40,911 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 20:19:40,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c [2023-08-03 20:19:42,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 20:19:42,244 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 20:19:42,245 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c [2023-08-03 20:19:42,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f55d4aa/1ee1b441a1bd47828d95d3f4ddb23d01/FLAGe2076c7b8 [2023-08-03 20:19:42,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f55d4aa/1ee1b441a1bd47828d95d3f4ddb23d01 [2023-08-03 20:19:42,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 20:19:42,267 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 20:19:42,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 20:19:42,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 20:19:42,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 20:19:42,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258d2d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42, skipping insertion in model container [2023-08-03 20:19:42,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,302 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 20:19:42,453 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c[2433,2446] [2023-08-03 20:19:42,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:19:42,475 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 20:19:42,492 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c[2433,2446] [2023-08-03 20:19:42,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:19:42,504 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:19:42,505 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:19:42,510 INFO L206 MainTranslator]: Completed translation [2023-08-03 20:19:42,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42 WrapperNode [2023-08-03 20:19:42,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 20:19:42,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 20:19:42,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 20:19:42,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 20:19:42,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,544 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 172 [2023-08-03 20:19:42,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 20:19:42,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 20:19:42,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 20:19:42,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 20:19:42,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 20:19:42,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 20:19:42,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 20:19:42,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 20:19:42,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (1/1) ... [2023-08-03 20:19:42,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:19:42,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:42,608 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) [2023-08-03 20:19:42,641 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 [2023-08-03 20:19:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 20:19:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 20:19:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 20:19:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 20:19:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 20:19:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 20:19:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 20:19:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 20:19:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 20:19:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 20:19:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 20:19:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-03 20:19:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 20:19:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 20:19:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 20:19:42,658 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 20:19:42,767 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 20:19:42,769 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 20:19:43,072 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 20:19:43,205 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 20:19:43,205 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-03 20:19:43,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:19:43 BoogieIcfgContainer [2023-08-03 20:19:43,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 20:19:43,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 20:19:43,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 20:19:43,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 20:19:43,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 08:19:42" (1/3) ... [2023-08-03 20:19:43,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a460e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:19:43, skipping insertion in model container [2023-08-03 20:19:43,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:19:42" (2/3) ... [2023-08-03 20:19:43,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a460e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:19:43, skipping insertion in model container [2023-08-03 20:19:43,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:19:43" (3/3) ... [2023-08-03 20:19:43,237 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-bad-counter-queue2.wvr_bound2.c [2023-08-03 20:19:43,243 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 20:19:43,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 20:19:43,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 20:19:43,250 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 20:19:43,299 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 20:19:43,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 139 transitions, 300 flow [2023-08-03 20:19:43,404 INFO L124 PetriNetUnfolderBase]: 36/279 cut-off events. [2023-08-03 20:19:43,404 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 20:19:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 279 events. 36/279 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 864 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-03 20:19:43,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 139 transitions, 300 flow [2023-08-03 20:19:43,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 139 transitions, 300 flow [2023-08-03 20:19:43,420 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:19:43,428 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 139 transitions, 300 flow [2023-08-03 20:19:43,430 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 139 transitions, 300 flow [2023-08-03 20:19:43,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 139 transitions, 300 flow [2023-08-03 20:19:43,499 INFO L124 PetriNetUnfolderBase]: 36/279 cut-off events. [2023-08-03 20:19:43,499 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 20:19:43,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 279 events. 36/279 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 864 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-03 20:19:43,507 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-03 20:19:47,600 INFO L134 LiptonReduction]: Checked pairs total: 3118 [2023-08-03 20:19:47,601 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-03 20:19:47,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:19:47,618 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=true, 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;@6641420e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:19:47,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 20:19:47,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:19:47,623 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2023-08-03 20:19:47,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:19:47,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:47,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 20:19:47,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:47,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1800492310, now seen corresponding path program 1 times [2023-08-03 20:19:47,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:47,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681869959] [2023-08-03 20:19:47,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:47,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:19:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:47,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681869959] [2023-08-03 20:19:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681869959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:19:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 20:19:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828949057] [2023-08-03 20:19:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:47,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:19:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:47,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:19:47,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:19:47,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-03 20:19:47,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 32 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:47,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:47,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-03 20:19:47,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:47,998 INFO L124 PetriNetUnfolderBase]: 261/422 cut-off events. [2023-08-03 20:19:47,998 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 20:19:47,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 422 events. 261/422 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1605 event pairs, 86 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 692. Up to 392 conditions per place. [2023-08-03 20:19:48,002 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 26 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-03 20:19:48,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 146 flow [2023-08-03 20:19:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:19:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:19:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-03 20:19:48,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-03 20:19:48,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-03 20:19:48,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-03 20:19:48,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:48,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-03 20:19:48,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:48,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:48,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:48,029 INFO L175 Difference]: Start difference. First operand has 30 places, 32 transitions, 86 flow. Second operand 3 states and 378 transitions. [2023-08-03 20:19:48,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 146 flow [2023-08-03 20:19:48,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:19:48,033 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 92 flow [2023-08-03 20:19:48,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2023-08-03 20:19:48,037 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-03 20:19:48,038 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 92 flow [2023-08-03 20:19:48,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:48,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:48,038 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-03 20:19:48,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 20:19:48,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:48,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:48,039 INFO L85 PathProgramCache]: Analyzing trace with hash 21179411, now seen corresponding path program 1 times [2023-08-03 20:19:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:48,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380884789] [2023-08-03 20:19:48,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:48,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:19:48,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 20:19:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:19:48,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 20:19:48,108 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 20:19:48,109 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 20:19:48,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 20:19:48,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 20:19:48,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 20:19:48,112 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 20:19:48,114 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 20:19:48,114 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 20:19:48,140 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 20:19:48,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 165 transitions, 378 flow [2023-08-03 20:19:48,236 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-03 20:19:48,237 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 20:19:48,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 854 events. 137/854 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4277 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 32 conditions per place. [2023-08-03 20:19:48,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 165 transitions, 378 flow [2023-08-03 20:19:48,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 165 transitions, 378 flow [2023-08-03 20:19:48,245 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:19:48,245 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 165 transitions, 378 flow [2023-08-03 20:19:48,246 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 165 transitions, 378 flow [2023-08-03 20:19:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 165 transitions, 378 flow [2023-08-03 20:19:48,323 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-03 20:19:48,323 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 20:19:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 854 events. 137/854 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4277 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 32 conditions per place. [2023-08-03 20:19:48,341 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-03 20:19:51,996 INFO L134 LiptonReduction]: Checked pairs total: 8948 [2023-08-03 20:19:51,997 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-03 20:19:51,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:19:52,000 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=true, 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;@6641420e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:19:52,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 20:19:52,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:19:52,002 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-08-03 20:19:52,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:19:52,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:52,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 20:19:52,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:52,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1266493736, now seen corresponding path program 1 times [2023-08-03 20:19:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:52,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875454052] [2023-08-03 20:19:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:19:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875454052] [2023-08-03 20:19:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875454052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:19:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 20:19:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181238648] [2023-08-03 20:19:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:52,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:19:52,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:19:52,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:19:52,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 308 [2023-08-03 20:19:52,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:52,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:52,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 308 [2023-08-03 20:19:52,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:53,041 INFO L124 PetriNetUnfolderBase]: 8527/11039 cut-off events. [2023-08-03 20:19:53,041 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-03 20:19:53,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22384 conditions, 11039 events. 8527/11039 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47322 event pairs, 3472 based on Foata normal form. 0/6249 useless extension candidates. Maximal degree in co-relation 6836. Up to 10602 conditions per place. [2023-08-03 20:19:53,183 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-03 20:19:53,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 224 flow [2023-08-03 20:19:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:19:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:19:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-03 20:19:53,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47294372294372294 [2023-08-03 20:19:53,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-03 20:19:53,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-03 20:19:53,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:53,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-03 20:19:53,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:53,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:53,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:53,194 INFO L175 Difference]: Start difference. First operand has 42 places, 46 transitions, 140 flow. Second operand 3 states and 437 transitions. [2023-08-03 20:19:53,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 224 flow [2023-08-03 20:19:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:19:53,197 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 150 flow [2023-08-03 20:19:53,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2023-08-03 20:19:53,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-03 20:19:53,199 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 150 flow [2023-08-03 20:19:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:53,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:53,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:19:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 20:19:53,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:53,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1547189412, now seen corresponding path program 1 times [2023-08-03 20:19:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489159145] [2023-08-03 20:19:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:19:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489159145] [2023-08-03 20:19:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489159145] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:19:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244460338] [2023-08-03 20:19:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:53,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:53,304 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) [2023-08-03 20:19:53,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 20:19:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:53,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:19:53,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:19:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:19:53,407 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:19:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244460338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:19:53,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 20:19:53,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532402604] [2023-08-03 20:19:53,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:53,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:19:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:53,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:19:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:19:53,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 308 [2023-08-03 20:19:53,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:53,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:53,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 308 [2023-08-03 20:19:53,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:54,410 INFO L124 PetriNetUnfolderBase]: 8489/11055 cut-off events. [2023-08-03 20:19:54,411 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2023-08-03 20:19:54,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22381 conditions, 11055 events. 8489/11055 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49743 event pairs, 3438 based on Foata normal form. 0/6303 useless extension candidates. Maximal degree in co-relation 13501. Up to 10391 conditions per place. [2023-08-03 20:19:54,485 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 42 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-03 20:19:54,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 254 flow [2023-08-03 20:19:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:19:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:19:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-08-03 20:19:54,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-03 20:19:54,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-08-03 20:19:54,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-08-03 20:19:54,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:54,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-08-03 20:19:54,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:54,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:54,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:54,493 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 150 flow. Second operand 3 states and 440 transitions. [2023-08-03 20:19:54,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 254 flow [2023-08-03 20:19:54,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:19:54,497 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 160 flow [2023-08-03 20:19:54,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-03 20:19:54,498 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-03 20:19:54,499 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 160 flow [2023-08-03 20:19:54,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:54,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:54,499 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 20:19:54,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 20:19:54,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:54,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:54,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 561084598, now seen corresponding path program 1 times [2023-08-03 20:19:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809392346] [2023-08-03 20:19:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:19:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809392346] [2023-08-03 20:19:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809392346] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:19:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453469247] [2023-08-03 20:19:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:54,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:54,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:54,769 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) [2023-08-03 20:19:54,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 20:19:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:54,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:19:54,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:19:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:19:54,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:19:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453469247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:19:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:19:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799756653] [2023-08-03 20:19:54,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:54,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:19:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:19:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:19:54,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-03 20:19:54,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:54,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:54,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-03 20:19:54,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:55,817 INFO L124 PetriNetUnfolderBase]: 8465/11019 cut-off events. [2023-08-03 20:19:55,817 INFO L125 PetriNetUnfolderBase]: For 1131/1131 co-relation queries the response was YES. [2023-08-03 20:19:55,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22581 conditions, 11019 events. 8465/11019 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 49090 event pairs, 2427 based on Foata normal form. 9/6432 useless extension candidates. Maximal degree in co-relation 6914. Up to 10492 conditions per place. [2023-08-03 20:19:55,879 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 41 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-03 20:19:55,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 265 flow [2023-08-03 20:19:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:19:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:19:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 700 transitions. [2023-08-03 20:19:55,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-08-03 20:19:55,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 700 transitions. [2023-08-03 20:19:55,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 700 transitions. [2023-08-03 20:19:55,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:55,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 700 transitions. [2023-08-03 20:19:55,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:55,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:55,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:55,888 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 160 flow. Second operand 5 states and 700 transitions. [2023-08-03 20:19:55,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 265 flow [2023-08-03 20:19:55,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:19:55,893 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 169 flow [2023-08-03 20:19:55,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-03 20:19:55,894 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-03 20:19:55,894 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 169 flow [2023-08-03 20:19:55,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:55,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:55,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:19:55,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 20:19:56,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:56,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:56,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2122819594, now seen corresponding path program 1 times [2023-08-03 20:19:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780156933] [2023-08-03 20:19:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:19:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780156933] [2023-08-03 20:19:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780156933] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:19:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457789792] [2023-08-03 20:19:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:56,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:56,172 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) [2023-08-03 20:19:56,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 20:19:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:56,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:19:56,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:19:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 20:19:56,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:19:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457789792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:56,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:19:56,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 20:19:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018367451] [2023-08-03 20:19:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:56,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:19:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:19:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:19:56,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 308 [2023-08-03 20:19:56,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:56,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:56,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 308 [2023-08-03 20:19:56,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:57,105 INFO L124 PetriNetUnfolderBase]: 7234/9557 cut-off events. [2023-08-03 20:19:57,105 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2023-08-03 20:19:57,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19564 conditions, 9557 events. 7234/9557 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 43493 event pairs, 2468 based on Foata normal form. 0/5683 useless extension candidates. Maximal degree in co-relation 6706. Up to 6765 conditions per place. [2023-08-03 20:19:57,154 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-03 20:19:57,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 311 flow [2023-08-03 20:19:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:19:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:19:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-03 20:19:57,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48268398268398266 [2023-08-03 20:19:57,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-03 20:19:57,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-03 20:19:57,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:57,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-03 20:19:57,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:57,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:57,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:57,160 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 169 flow. Second operand 3 states and 446 transitions. [2023-08-03 20:19:57,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 311 flow [2023-08-03 20:19:57,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 304 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:19:57,164 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 174 flow [2023-08-03 20:19:57,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2023-08-03 20:19:57,167 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-03 20:19:57,167 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 174 flow [2023-08-03 20:19:57,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:57,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:57,167 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:19:57,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 20:19:57,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:57,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:57,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1355745063, now seen corresponding path program 1 times [2023-08-03 20:19:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651041566] [2023-08-03 20:19:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:19:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651041566] [2023-08-03 20:19:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651041566] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:19:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688370044] [2023-08-03 20:19:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:57,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:57,456 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) [2023-08-03 20:19:57,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 20:19:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:57,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:19:57,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:19:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:19:57,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:19:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:19:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688370044] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:19:57,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:19:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:19:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517579666] [2023-08-03 20:19:57,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:19:57,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:19:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:19:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:19:57,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-03 20:19:57,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:57,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:57,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-03 20:19:57,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:58,370 INFO L124 PetriNetUnfolderBase]: 6553/8621 cut-off events. [2023-08-03 20:19:58,370 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2023-08-03 20:19:58,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18207 conditions, 8621 events. 6553/8621 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 38196 event pairs, 1930 based on Foata normal form. 3/5261 useless extension candidates. Maximal degree in co-relation 5227. Up to 8211 conditions per place. [2023-08-03 20:19:58,416 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 42 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-08-03 20:19:58,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 272 flow [2023-08-03 20:19:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:19:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:19:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2023-08-03 20:19:58,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2023-08-03 20:19:58,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2023-08-03 20:19:58,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2023-08-03 20:19:58,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:58,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2023-08-03 20:19:58,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:58,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:58,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:58,424 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 174 flow. Second operand 4 states and 568 transitions. [2023-08-03 20:19:58,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 272 flow [2023-08-03 20:19:58,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:19:58,428 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 170 flow [2023-08-03 20:19:58,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-03 20:19:58,429 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-03 20:19:58,429 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 170 flow [2023-08-03 20:19:58,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:58,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:58,430 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:19:58,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 20:19:58,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:58,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:58,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -346580108, now seen corresponding path program 1 times [2023-08-03 20:19:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900945548] [2023-08-03 20:19:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:19:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900945548] [2023-08-03 20:19:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900945548] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:19:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849979649] [2023-08-03 20:19:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:58,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:58,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:58,703 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) [2023-08-03 20:19:58,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 20:19:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:58,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:19:58,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:19:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:19:58,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:19:58,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849979649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:19:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:19:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962786596] [2023-08-03 20:19:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:58,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:19:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:19:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:19:58,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-03 20:19:58,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:58,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:58,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-03 20:19:58,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:19:59,433 INFO L124 PetriNetUnfolderBase]: 6121/8081 cut-off events. [2023-08-03 20:19:59,433 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2023-08-03 20:19:59,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16974 conditions, 8081 events. 6121/8081 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 36145 event pairs, 400 based on Foata normal form. 81/5015 useless extension candidates. Maximal degree in co-relation 7300. Up to 6966 conditions per place. [2023-08-03 20:19:59,473 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 54 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-03 20:19:59,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 324 flow [2023-08-03 20:19:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:19:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:19:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-08-03 20:19:59,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623376623376623 [2023-08-03 20:19:59,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-08-03 20:19:59,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-08-03 20:19:59,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:19:59,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-08-03 20:19:59,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:59,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:59,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:59,480 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 170 flow. Second operand 5 states and 712 transitions. [2023-08-03 20:19:59,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 324 flow [2023-08-03 20:19:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 20:19:59,484 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 175 flow [2023-08-03 20:19:59,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-03 20:19:59,485 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-03 20:19:59,485 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 175 flow [2023-08-03 20:19:59,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:59,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:19:59,486 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:19:59,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 20:19:59,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:59,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:19:59,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:19:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 942612250, now seen corresponding path program 1 times [2023-08-03 20:19:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:19:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164298669] [2023-08-03 20:19:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:19:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:19:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:19:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164298669] [2023-08-03 20:19:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164298669] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:19:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119656757] [2023-08-03 20:19:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:19:59,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:19:59,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:19:59,731 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) [2023-08-03 20:19:59,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 20:19:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:19:59,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:19:59,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:19:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:19:59,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:19:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119656757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:19:59,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:19:59,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 20:19:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991298872] [2023-08-03 20:19:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:19:59,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:19:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:19:59,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:19:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:19:59,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 308 [2023-08-03 20:19:59,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:19:59,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:19:59,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 308 [2023-08-03 20:19:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:00,389 INFO L124 PetriNetUnfolderBase]: 5998/8010 cut-off events. [2023-08-03 20:20:00,389 INFO L125 PetriNetUnfolderBase]: For 1518/1518 co-relation queries the response was YES. [2023-08-03 20:20:00,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17009 conditions, 8010 events. 5998/8010 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36298 event pairs, 2243 based on Foata normal form. 0/5019 useless extension candidates. Maximal degree in co-relation 7491. Up to 5807 conditions per place. [2023-08-03 20:20:00,419 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-03 20:20:00,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 317 flow [2023-08-03 20:20:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:20:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:20:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-03 20:20:00,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48268398268398266 [2023-08-03 20:20:00,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-03 20:20:00,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-03 20:20:00,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:00,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-03 20:20:00,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:00,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:00,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:00,424 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 175 flow. Second operand 3 states and 446 transitions. [2023-08-03 20:20:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 317 flow [2023-08-03 20:20:00,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 310 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:20:00,428 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 180 flow [2023-08-03 20:20:00,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-08-03 20:20:00,429 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-03 20:20:00,429 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 180 flow [2023-08-03 20:20:00,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:00,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:00,430 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:00,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:00,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:00,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:00,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1774037534, now seen corresponding path program 1 times [2023-08-03 20:20:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050588708] [2023-08-03 20:20:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:20:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050588708] [2023-08-03 20:20:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050588708] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787814792] [2023-08-03 20:20:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:00,682 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) [2023-08-03 20:20:00,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 20:20:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:00,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:20:00,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:20:00,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:20:00,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787814792] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:00,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:20:00,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211845296] [2023-08-03 20:20:00,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:00,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:00,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-03 20:20:00,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:00,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:00,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-03 20:20:00,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:01,293 INFO L124 PetriNetUnfolderBase]: 5683/7587 cut-off events. [2023-08-03 20:20:01,293 INFO L125 PetriNetUnfolderBase]: For 1230/1230 co-relation queries the response was YES. [2023-08-03 20:20:01,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16364 conditions, 7587 events. 5683/7587 cut-off events. For 1230/1230 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34712 event pairs, 1645 based on Foata normal form. 27/4834 useless extension candidates. Maximal degree in co-relation 10429. Up to 6554 conditions per place. [2023-08-03 20:20:01,326 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 51 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-03 20:20:01,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 312 flow [2023-08-03 20:20:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:20:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:20:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-08-03 20:20:01,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2023-08-03 20:20:01,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-08-03 20:20:01,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-08-03 20:20:01,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:01,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-08-03 20:20:01,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:01,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:01,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:01,332 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 180 flow. Second operand 4 states and 576 transitions. [2023-08-03 20:20:01,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 312 flow [2023-08-03 20:20:01,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:20:01,355 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 176 flow [2023-08-03 20:20:01,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-03 20:20:01,355 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-03 20:20:01,356 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 176 flow [2023-08-03 20:20:01,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:01,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:01,356 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:01,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:01,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:01,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:01,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1302967537, now seen corresponding path program 1 times [2023-08-03 20:20:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496858188] [2023-08-03 20:20:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:20:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496858188] [2023-08-03 20:20:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496858188] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596541714] [2023-08-03 20:20:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:01,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:01,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:01,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:01,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 20:20:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:01,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:20:01,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:20:01,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:20:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596541714] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:01,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:01,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:20:01,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968422226] [2023-08-03 20:20:01,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:01,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:01,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-03 20:20:01,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:01,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:01,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-03 20:20:01,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:02,100 INFO L124 PetriNetUnfolderBase]: 4137/5531 cut-off events. [2023-08-03 20:20:02,100 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2023-08-03 20:20:02,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11924 conditions, 5531 events. 4137/5531 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22733 event pairs, 747 based on Foata normal form. 108/3587 useless extension candidates. Maximal degree in co-relation 10510. Up to 2082 conditions per place. [2023-08-03 20:20:02,122 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 57 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-03 20:20:02,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 350 flow [2023-08-03 20:20:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:20:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:20:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-03 20:20:02,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2023-08-03 20:20:02,124 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-03 20:20:02,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-03 20:20:02,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:02,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-03 20:20:02,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,127 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,127 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 176 flow. Second operand 4 states and 583 transitions. [2023-08-03 20:20:02,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 350 flow [2023-08-03 20:20:02,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 344 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:20:02,135 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 190 flow [2023-08-03 20:20:02,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-03 20:20:02,135 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-03 20:20:02,135 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 190 flow [2023-08-03 20:20:02,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:02,136 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:02,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 20:20:02,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:02,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash -884809280, now seen corresponding path program 1 times [2023-08-03 20:20:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896284515] [2023-08-03 20:20:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:20:02,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:02,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896284515] [2023-08-03 20:20:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896284515] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:02,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264755527] [2023-08-03 20:20:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:02,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:02,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:02,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:02,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 20:20:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:02,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:20:02,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:20:02,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:20:02,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264755527] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:02,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:02,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 20:20:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056488981] [2023-08-03 20:20:02,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:02,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:02,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:02,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-03 20:20:02,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:02,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-03 20:20:02,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:02,917 INFO L124 PetriNetUnfolderBase]: 4121/5504 cut-off events. [2023-08-03 20:20:02,918 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2023-08-03 20:20:02,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12572 conditions, 5504 events. 4121/5504 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22595 event pairs, 1861 based on Foata normal form. 13/3473 useless extension candidates. Maximal degree in co-relation 11156. Up to 4663 conditions per place. [2023-08-03 20:20:02,979 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 57 selfloop transitions, 3 changer transitions 2/70 dead transitions. [2023-08-03 20:20:02,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 366 flow [2023-08-03 20:20:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:20:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:20:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-03 20:20:02,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2023-08-03 20:20:02,982 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-03 20:20:02,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-03 20:20:02,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:02,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-03 20:20:02,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,986 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 190 flow. Second operand 4 states and 583 transitions. [2023-08-03 20:20:02,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 366 flow [2023-08-03 20:20:02,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:20:02,995 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 194 flow [2023-08-03 20:20:02,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-03 20:20:02,997 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-08-03 20:20:02,997 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 194 flow [2023-08-03 20:20:02,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:02,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:02,999 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:03,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-03 20:20:03,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:03,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:03,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1380656432, now seen corresponding path program 1 times [2023-08-03 20:20:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456009085] [2023-08-03 20:20:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 20:20:03,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:03,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456009085] [2023-08-03 20:20:03,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456009085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:20:03,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:20:03,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 20:20:03,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020992290] [2023-08-03 20:20:03,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:03,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:20:03,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:03,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:20:03,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:20:03,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 308 [2023-08-03 20:20:03,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:03,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:03,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 308 [2023-08-03 20:20:03,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:03,780 INFO L124 PetriNetUnfolderBase]: 4908/6389 cut-off events. [2023-08-03 20:20:03,780 INFO L125 PetriNetUnfolderBase]: For 3425/3425 co-relation queries the response was YES. [2023-08-03 20:20:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14915 conditions, 6389 events. 4908/6389 cut-off events. For 3425/3425 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 25204 event pairs, 500 based on Foata normal form. 1/3951 useless extension candidates. Maximal degree in co-relation 14627. Up to 5460 conditions per place. [2023-08-03 20:20:03,807 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 67 selfloop transitions, 5 changer transitions 1/81 dead transitions. [2023-08-03 20:20:03,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 499 flow [2023-08-03 20:20:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:20:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:20:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-03 20:20:03,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2023-08-03 20:20:03,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-03 20:20:03,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-03 20:20:03,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:03,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-03 20:20:03,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:03,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:03,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:03,811 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 194 flow. Second operand 3 states and 471 transitions. [2023-08-03 20:20:03,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 499 flow [2023-08-03 20:20:03,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 483 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-03 20:20:03,817 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 219 flow [2023-08-03 20:20:03,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-03 20:20:03,818 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-08-03 20:20:03,818 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 219 flow [2023-08-03 20:20:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:03,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:03,819 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:03,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 20:20:03,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:03,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:03,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1663504068, now seen corresponding path program 1 times [2023-08-03 20:20:03,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935023454] [2023-08-03 20:20:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:20:03,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935023454] [2023-08-03 20:20:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935023454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:20:03,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:20:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:20:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152655838] [2023-08-03 20:20:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:03,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:04,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 308 [2023-08-03 20:20:04,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:04,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:04,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 308 [2023-08-03 20:20:04,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:05,052 INFO L124 PetriNetUnfolderBase]: 9149/12711 cut-off events. [2023-08-03 20:20:05,052 INFO L125 PetriNetUnfolderBase]: For 7978/7978 co-relation queries the response was YES. [2023-08-03 20:20:05,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34052 conditions, 12711 events. 9149/12711 cut-off events. For 7978/7978 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 65724 event pairs, 4519 based on Foata normal form. 364/13075 useless extension candidates. Maximal degree in co-relation 33438. Up to 6237 conditions per place. [2023-08-03 20:20:05,123 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 113 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2023-08-03 20:20:05,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 797 flow [2023-08-03 20:20:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 732 transitions. [2023-08-03 20:20:05,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753246753246753 [2023-08-03 20:20:05,125 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 732 transitions. [2023-08-03 20:20:05,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 732 transitions. [2023-08-03 20:20:05,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:05,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 732 transitions. [2023-08-03 20:20:05,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:05,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:05,129 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:05,129 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 219 flow. Second operand 5 states and 732 transitions. [2023-08-03 20:20:05,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 797 flow [2023-08-03 20:20:05,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 124 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:20:05,170 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2023-08-03 20:20:05,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-08-03 20:20:05,170 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-03 20:20:05,170 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2023-08-03 20:20:05,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:05,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:05,171 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 20:20:05,171 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:05,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1917002247, now seen corresponding path program 1 times [2023-08-03 20:20:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645826642] [2023-08-03 20:20:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:20:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645826642] [2023-08-03 20:20:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645826642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:20:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:20:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:20:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135021764] [2023-08-03 20:20:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:05,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:05,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 308 [2023-08-03 20:20:05,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:05,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:05,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 308 [2023-08-03 20:20:05,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:06,123 INFO L124 PetriNetUnfolderBase]: 7573/10627 cut-off events. [2023-08-03 20:20:06,124 INFO L125 PetriNetUnfolderBase]: For 8954/9342 co-relation queries the response was YES. [2023-08-03 20:20:06,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28460 conditions, 10627 events. 7573/10627 cut-off events. For 8954/9342 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 56051 event pairs, 2835 based on Foata normal form. 674/11301 useless extension candidates. Maximal degree in co-relation 27880. Up to 6239 conditions per place. [2023-08-03 20:20:06,176 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 106 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2023-08-03 20:20:06,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 771 flow [2023-08-03 20:20:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2023-08-03 20:20:06,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2023-08-03 20:20:06,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2023-08-03 20:20:06,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2023-08-03 20:20:06,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:06,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2023-08-03 20:20:06,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:06,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:06,182 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:06,182 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 5 states and 728 transitions. [2023-08-03 20:20:06,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 771 flow [2023-08-03 20:20:06,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 767 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:20:06,215 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 261 flow [2023-08-03 20:20:06,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-03 20:20:06,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-08-03 20:20:06,216 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 261 flow [2023-08-03 20:20:06,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:06,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:06,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:06,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 20:20:06,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:06,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1351086289, now seen corresponding path program 1 times [2023-08-03 20:20:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507624966] [2023-08-03 20:20:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:20:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507624966] [2023-08-03 20:20:06,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507624966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:20:06,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:20:06,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:20:06,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292266658] [2023-08-03 20:20:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:06,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:06,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:06,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 308 [2023-08-03 20:20:06,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:06,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:06,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 308 [2023-08-03 20:20:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:07,175 INFO L124 PetriNetUnfolderBase]: 6361/9105 cut-off events. [2023-08-03 20:20:07,175 INFO L125 PetriNetUnfolderBase]: For 8957/9517 co-relation queries the response was YES. [2023-08-03 20:20:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25002 conditions, 9105 events. 6361/9105 cut-off events. For 8957/9517 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 47797 event pairs, 3010 based on Foata normal form. 762/9867 useless extension candidates. Maximal degree in co-relation 24460. Up to 6257 conditions per place. [2023-08-03 20:20:07,207 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 99 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2023-08-03 20:20:07,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 733 flow [2023-08-03 20:20:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-08-03 20:20:07,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4694805194805195 [2023-08-03 20:20:07,209 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-08-03 20:20:07,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-08-03 20:20:07,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:07,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-08-03 20:20:07,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:07,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:07,212 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:07,212 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 261 flow. Second operand 5 states and 723 transitions. [2023-08-03 20:20:07,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 733 flow [2023-08-03 20:20:07,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 20:20:07,238 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 275 flow [2023-08-03 20:20:07,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2023-08-03 20:20:07,238 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-08-03 20:20:07,239 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 275 flow [2023-08-03 20:20:07,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:07,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:07,239 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:07,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 20:20:07,239 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:07,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash -392283458, now seen corresponding path program 1 times [2023-08-03 20:20:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:07,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254263551] [2023-08-03 20:20:07,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:07,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:07,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:07,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254263551] [2023-08-03 20:20:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254263551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:20:07,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:20:07,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:20:07,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563066067] [2023-08-03 20:20:07,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:07,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:20:07,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 308 [2023-08-03 20:20:07,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:07,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:07,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 308 [2023-08-03 20:20:07,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:08,028 INFO L124 PetriNetUnfolderBase]: 5583/7837 cut-off events. [2023-08-03 20:20:08,028 INFO L125 PetriNetUnfolderBase]: For 9502/9931 co-relation queries the response was YES. [2023-08-03 20:20:08,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22490 conditions, 7837 events. 5583/7837 cut-off events. For 9502/9931 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 38942 event pairs, 2646 based on Foata normal form. 524/8361 useless extension candidates. Maximal degree in co-relation 22054. Up to 6361 conditions per place. [2023-08-03 20:20:08,074 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 43 selfloop transitions, 2 changer transitions 53/105 dead transitions. [2023-08-03 20:20:08,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 696 flow [2023-08-03 20:20:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-08-03 20:20:08,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662337662337662 [2023-08-03 20:20:08,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-08-03 20:20:08,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-08-03 20:20:08,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:08,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-08-03 20:20:08,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:08,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:08,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:08,080 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 275 flow. Second operand 5 states and 718 transitions. [2023-08-03 20:20:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 696 flow [2023-08-03 20:20:08,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 685 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-03 20:20:08,111 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 242 flow [2023-08-03 20:20:08,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2023-08-03 20:20:08,111 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2023-08-03 20:20:08,111 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 242 flow [2023-08-03 20:20:08,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:08,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:08,112 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:08,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-03 20:20:08,112 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:08,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash -291310727, now seen corresponding path program 1 times [2023-08-03 20:20:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128697508] [2023-08-03 20:20:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 20:20:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128697508] [2023-08-03 20:20:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128697508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019634810] [2023-08-03 20:20:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:08,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:08,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:08,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:08,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 20:20:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:08,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:20:08,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 20:20:08,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 20:20:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019634810] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:20:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-03 20:20:08,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160069420] [2023-08-03 20:20:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:08,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:08,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:08,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-03 20:20:08,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 308 [2023-08-03 20:20:08,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:08,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:08,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 308 [2023-08-03 20:20:08,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:09,048 INFO L124 PetriNetUnfolderBase]: 5240/6997 cut-off events. [2023-08-03 20:20:09,048 INFO L125 PetriNetUnfolderBase]: For 5478/5478 co-relation queries the response was YES. [2023-08-03 20:20:09,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19424 conditions, 6997 events. 5240/6997 cut-off events. For 5478/5478 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 30906 event pairs, 1734 based on Foata normal form. 371/7368 useless extension candidates. Maximal degree in co-relation 19391. Up to 5035 conditions per place. [2023-08-03 20:20:09,080 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 70 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-03 20:20:09,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 541 flow [2023-08-03 20:20:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-08-03 20:20:09,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435064935064935 [2023-08-03 20:20:09,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-08-03 20:20:09,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-08-03 20:20:09,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:09,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-08-03 20:20:09,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:09,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:09,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:09,086 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 242 flow. Second operand 5 states and 683 transitions. [2023-08-03 20:20:09,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 541 flow [2023-08-03 20:20:09,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 515 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-03 20:20:09,111 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 243 flow [2023-08-03 20:20:09,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-08-03 20:20:09,111 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-03 20:20:09,111 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 243 flow [2023-08-03 20:20:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:09,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:09,112 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:09,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:09,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-03 20:20:09,318 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:09,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash -39744240, now seen corresponding path program 1 times [2023-08-03 20:20:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:09,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604323657] [2023-08-03 20:20:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604323657] [2023-08-03 20:20:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604323657] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697540415] [2023-08-03 20:20:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:09,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:09,433 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:09,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-03 20:20:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:09,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:20:09,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:09,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697540415] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:09,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:20:09,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-03 20:20:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271299390] [2023-08-03 20:20:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:09,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-03 20:20:09,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 308 [2023-08-03 20:20:09,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:09,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:09,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 308 [2023-08-03 20:20:09,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:10,173 INFO L124 PetriNetUnfolderBase]: 4518/6110 cut-off events. [2023-08-03 20:20:10,174 INFO L125 PetriNetUnfolderBase]: For 5808/6498 co-relation queries the response was YES. [2023-08-03 20:20:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17938 conditions, 6110 events. 4518/6110 cut-off events. For 5808/6498 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 27088 event pairs, 1697 based on Foata normal form. 991/7101 useless extension candidates. Maximal degree in co-relation 17905. Up to 4502 conditions per place. [2023-08-03 20:20:10,203 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 75 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-08-03 20:20:10,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 571 flow [2023-08-03 20:20:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-08-03 20:20:10,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2023-08-03 20:20:10,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-08-03 20:20:10,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-08-03 20:20:10,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:10,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-08-03 20:20:10,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:10,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:10,210 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:10,210 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 243 flow. Second operand 5 states and 685 transitions. [2023-08-03 20:20:10,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 571 flow [2023-08-03 20:20:10,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 87 transitions, 554 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-03 20:20:10,220 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 253 flow [2023-08-03 20:20:10,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2023-08-03 20:20:10,221 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-08-03 20:20:10,221 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 253 flow [2023-08-03 20:20:10,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:10,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:10,222 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:10,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:10,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:10,429 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:10,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1701787672, now seen corresponding path program 1 times [2023-08-03 20:20:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947370068] [2023-08-03 20:20:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:20:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947370068] [2023-08-03 20:20:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947370068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292458021] [2023-08-03 20:20:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:10,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:10,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 20:20:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:10,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:20:10,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:20:10,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:20:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292458021] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:10,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-08-03 20:20:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536397733] [2023-08-03 20:20:10,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:10,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-03 20:20:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:10,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-03 20:20:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-03 20:20:10,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 308 [2023-08-03 20:20:10,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 128.88888888888889) internal successors, (1160), 9 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:10,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:10,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 308 [2023-08-03 20:20:10,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:11,405 INFO L124 PetriNetUnfolderBase]: 4073/5613 cut-off events. [2023-08-03 20:20:11,405 INFO L125 PetriNetUnfolderBase]: For 6987/8280 co-relation queries the response was YES. [2023-08-03 20:20:11,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17338 conditions, 5613 events. 4073/5613 cut-off events. For 6987/8280 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 24565 event pairs, 1421 based on Foata normal form. 1555/7168 useless extension candidates. Maximal degree in co-relation 17304. Up to 4201 conditions per place. [2023-08-03 20:20:11,444 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 71 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-08-03 20:20:11,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 547 flow [2023-08-03 20:20:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2023-08-03 20:20:11,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2023-08-03 20:20:11,447 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2023-08-03 20:20:11,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2023-08-03 20:20:11,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:11,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2023-08-03 20:20:11,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:11,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:11,451 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:11,451 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 253 flow. Second operand 5 states and 680 transitions. [2023-08-03 20:20:11,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 547 flow [2023-08-03 20:20:11,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 530 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-03 20:20:11,462 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 263 flow [2023-08-03 20:20:11,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-03 20:20:11,463 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-03 20:20:11,463 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 263 flow [2023-08-03 20:20:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 128.88888888888889) internal successors, (1160), 9 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:11,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:11,464 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:11,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:11,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:11,669 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:11,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -874473473, now seen corresponding path program 1 times [2023-08-03 20:20:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019625867] [2023-08-03 20:20:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-03 20:20:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019625867] [2023-08-03 20:20:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019625867] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814928077] [2023-08-03 20:20:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:11,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:11,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 20:20:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:11,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:20:11,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-03 20:20:11,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-03 20:20:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814928077] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:11,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:20:11,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-03 20:20:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802985595] [2023-08-03 20:20:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:20:11,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:20:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:20:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-03 20:20:12,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 308 [2023-08-03 20:20:12,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:12,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:12,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 308 [2023-08-03 20:20:12,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:12,593 INFO L124 PetriNetUnfolderBase]: 3796/5286 cut-off events. [2023-08-03 20:20:12,593 INFO L125 PetriNetUnfolderBase]: For 8375/10240 co-relation queries the response was YES. [2023-08-03 20:20:12,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17296 conditions, 5286 events. 3796/5286 cut-off events. For 8375/10240 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23197 event pairs, 1541 based on Foata normal form. 2093/7379 useless extension candidates. Maximal degree in co-relation 17261. Up to 4094 conditions per place. [2023-08-03 20:20:12,620 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 70 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-03 20:20:12,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 82 transitions, 552 flow [2023-08-03 20:20:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:20:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:20:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-03 20:20:12,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025974025974024 [2023-08-03 20:20:12,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-03 20:20:12,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-03 20:20:12,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:12,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-03 20:20:12,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:12,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:12,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:12,625 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 263 flow. Second operand 5 states and 678 transitions. [2023-08-03 20:20:12,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 82 transitions, 552 flow [2023-08-03 20:20:12,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 82 transitions, 535 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-03 20:20:12,637 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 273 flow [2023-08-03 20:20:12,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-03 20:20:12,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-08-03 20:20:12,637 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 273 flow [2023-08-03 20:20:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:12,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:12,638 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:12,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:12,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-03 20:20:12,843 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:12,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1608375855, now seen corresponding path program 1 times [2023-08-03 20:20:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235980302] [2023-08-03 20:20:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:20:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235980302] [2023-08-03 20:20:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235980302] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458929032] [2023-08-03 20:20:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:13,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:13,993 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:13,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 20:20:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:14,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:20:14,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:14,196 INFO L351 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 11 treesize of output 7 [2023-08-03 20:20:14,245 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:20:14,336 INFO L351 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 14 treesize of output 16 [2023-08-03 20:20:14,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:20:14,462 INFO L351 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 [2023-08-03 20:20:14,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:20:14,495 INFO L351 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 [2023-08-03 20:20:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:20:14,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:14,851 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 1))) (forall ((v_ArrVal_590 (Array Int Int))) (<= c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:20:14,960 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_590 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 1))) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)))))) is different from false [2023-08-03 20:20:14,982 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (< (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0 1))))) is different from false [2023-08-03 20:20:15,000 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 .cse1) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (< (* 2 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~counter~0 .cse1 1)))))) is different from false [2023-08-03 20:20:15,017 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (<= (+ .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0) (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (< (* 2 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)) (+ .cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~counter~0 1)))))) is different from false [2023-08-03 20:20:15,035 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_587) c_~A~0.base) c_~A~0.offset)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_588))) (< (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_587) c_~A~0.base) c_~A~0.offset) 1))))) is different from false [2023-08-03 20:20:15,141 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:20:15,142 INFO L351 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 68 treesize of output 45 [2023-08-03 20:20:15,154 INFO L351 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 364 treesize of output 316 [2023-08-03 20:20:15,167 INFO L351 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 37 treesize of output 33 [2023-08-03 20:20:15,173 INFO L351 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 33 treesize of output 29 [2023-08-03 20:20:15,175 INFO L351 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 59 treesize of output 55 [2023-08-03 20:20:15,204 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:20:15,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 46 [2023-08-03 20:20:15,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:20:15,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:20:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 7 trivial. 13 not checked. [2023-08-03 20:20:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458929032] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:15,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 35 [2023-08-03 20:20:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694134360] [2023-08-03 20:20:15,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:15,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-03 20:20:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-03 20:20:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=779, Unknown=35, NotChecked=378, Total=1332 [2023-08-03 20:20:15,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 308 [2023-08-03 20:20:15,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 273 flow. Second operand has 37 states, 37 states have (on average 92.75675675675676) internal successors, (3432), 37 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:15,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:15,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 308 [2023-08-03 20:20:15,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:18,104 INFO L124 PetriNetUnfolderBase]: 11757/15942 cut-off events. [2023-08-03 20:20:18,105 INFO L125 PetriNetUnfolderBase]: For 22032/22032 co-relation queries the response was YES. [2023-08-03 20:20:18,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54214 conditions, 15942 events. 11757/15942 cut-off events. For 22032/22032 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 74478 event pairs, 1321 based on Foata normal form. 1/15938 useless extension candidates. Maximal degree in co-relation 54178. Up to 11780 conditions per place. [2023-08-03 20:20:18,181 INFO L140 encePairwiseOnDemand]: 287/308 looper letters, 221 selfloop transitions, 75 changer transitions 1/301 dead transitions. [2023-08-03 20:20:18,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 301 transitions, 2163 flow [2023-08-03 20:20:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 20:20:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 20:20:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1712 transitions. [2023-08-03 20:20:18,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3474025974025974 [2023-08-03 20:20:18,186 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1712 transitions. [2023-08-03 20:20:18,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1712 transitions. [2023-08-03 20:20:18,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:18,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1712 transitions. [2023-08-03 20:20:18,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 107.0) internal successors, (1712), 16 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:18,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 308.0) internal successors, (5236), 17 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:18,193 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 308.0) internal successors, (5236), 17 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:18,193 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 273 flow. Second operand 16 states and 1712 transitions. [2023-08-03 20:20:18,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 301 transitions, 2163 flow [2023-08-03 20:20:18,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 301 transitions, 2114 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-03 20:20:18,218 INFO L231 Difference]: Finished difference. Result has 92 places, 125 transitions, 871 flow [2023-08-03 20:20:18,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=871, PETRI_PLACES=92, PETRI_TRANSITIONS=125} [2023-08-03 20:20:18,218 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2023-08-03 20:20:18,219 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 125 transitions, 871 flow [2023-08-03 20:20:18,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 92.75675675675676) internal successors, (3432), 37 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:18,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:18,219 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:18,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:18,420 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:18,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash -567813045, now seen corresponding path program 2 times [2023-08-03 20:20:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857279287] [2023-08-03 20:20:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:20:19,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857279287] [2023-08-03 20:20:19,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857279287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296659243] [2023-08-03 20:20:19,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:20:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:19,189 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:19,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 20:20:19,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:20:19,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:20:19,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-03 20:20:19,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:20:19,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:19,743 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:20:19,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 58 [2023-08-03 20:20:19,988 INFO L322 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-08-03 20:20:19,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-08-03 20:20:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:20:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296659243] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:20,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-03 20:20:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133475612] [2023-08-03 20:20:20,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:20,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 20:20:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:20,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 20:20:20,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-08-03 20:20:20,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 308 [2023-08-03 20:20:20,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 125 transitions, 871 flow. Second operand has 19 states, 19 states have (on average 123.52631578947368) internal successors, (2347), 19 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:20,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:20,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 308 [2023-08-03 20:20:20,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:23,112 INFO L124 PetriNetUnfolderBase]: 13646/18666 cut-off events. [2023-08-03 20:20:23,113 INFO L125 PetriNetUnfolderBase]: For 55591/55619 co-relation queries the response was YES. [2023-08-03 20:20:23,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78762 conditions, 18666 events. 13646/18666 cut-off events. For 55591/55619 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 89996 event pairs, 3127 based on Foata normal form. 4/18666 useless extension candidates. Maximal degree in co-relation 78718. Up to 16166 conditions per place. [2023-08-03 20:20:23,290 INFO L140 encePairwiseOnDemand]: 298/308 looper letters, 242 selfloop transitions, 81 changer transitions 1/328 dead transitions. [2023-08-03 20:20:23,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 328 transitions, 2913 flow [2023-08-03 20:20:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 20:20:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 20:20:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1755 transitions. [2023-08-03 20:20:23,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2023-08-03 20:20:23,293 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1755 transitions. [2023-08-03 20:20:23,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1755 transitions. [2023-08-03 20:20:23,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:23,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1755 transitions. [2023-08-03 20:20:23,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:23,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 308.0) internal successors, (4312), 14 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:23,299 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 308.0) internal successors, (4312), 14 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:23,299 INFO L175 Difference]: Start difference. First operand has 92 places, 125 transitions, 871 flow. Second operand 13 states and 1755 transitions. [2023-08-03 20:20:23,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 328 transitions, 2913 flow [2023-08-03 20:20:23,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 328 transitions, 2775 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-03 20:20:23,379 INFO L231 Difference]: Finished difference. Result has 108 places, 193 transitions, 1475 flow [2023-08-03 20:20:23,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1475, PETRI_PLACES=108, PETRI_TRANSITIONS=193} [2023-08-03 20:20:23,379 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2023-08-03 20:20:23,379 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 193 transitions, 1475 flow [2023-08-03 20:20:23,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.52631578947368) internal successors, (2347), 19 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:23,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:23,380 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:23,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:23,580 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:23,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -60841287, now seen corresponding path program 3 times [2023-08-03 20:20:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:23,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608181183] [2023-08-03 20:20:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:20:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608181183] [2023-08-03 20:20:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608181183] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806684452] [2023-08-03 20:20:24,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 20:20:24,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:24,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:24,297 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:24,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-03 20:20:24,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-03 20:20:24,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:20:24,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-03 20:20:24,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:20:24,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:24,938 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:20:24,939 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 57 [2023-08-03 20:20:25,110 INFO L322 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-08-03 20:20:25,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 42 [2023-08-03 20:20:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:20:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806684452] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:25,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-03 20:20:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925499163] [2023-08-03 20:20:25,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:25,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 20:20:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 20:20:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-08-03 20:20:25,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 308 [2023-08-03 20:20:25,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 193 transitions, 1475 flow. Second operand has 19 states, 19 states have (on average 123.26315789473684) internal successors, (2342), 19 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:25,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:25,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 308 [2023-08-03 20:20:25,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:28,063 INFO L124 PetriNetUnfolderBase]: 15478/21206 cut-off events. [2023-08-03 20:20:28,063 INFO L125 PetriNetUnfolderBase]: For 83600/83614 co-relation queries the response was YES. [2023-08-03 20:20:28,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96512 conditions, 21206 events. 15478/21206 cut-off events. For 83600/83614 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 104381 event pairs, 4239 based on Foata normal form. 3/21203 useless extension candidates. Maximal degree in co-relation 96462. Up to 18362 conditions per place. [2023-08-03 20:20:28,230 INFO L140 encePairwiseOnDemand]: 298/308 looper letters, 238 selfloop transitions, 134 changer transitions 1/377 dead transitions. [2023-08-03 20:20:28,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 377 transitions, 3608 flow [2023-08-03 20:20:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 20:20:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 20:20:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1620 transitions. [2023-08-03 20:20:28,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2023-08-03 20:20:28,232 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1620 transitions. [2023-08-03 20:20:28,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1620 transitions. [2023-08-03 20:20:28,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:28,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1620 transitions. [2023-08-03 20:20:28,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 135.0) internal successors, (1620), 12 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:28,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 308.0) internal successors, (4004), 13 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:28,237 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 308.0) internal successors, (4004), 13 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:28,237 INFO L175 Difference]: Start difference. First operand has 108 places, 193 transitions, 1475 flow. Second operand 12 states and 1620 transitions. [2023-08-03 20:20:28,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 377 transitions, 3608 flow [2023-08-03 20:20:28,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 377 transitions, 3500 flow, removed 54 selfloop flow, removed 0 redundant places. [2023-08-03 20:20:28,361 INFO L231 Difference]: Finished difference. Result has 126 places, 263 transitions, 2411 flow [2023-08-03 20:20:28,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2411, PETRI_PLACES=126, PETRI_TRANSITIONS=263} [2023-08-03 20:20:28,362 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2023-08-03 20:20:28,362 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 263 transitions, 2411 flow [2023-08-03 20:20:28,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.26315789473684) internal successors, (2342), 19 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:28,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:28,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:28,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:28,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-03 20:20:28,569 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:28,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2004820587, now seen corresponding path program 4 times [2023-08-03 20:20:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583200826] [2023-08-03 20:20:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 20:20:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:29,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583200826] [2023-08-03 20:20:29,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583200826] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:29,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969422939] [2023-08-03 20:20:29,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 20:20:29,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:29,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:29,567 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-03 20:20:29,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 20:20:29,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:20:29,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:20:29,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:29,735 INFO L351 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 11 treesize of output 7 [2023-08-03 20:20:29,795 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:29,824 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:29,866 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:29,887 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 20:20:30,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969422939] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:30,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 24 [2023-08-03 20:20:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417610513] [2023-08-03 20:20:30,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:30,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-03 20:20:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-03 20:20:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2023-08-03 20:20:31,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 308 [2023-08-03 20:20:31,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 263 transitions, 2411 flow. Second operand has 26 states, 26 states have (on average 116.0) internal successors, (3016), 26 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:31,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:31,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 308 [2023-08-03 20:20:31,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:34,732 INFO L124 PetriNetUnfolderBase]: 18493/25332 cut-off events. [2023-08-03 20:20:34,733 INFO L125 PetriNetUnfolderBase]: For 128991/129011 co-relation queries the response was YES. [2023-08-03 20:20:34,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123271 conditions, 25332 events. 18493/25332 cut-off events. For 128991/129011 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 127865 event pairs, 5082 based on Foata normal form. 3/25329 useless extension candidates. Maximal degree in co-relation 123212. Up to 20749 conditions per place. [2023-08-03 20:20:34,967 INFO L140 encePairwiseOnDemand]: 297/308 looper letters, 271 selfloop transitions, 215 changer transitions 1/491 dead transitions. [2023-08-03 20:20:34,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 491 transitions, 5290 flow [2023-08-03 20:20:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-03 20:20:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-03 20:20:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1912 transitions. [2023-08-03 20:20:34,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41385281385281386 [2023-08-03 20:20:34,969 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1912 transitions. [2023-08-03 20:20:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1912 transitions. [2023-08-03 20:20:34,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:34,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1912 transitions. [2023-08-03 20:20:34,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 127.46666666666667) internal successors, (1912), 15 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:34,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 308.0) internal successors, (4928), 16 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:34,977 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 308.0) internal successors, (4928), 16 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:34,977 INFO L175 Difference]: Start difference. First operand has 126 places, 263 transitions, 2411 flow. Second operand 15 states and 1912 transitions. [2023-08-03 20:20:34,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 491 transitions, 5290 flow [2023-08-03 20:20:35,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 491 transitions, 5182 flow, removed 54 selfloop flow, removed 0 redundant places. [2023-08-03 20:20:35,206 INFO L231 Difference]: Finished difference. Result has 145 places, 357 transitions, 3935 flow [2023-08-03 20:20:35,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3935, PETRI_PLACES=145, PETRI_TRANSITIONS=357} [2023-08-03 20:20:35,207 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2023-08-03 20:20:35,207 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 357 transitions, 3935 flow [2023-08-03 20:20:35,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 116.0) internal successors, (3016), 26 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:35,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:35,208 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:35,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:35,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:35,408 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:35,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1861100351, now seen corresponding path program 5 times [2023-08-03 20:20:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:35,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895109196] [2023-08-03 20:20:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 20:20:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895109196] [2023-08-03 20:20:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895109196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692194406] [2023-08-03 20:20:36,122 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-03 20:20:36,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:36,135 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-03 20:20:36,281 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-03 20:20:36,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:20:36,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-03 20:20:36,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-03 20:20:36,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:36,623 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:20:36,623 INFO L351 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 17 treesize of output 14 [2023-08-03 20:20:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-03 20:20:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692194406] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:36,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 15 [2023-08-03 20:20:36,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138415682] [2023-08-03 20:20:36,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:36,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 20:20:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 20:20:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-08-03 20:20:37,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 308 [2023-08-03 20:20:37,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 357 transitions, 3935 flow. Second operand has 17 states, 17 states have (on average 123.47058823529412) internal successors, (2099), 17 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:37,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:37,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 308 [2023-08-03 20:20:37,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:41,670 INFO L124 PetriNetUnfolderBase]: 22737/30978 cut-off events. [2023-08-03 20:20:41,671 INFO L125 PetriNetUnfolderBase]: For 182311/182331 co-relation queries the response was YES. [2023-08-03 20:20:41,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160482 conditions, 30978 events. 22737/30978 cut-off events. For 182311/182331 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 159992 event pairs, 4196 based on Foata normal form. 21/30967 useless extension candidates. Maximal degree in co-relation 160415. Up to 24940 conditions per place. [2023-08-03 20:20:42,094 INFO L140 encePairwiseOnDemand]: 296/308 looper letters, 318 selfloop transitions, 257 changer transitions 1/580 dead transitions. [2023-08-03 20:20:42,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 580 transitions, 6771 flow [2023-08-03 20:20:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-03 20:20:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-03 20:20:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1541 transitions. [2023-08-03 20:20:42,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45484061393152303 [2023-08-03 20:20:42,096 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1541 transitions. [2023-08-03 20:20:42,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1541 transitions. [2023-08-03 20:20:42,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:42,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1541 transitions. [2023-08-03 20:20:42,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.0909090909091) internal successors, (1541), 11 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:42,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 308.0) internal successors, (3696), 12 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:42,100 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 308.0) internal successors, (3696), 12 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:42,100 INFO L175 Difference]: Start difference. First operand has 145 places, 357 transitions, 3935 flow. Second operand 11 states and 1541 transitions. [2023-08-03 20:20:42,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 580 transitions, 6771 flow [2023-08-03 20:20:42,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 580 transitions, 6485 flow, removed 126 selfloop flow, removed 2 redundant places. [2023-08-03 20:20:42,522 INFO L231 Difference]: Finished difference. Result has 156 places, 433 transitions, 5041 flow [2023-08-03 20:20:42,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=3711, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5041, PETRI_PLACES=156, PETRI_TRANSITIONS=433} [2023-08-03 20:20:42,523 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2023-08-03 20:20:42,523 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 433 transitions, 5041 flow [2023-08-03 20:20:42,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 123.47058823529412) internal successors, (2099), 17 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:42,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:42,523 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:42,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:42,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:42,724 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:42,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash -768206463, now seen corresponding path program 6 times [2023-08-03 20:20:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630305454] [2023-08-03 20:20:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:20:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630305454] [2023-08-03 20:20:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630305454] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432815330] [2023-08-03 20:20:43,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-03 20:20:43,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:43,305 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:43,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-03 20:20:43,447 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-03 20:20:43,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:20:43,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:20:43,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:43,483 INFO L351 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 11 treesize of output 7 [2023-08-03 20:20:43,604 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:43,631 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:43,671 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:43,695 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:20:43,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:44,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432815330] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:44,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 8] total 21 [2023-08-03 20:20:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398718681] [2023-08-03 20:20:44,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:44,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 20:20:44,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 20:20:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2023-08-03 20:20:44,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 308 [2023-08-03 20:20:44,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 433 transitions, 5041 flow. Second operand has 23 states, 23 states have (on average 116.34782608695652) internal successors, (2676), 23 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:44,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:44,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 308 [2023-08-03 20:20:44,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:20:50,182 INFO L124 PetriNetUnfolderBase]: 25951/35446 cut-off events. [2023-08-03 20:20:50,182 INFO L125 PetriNetUnfolderBase]: For 224137/224157 co-relation queries the response was YES. [2023-08-03 20:20:50,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188719 conditions, 35446 events. 25951/35446 cut-off events. For 224137/224157 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 188282 event pairs, 5264 based on Foata normal form. 21/35435 useless extension candidates. Maximal degree in co-relation 188649. Up to 27867 conditions per place. [2023-08-03 20:20:50,621 INFO L140 encePairwiseOnDemand]: 295/308 looper letters, 344 selfloop transitions, 287 changer transitions 1/636 dead transitions. [2023-08-03 20:20:50,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 636 transitions, 7914 flow [2023-08-03 20:20:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 20:20:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 20:20:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1707 transitions. [2023-08-03 20:20:50,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42632367632367635 [2023-08-03 20:20:50,624 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1707 transitions. [2023-08-03 20:20:50,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1707 transitions. [2023-08-03 20:20:50,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:20:50,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1707 transitions. [2023-08-03 20:20:50,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 131.30769230769232) internal successors, (1707), 13 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:50,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 308.0) internal successors, (4312), 14 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:50,628 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 308.0) internal successors, (4312), 14 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:50,628 INFO L175 Difference]: Start difference. First operand has 156 places, 433 transitions, 5041 flow. Second operand 13 states and 1707 transitions. [2023-08-03 20:20:50,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 636 transitions, 7914 flow [2023-08-03 20:20:51,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 636 transitions, 7732 flow, removed 91 selfloop flow, removed 0 redundant places. [2023-08-03 20:20:51,571 INFO L231 Difference]: Finished difference. Result has 173 places, 476 transitions, 6164 flow [2023-08-03 20:20:51,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=4913, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6164, PETRI_PLACES=173, PETRI_TRANSITIONS=476} [2023-08-03 20:20:51,571 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2023-08-03 20:20:51,572 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 476 transitions, 6164 flow [2023-08-03 20:20:51,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 116.34782608695652) internal successors, (2676), 23 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:51,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:20:51,572 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:20:51,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-03 20:20:51,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:51,773 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:20:51,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:20:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2067018643, now seen corresponding path program 7 times [2023-08-03 20:20:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:20:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802690086] [2023-08-03 20:20:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:20:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:20:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:20:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802690086] [2023-08-03 20:20:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802690086] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:20:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860177917] [2023-08-03 20:20:52,298 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-03 20:20:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:20:52,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:20:52,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:20:52,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-03 20:20:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:20:52,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:20:52,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:20:52,493 INFO L351 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 11 treesize of output 7 [2023-08-03 20:20:52,538 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:52,571 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:52,611 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:52,633 INFO L351 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 6 treesize of output 5 [2023-08-03 20:20:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:20:52,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:20:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:20:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860177917] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:20:53,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:20:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 8] total 30 [2023-08-03 20:20:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931163215] [2023-08-03 20:20:53,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:20:53,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-03 20:20:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:20:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-03 20:20:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2023-08-03 20:20:54,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 308 [2023-08-03 20:20:54,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 476 transitions, 6164 flow. Second operand has 31 states, 31 states have (on average 104.6774193548387) internal successors, (3245), 31 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:20:54,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:20:54,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 308 [2023-08-03 20:20:54,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:21:06,066 INFO L124 PetriNetUnfolderBase]: 35130/47487 cut-off events. [2023-08-03 20:21:06,067 INFO L125 PetriNetUnfolderBase]: For 345786/345790 co-relation queries the response was YES. [2023-08-03 20:21:06,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262284 conditions, 47487 events. 35130/47487 cut-off events. For 345786/345790 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 248484 event pairs, 3322 based on Foata normal form. 71/47525 useless extension candidates. Maximal degree in co-relation 262206. Up to 27114 conditions per place. [2023-08-03 20:21:06,858 INFO L140 encePairwiseOnDemand]: 286/308 looper letters, 958 selfloop transitions, 1249 changer transitions 6/2215 dead transitions. [2023-08-03 20:21:06,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 2215 transitions, 30487 flow [2023-08-03 20:21:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-03 20:21:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-03 20:21:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 9515 transitions. [2023-08-03 20:21:06,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3550903119868637 [2023-08-03 20:21:06,870 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 9515 transitions. [2023-08-03 20:21:06,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 9515 transitions. [2023-08-03 20:21:06,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:21:06,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 9515 transitions. [2023-08-03 20:21:06,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 109.36781609195403) internal successors, (9515), 87 states have internal predecessors, (9515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:06,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 308.0) internal successors, (27104), 88 states have internal predecessors, (27104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:06,903 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 308.0) internal successors, (27104), 88 states have internal predecessors, (27104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:06,904 INFO L175 Difference]: Start difference. First operand has 173 places, 476 transitions, 6164 flow. Second operand 87 states and 9515 transitions. [2023-08-03 20:21:06,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 2215 transitions, 30487 flow [2023-08-03 20:21:08,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 2215 transitions, 29636 flow, removed 160 selfloop flow, removed 5 redundant places. [2023-08-03 20:21:08,256 INFO L231 Difference]: Finished difference. Result has 285 places, 1490 transitions, 23103 flow [2023-08-03 20:21:08,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=5912, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=23103, PETRI_PLACES=285, PETRI_TRANSITIONS=1490} [2023-08-03 20:21:08,257 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2023-08-03 20:21:08,257 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 1490 transitions, 23103 flow [2023-08-03 20:21:08,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 104.6774193548387) internal successors, (3245), 31 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:08,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:21:08,257 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:21:08,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-03 20:21:08,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-03 20:21:08,458 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:21:08,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:21:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -60291111, now seen corresponding path program 8 times [2023-08-03 20:21:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:21:08,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204880699] [2023-08-03 20:21:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:21:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:21:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:21:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:21:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:21:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204880699] [2023-08-03 20:21:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204880699] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:21:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734836003] [2023-08-03 20:21:09,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:21:09,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:21:09,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:21:09,265 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:21:09,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-03 20:21:09,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:21:09,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:21:09,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-03 20:21:09,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:21:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:21:09,642 INFO L351 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 [2023-08-03 20:21:09,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:21:09,711 INFO L351 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 [2023-08-03 20:21:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:21:09,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:21:09,971 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread2Thread1of2ForFork0_~i~1#1| 4)))) (and (forall ((v_ArrVal_876 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1))) (+ c_~counter~0 1))) (forall ((v_ArrVal_876 (Array Int Int))) (<= c_~counter~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 .cse1))))))) is different from false [2023-08-03 20:21:09,992 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) c_~A~0.base) c_~A~0.offset) 2) (+ c_~counter~0 1))) (forall ((v_ArrVal_876 (Array Int Int))) (<= c_~counter~0 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) c_~A~0.base) c_~A~0.offset) 2)))) is different from false [2023-08-03 20:21:10,071 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_876 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) c_~A~0.base) c_~A~0.offset) 2) (+ .cse0 c_~counter~0 1))) (forall ((v_ArrVal_876 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) c_~A~0.base) c_~A~0.offset) 2))))) is different from false [2023-08-03 20:21:10,085 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:21:10,085 INFO L351 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 49 treesize of output 33 [2023-08-03 20:21:10,088 INFO L351 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 14 treesize of output 12 [2023-08-03 20:21:10,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:21:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 10 not checked. [2023-08-03 20:21:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734836003] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:21:10,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:21:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2023-08-03 20:21:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135642889] [2023-08-03 20:21:10,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:21:10,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-03 20:21:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:21:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-03 20:21:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=605, Unknown=8, NotChecked=156, Total=870 [2023-08-03 20:21:10,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 308 [2023-08-03 20:21:10,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 1490 transitions, 23103 flow. Second operand has 30 states, 30 states have (on average 100.66666666666667) internal successors, (3020), 30 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:10,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:21:10,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 308 [2023-08-03 20:21:10,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:21:23,304 INFO L124 PetriNetUnfolderBase]: 39506/53720 cut-off events. [2023-08-03 20:21:23,304 INFO L125 PetriNetUnfolderBase]: For 716514/716806 co-relation queries the response was YES. [2023-08-03 20:21:24,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354959 conditions, 53720 events. 39506/53720 cut-off events. For 716514/716806 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 294555 event pairs, 8321 based on Foata normal form. 63/53592 useless extension candidates. Maximal degree in co-relation 354849. Up to 37189 conditions per place. [2023-08-03 20:21:24,614 INFO L140 encePairwiseOnDemand]: 297/308 looper letters, 586 selfloop transitions, 1274 changer transitions 2/1889 dead transitions. [2023-08-03 20:21:24,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1889 transitions, 31465 flow [2023-08-03 20:21:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 20:21:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 20:21:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1412 transitions. [2023-08-03 20:21:24,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38203463203463206 [2023-08-03 20:21:24,617 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1412 transitions. [2023-08-03 20:21:24,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1412 transitions. [2023-08-03 20:21:24,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:21:24,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1412 transitions. [2023-08-03 20:21:24,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.66666666666667) internal successors, (1412), 12 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:24,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 308.0) internal successors, (4004), 13 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:24,622 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 308.0) internal successors, (4004), 13 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:24,622 INFO L175 Difference]: Start difference. First operand has 285 places, 1490 transitions, 23103 flow. Second operand 12 states and 1412 transitions. [2023-08-03 20:21:24,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1889 transitions, 31465 flow [2023-08-03 20:21:29,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1889 transitions, 29457 flow, removed 724 selfloop flow, removed 8 redundant places. [2023-08-03 20:21:29,912 INFO L231 Difference]: Finished difference. Result has 294 places, 1712 transitions, 28312 flow [2023-08-03 20:21:29,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=21357, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=28312, PETRI_PLACES=294, PETRI_TRANSITIONS=1712} [2023-08-03 20:21:29,914 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2023-08-03 20:21:29,914 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 1712 transitions, 28312 flow [2023-08-03 20:21:29,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 100.66666666666667) internal successors, (3020), 30 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:29,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:21:29,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:21:29,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-03 20:21:30,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-03 20:21:30,120 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:21:30,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:21:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash 388530275, now seen corresponding path program 1 times [2023-08-03 20:21:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:21:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739389850] [2023-08-03 20:21:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:21:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:21:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:21:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:21:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:21:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739389850] [2023-08-03 20:21:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739389850] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:21:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268385605] [2023-08-03 20:21:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:21:30,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:21:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:21:30,635 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:21:30,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-03 20:21:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:21:30,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:21:30,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:21:30,788 INFO L351 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 11 treesize of output 7 [2023-08-03 20:21:30,832 INFO L351 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 6 treesize of output 5 [2023-08-03 20:21:30,896 INFO L351 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 6 treesize of output 5 [2023-08-03 20:21:31,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:21:31,024 INFO L351 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 [2023-08-03 20:21:31,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:21:31,053 INFO L351 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 [2023-08-03 20:21:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:21:31,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:21:31,285 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (= c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_920) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:21:31,336 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_920) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:21:31,401 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (= (+ c_~counter~0 (* (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 2)) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_920) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:21:31,484 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_918))) (= (+ c_~counter~0 (* (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-08-03 20:21:31,493 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:21:31,493 INFO L351 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 50 treesize of output 39 [2023-08-03 20:21:31,497 INFO L351 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 162 treesize of output 146 [2023-08-03 20:21:31,501 INFO L351 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 60 treesize of output 56 [2023-08-03 20:21:31,516 INFO L351 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 28 treesize of output 26 [2023-08-03 20:21:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2023-08-03 20:21:31,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268385605] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:21:31,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:21:31,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2023-08-03 20:21:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881155491] [2023-08-03 20:21:31,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:21:31,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-03 20:21:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:21:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-03 20:21:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=984, Unknown=34, NotChecked=268, Total=1406 [2023-08-03 20:21:31,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 308 [2023-08-03 20:21:31,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 1712 transitions, 28312 flow. Second operand has 38 states, 38 states have (on average 76.10526315789474) internal successors, (2892), 38 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:31,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:21:31,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 308 [2023-08-03 20:21:31,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:21:52,398 INFO L124 PetriNetUnfolderBase]: 44164/59969 cut-off events. [2023-08-03 20:21:52,398 INFO L125 PetriNetUnfolderBase]: For 946211/946211 co-relation queries the response was YES. [2023-08-03 20:21:53,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417166 conditions, 59969 events. 44164/59969 cut-off events. For 946211/946211 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 326888 event pairs, 5544 based on Foata normal form. 107/60044 useless extension candidates. Maximal degree in co-relation 417053. Up to 33957 conditions per place. [2023-08-03 20:21:53,940 INFO L140 encePairwiseOnDemand]: 283/308 looper letters, 1050 selfloop transitions, 2044 changer transitions 28/3123 dead transitions. [2023-08-03 20:21:53,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 3123 transitions, 55465 flow [2023-08-03 20:21:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-08-03 20:21:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-08-03 20:21:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 6627 transitions. [2023-08-03 20:21:53,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26239309471016786 [2023-08-03 20:21:53,946 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 6627 transitions. [2023-08-03 20:21:53,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 6627 transitions. [2023-08-03 20:21:53,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:21:53,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 6627 transitions. [2023-08-03 20:21:53,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 80.8170731707317) internal successors, (6627), 82 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:53,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 308.0) internal successors, (25564), 83 states have internal predecessors, (25564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:53,973 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 308.0) internal successors, (25564), 83 states have internal predecessors, (25564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:21:53,973 INFO L175 Difference]: Start difference. First operand has 294 places, 1712 transitions, 28312 flow. Second operand 82 states and 6627 transitions. [2023-08-03 20:21:53,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 3123 transitions, 55465 flow [2023-08-03 20:22:01,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 3123 transitions, 53762 flow, removed 568 selfloop flow, removed 3 redundant places. [2023-08-03 20:22:01,453 INFO L231 Difference]: Finished difference. Result has 388 places, 2404 transitions, 44897 flow [2023-08-03 20:22:01,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=27458, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=44897, PETRI_PLACES=388, PETRI_TRANSITIONS=2404} [2023-08-03 20:22:01,455 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 346 predicate places. [2023-08-03 20:22:01,455 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 2404 transitions, 44897 flow [2023-08-03 20:22:01,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 76.10526315789474) internal successors, (2892), 38 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:01,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:22:01,456 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:22:01,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-03 20:22:01,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:22:01,661 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:22:01,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:22:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1724886321, now seen corresponding path program 9 times [2023-08-03 20:22:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:22:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313224190] [2023-08-03 20:22:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:22:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:22:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:22:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:22:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:22:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313224190] [2023-08-03 20:22:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313224190] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:22:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793030873] [2023-08-03 20:22:02,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 20:22:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:22:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:22:02,358 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:22:02,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-03 20:22:02,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-03 20:22:02,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:22:02,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:22:02,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:22:02,542 INFO L351 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 11 treesize of output 7 [2023-08-03 20:22:02,598 INFO L351 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 6 treesize of output 5 [2023-08-03 20:22:02,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:22:02,669 INFO L351 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 14 treesize of output 16 [2023-08-03 20:22:02,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:22:02,753 INFO L351 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 [2023-08-03 20:22:02,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:22:02,798 INFO L351 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 [2023-08-03 20:22:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 20:22:02,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:22:03,072 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread2Thread1of2ForFork0_~i~1#1| 4)))) (and (forall ((v_ArrVal_964 (Array Int Int))) (<= c_~counter~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1))))) (forall ((v_ArrVal_964 (Array Int Int))) (< (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 .cse1))) (+ c_~counter~0 1))))) is different from false [2023-08-03 20:22:03,088 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_964 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset) 2) (+ c_~counter~0 1))) (forall ((v_ArrVal_964 (Array Int Int))) (<= c_~counter~0 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset) 2)))) is different from false [2023-08-03 20:22:03,120 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))))) (and (forall ((v_ArrVal_964 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset) 2))) (forall ((v_ArrVal_964 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset) 2) (+ .cse0 c_~counter~0 1))))) is different from false [2023-08-03 20:22:03,127 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_964 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset) 2) (+ .cse0 c_~counter~0 1))) (forall ((v_ArrVal_964 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset) 2))))) is different from false [2023-08-03 20:22:03,141 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_962 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_962))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_962 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_962))) (< (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0 1))))) is different from false [2023-08-03 20:22:03,172 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_962 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_962))) (< (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 .cse1 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_962 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_962))) (<= (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~counter~0 .cse1) (* 2 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset))))))) is different from false [2023-08-03 20:22:03,236 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_962))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_961) c_~A~0.base) c_~A~0.offset)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_962))) (< (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_961) c_~A~0.base) c_~A~0.offset) 1))))) is different from false [2023-08-03 20:22:03,327 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:22:03,328 INFO L351 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 69 treesize of output 46 [2023-08-03 20:22:03,331 INFO L351 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 381 treesize of output 333 [2023-08-03 20:22:03,337 INFO L351 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 39 treesize of output 35 [2023-08-03 20:22:03,341 INFO L351 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 35 treesize of output 31 [2023-08-03 20:22:03,343 INFO L351 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 64 treesize of output 60 [2023-08-03 20:22:03,361 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:22:03,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 45 [2023-08-03 20:22:03,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:22:03,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:22:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 10 trivial. 14 not checked. [2023-08-03 20:22:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793030873] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:22:03,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:22:03,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 36 [2023-08-03 20:22:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065428750] [2023-08-03 20:22:03,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:22:03,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-03 20:22:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:22:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-03 20:22:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=806, Unknown=20, NotChecked=448, Total=1406 [2023-08-03 20:22:03,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 308 [2023-08-03 20:22:03,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 2404 transitions, 44897 flow. Second operand has 38 states, 38 states have (on average 92.34210526315789) internal successors, (3509), 38 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:03,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:22:03,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 308 [2023-08-03 20:22:03,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:22:24,325 INFO L124 PetriNetUnfolderBase]: 45335/61681 cut-off events. [2023-08-03 20:22:24,325 INFO L125 PetriNetUnfolderBase]: For 1187509/1188061 co-relation queries the response was YES. [2023-08-03 20:22:25,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470083 conditions, 61681 events. 45335/61681 cut-off events. For 1187509/1188061 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 345490 event pairs, 8045 based on Foata normal form. 191/61650 useless extension candidates. Maximal degree in co-relation 469951. Up to 40560 conditions per place. [2023-08-03 20:22:26,249 INFO L140 encePairwiseOnDemand]: 297/308 looper letters, 750 selfloop transitions, 1934 changer transitions 5/2737 dead transitions. [2023-08-03 20:22:26,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 2737 transitions, 54481 flow [2023-08-03 20:22:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 20:22:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 20:22:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1712 transitions. [2023-08-03 20:22:26,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3474025974025974 [2023-08-03 20:22:26,252 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1712 transitions. [2023-08-03 20:22:26,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1712 transitions. [2023-08-03 20:22:26,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:22:26,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1712 transitions. [2023-08-03 20:22:26,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 107.0) internal successors, (1712), 16 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:26,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 308.0) internal successors, (5236), 17 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:26,257 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 308.0) internal successors, (5236), 17 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:26,257 INFO L175 Difference]: Start difference. First operand has 388 places, 2404 transitions, 44897 flow. Second operand 16 states and 1712 transitions. [2023-08-03 20:22:26,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 2737 transitions, 54481 flow [2023-08-03 20:22:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 2737 transitions, 51692 flow, removed 855 selfloop flow, removed 26 redundant places. [2023-08-03 20:22:41,048 INFO L231 Difference]: Finished difference. Result has 382 places, 2514 transitions, 49380 flow [2023-08-03 20:22:41,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=42352, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1846, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=49380, PETRI_PLACES=382, PETRI_TRANSITIONS=2514} [2023-08-03 20:22:41,051 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 340 predicate places. [2023-08-03 20:22:41,051 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 2514 transitions, 49380 flow [2023-08-03 20:22:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 92.34210526315789) internal successors, (3509), 38 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:41,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:22:41,052 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:22:41,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-03 20:22:41,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:22:41,258 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:22:41,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:22:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash 843797539, now seen corresponding path program 10 times [2023-08-03 20:22:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:22:41,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739892367] [2023-08-03 20:22:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:22:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:22:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:22:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:22:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:22:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739892367] [2023-08-03 20:22:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739892367] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:22:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381245190] [2023-08-03 20:22:42,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 20:22:42,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:22:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:22:42,046 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:22:42,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-03 20:22:42,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 20:22:42,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:22:42,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:22:42,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:22:42,226 INFO L351 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 11 treesize of output 7 [2023-08-03 20:22:42,282 INFO L351 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 6 treesize of output 5 [2023-08-03 20:22:42,341 INFO L351 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 6 treesize of output 5 [2023-08-03 20:22:42,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:22:42,425 INFO L351 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 14 treesize of output 16 [2023-08-03 20:22:42,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:22:42,448 INFO L351 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 14 treesize of output 16 [2023-08-03 20:22:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:22:42,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:22:42,790 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1008 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 1))) (forall ((v_ArrVal_1008 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:22:42,833 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_1008 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 .cse0 1))) (forall ((v_ArrVal_1008 (Array Int Int))) (<= (+ c_~counter~0 .cse0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:22:42,843 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4)))) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006))) (<= (+ c_~counter~0 (select (select .cse0 c_~A~0.base) .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006))) (< (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 (select (select .cse2 c_~A~0.base) .cse1) 1)))))) is different from false [2023-08-03 20:22:42,862 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006))) (<= (+ c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006))) (< (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) 1))))) is different from false [2023-08-03 20:22:42,880 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006))) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~counter~0 1)))) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006))) (<= (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~counter~0) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-08-03 20:22:42,887 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:22:42,887 INFO L351 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 47 treesize of output 36 [2023-08-03 20:22:42,890 INFO L351 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 148 treesize of output 132 [2023-08-03 20:22:42,893 INFO L351 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 58 treesize of output 54 [2023-08-03 20:22:42,897 INFO L351 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 27 treesize of output 25 [2023-08-03 20:22:42,919 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:22:42,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-08-03 20:22:42,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 20:22:42,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 58 treesize of output 50 [2023-08-03 20:22:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 13 not checked. [2023-08-03 20:22:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381245190] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:22:42,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:22:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 28 [2023-08-03 20:22:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977414213] [2023-08-03 20:22:42,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:22:42,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-03 20:22:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:22:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-03 20:22:42,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=511, Unknown=5, NotChecked=250, Total=870 [2023-08-03 20:22:42,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 308 [2023-08-03 20:22:42,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 2514 transitions, 49380 flow. Second operand has 30 states, 30 states have (on average 92.9) internal successors, (2787), 30 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:22:42,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:22:42,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 308 [2023-08-03 20:22:42,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:23:06,642 INFO L124 PetriNetUnfolderBase]: 49651/68059 cut-off events. [2023-08-03 20:23:06,643 INFO L125 PetriNetUnfolderBase]: For 1574394/1574767 co-relation queries the response was YES. [2023-08-03 20:23:08,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532574 conditions, 68059 events. 49651/68059 cut-off events. For 1574394/1574767 co-relation queries the response was YES. Maximal size of possible extension queue 1244. Compared 390394 event pairs, 11942 based on Foata normal form. 172/68072 useless extension candidates. Maximal degree in co-relation 532443. Up to 57682 conditions per place. [2023-08-03 20:23:08,612 INFO L140 encePairwiseOnDemand]: 295/308 looper letters, 1738 selfloop transitions, 1109 changer transitions 3/2898 dead transitions. [2023-08-03 20:23:08,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 2898 transitions, 60257 flow [2023-08-03 20:23:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-03 20:23:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-03 20:23:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1910 transitions. [2023-08-03 20:23:08,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3445165945165945 [2023-08-03 20:23:08,615 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1910 transitions. [2023-08-03 20:23:08,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1910 transitions. [2023-08-03 20:23:08,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:23:08,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1910 transitions. [2023-08-03 20:23:08,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 106.11111111111111) internal successors, (1910), 18 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:08,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 308.0) internal successors, (5852), 19 states have internal predecessors, (5852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:08,621 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 308.0) internal successors, (5852), 19 states have internal predecessors, (5852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:08,621 INFO L175 Difference]: Start difference. First operand has 382 places, 2514 transitions, 49380 flow. Second operand 18 states and 1910 transitions. [2023-08-03 20:23:08,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 2898 transitions, 60257 flow [2023-08-03 20:23:22,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2898 transitions, 58036 flow, removed 605 selfloop flow, removed 6 redundant places. [2023-08-03 20:23:22,701 INFO L231 Difference]: Finished difference. Result has 398 places, 2662 transitions, 53384 flow [2023-08-03 20:23:22,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=47271, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=991, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=53384, PETRI_PLACES=398, PETRI_TRANSITIONS=2662} [2023-08-03 20:23:22,703 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 356 predicate places. [2023-08-03 20:23:22,703 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 2662 transitions, 53384 flow [2023-08-03 20:23:22,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 92.9) internal successors, (2787), 30 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:22,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:23:22,704 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:23:22,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-03 20:23:22,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:23:22,904 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:23:22,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:23:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1961281661, now seen corresponding path program 1 times [2023-08-03 20:23:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:23:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916682073] [2023-08-03 20:23:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:23:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:23:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:23:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:23:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:23:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916682073] [2023-08-03 20:23:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916682073] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:23:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798768146] [2023-08-03 20:23:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:23:23,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:23:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:23:23,412 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:23:23,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-03 20:23:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:23:23,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:23:23,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:23:23,594 INFO L351 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 11 treesize of output 7 [2023-08-03 20:23:23,643 INFO L351 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 6 treesize of output 5 [2023-08-03 20:23:23,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:23:23,735 INFO L351 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 14 treesize of output 16 [2023-08-03 20:23:23,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:23:23,833 INFO L351 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 [2023-08-03 20:23:23,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:23:23,859 INFO L351 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 [2023-08-03 20:23:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:23:23,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:23:24,101 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array Int Int))) (= c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:23:24,260 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1050))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4)))) (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) c_~A~0.base) c_~A~0.offset) 2)))) is different from false [2023-08-03 20:23:24,335 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1050))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1049) c_~A~0.base) c_~A~0.offset) c_~counter~0) (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) c_~A~0.base) c_~A~0.offset) 2)))) is different from false [2023-08-03 20:23:24,341 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1050))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~counter~0) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-08-03 20:23:24,349 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:23:24,349 INFO L351 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 68 treesize of output 45 [2023-08-03 20:23:24,353 INFO L351 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 738 treesize of output 642 [2023-08-03 20:23:24,361 INFO L351 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 37 treesize of output 33 [2023-08-03 20:23:24,364 INFO L351 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 33 treesize of output 29 [2023-08-03 20:23:24,367 INFO L351 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 59 treesize of output 55 [2023-08-03 20:23:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2023-08-03 20:23:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798768146] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:23:24,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:23:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 36 [2023-08-03 20:23:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830083483] [2023-08-03 20:23:24,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:23:24,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-03 20:23:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:23:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-03 20:23:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=912, Unknown=43, NotChecked=260, Total=1332 [2023-08-03 20:23:24,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 308 [2023-08-03 20:23:24,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 2662 transitions, 53384 flow. Second operand has 37 states, 37 states have (on average 77.08108108108108) internal successors, (2852), 37 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:24,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:23:24,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 308 [2023-08-03 20:23:24,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:23:54,503 INFO L124 PetriNetUnfolderBase]: 51594/70221 cut-off events. [2023-08-03 20:23:54,504 INFO L125 PetriNetUnfolderBase]: For 1493576/1493879 co-relation queries the response was YES. [2023-08-03 20:23:56,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550047 conditions, 70221 events. 51594/70221 cut-off events. For 1493576/1493879 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 399401 event pairs, 5135 based on Foata normal form. 194/70253 useless extension candidates. Maximal degree in co-relation 549913. Up to 39416 conditions per place. [2023-08-03 20:23:56,833 INFO L140 encePairwiseOnDemand]: 285/308 looper letters, 1071 selfloop transitions, 2403 changer transitions 95/3596 dead transitions. [2023-08-03 20:23:56,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 3596 transitions, 73268 flow [2023-08-03 20:23:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-08-03 20:23:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-08-03 20:23:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 6461 transitions. [2023-08-03 20:23:56,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2655350978135788 [2023-08-03 20:23:56,840 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 6461 transitions. [2023-08-03 20:23:56,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 6461 transitions. [2023-08-03 20:23:56,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:23:56,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 6461 transitions. [2023-08-03 20:23:56,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 81.78481012658227) internal successors, (6461), 79 states have internal predecessors, (6461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:56,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 308.0) internal successors, (24640), 80 states have internal predecessors, (24640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:56,869 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 308.0) internal successors, (24640), 80 states have internal predecessors, (24640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:23:56,869 INFO L175 Difference]: Start difference. First operand has 398 places, 2662 transitions, 53384 flow. Second operand 79 states and 6461 transitions. [2023-08-03 20:23:56,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 3596 transitions, 73268 flow [2023-08-03 20:24:15,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 3596 transitions, 70761 flow, removed 1029 selfloop flow, removed 4 redundant places. [2023-08-03 20:24:15,130 INFO L231 Difference]: Finished difference. Result has 486 places, 2860 transitions, 61338 flow [2023-08-03 20:24:15,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=51604, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=61338, PETRI_PLACES=486, PETRI_TRANSITIONS=2860} [2023-08-03 20:24:15,132 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 444 predicate places. [2023-08-03 20:24:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 2860 transitions, 61338 flow [2023-08-03 20:24:15,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 77.08108108108108) internal successors, (2852), 37 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:24:15,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:24:15,133 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:24:15,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-03 20:24:15,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-03 20:24:15,334 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:24:15,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:24:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1726396845, now seen corresponding path program 1 times [2023-08-03 20:24:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:24:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860979147] [2023-08-03 20:24:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:24:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:24:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:24:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:24:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:24:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860979147] [2023-08-03 20:24:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860979147] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:24:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474695336] [2023-08-03 20:24:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:24:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:24:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:24:15,810 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:24:15,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-03 20:24:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:24:15,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:24:15,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:24:16,000 INFO L351 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 11 treesize of output 7 [2023-08-03 20:24:16,054 INFO L351 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 6 treesize of output 5 [2023-08-03 20:24:16,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:24:16,137 INFO L351 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 14 treesize of output 16 [2023-08-03 20:24:16,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:24:16,243 INFO L351 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 [2023-08-03 20:24:16,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:24:16,296 INFO L351 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 [2023-08-03 20:24:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:24:16,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:24:16,523 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1096 (Array Int Int))) (= c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1096) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:24:16,579 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1096 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1096) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-08-03 20:24:16,627 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1094))) (= (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1096) c_~A~0.base) c_~A~0.offset) 2) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))))) is different from false [2023-08-03 20:24:16,635 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1094))) (= (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1096) c_~A~0.base) c_~A~0.offset) 2) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0)))) is different from false [2023-08-03 20:24:16,644 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1094))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1093) c_~A~0.base) c_~A~0.offset)) (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1096) c_~A~0.base) c_~A~0.offset) 2)))) is different from false [2023-08-03 20:24:16,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1094))) (= (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1096) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1093) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~counter~0)))) is different from false [2023-08-03 20:24:16,657 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:24:16,658 INFO L351 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 68 treesize of output 45 [2023-08-03 20:24:16,662 INFO L351 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 738 treesize of output 642 [2023-08-03 20:24:16,669 INFO L351 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 37 treesize of output 33 [2023-08-03 20:24:16,672 INFO L351 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 33 treesize of output 29 [2023-08-03 20:24:16,674 INFO L351 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 59 treesize of output 55 [2023-08-03 20:24:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2023-08-03 20:24:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474695336] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:24:16,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:24:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 36 [2023-08-03 20:24:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561883193] [2023-08-03 20:24:16,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:24:16,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-03 20:24:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:24:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-03 20:24:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=826, Unknown=27, NotChecked=378, Total=1332 [2023-08-03 20:24:16,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 308 [2023-08-03 20:24:16,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 2860 transitions, 61338 flow. Second operand has 37 states, 37 states have (on average 77.16216216216216) internal successors, (2855), 37 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:24:16,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:24:16,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 308 [2023-08-03 20:24:16,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:24:45,191 INFO L124 PetriNetUnfolderBase]: 47585/62997 cut-off events. [2023-08-03 20:24:45,191 INFO L125 PetriNetUnfolderBase]: For 1618529/1619005 co-relation queries the response was YES. [2023-08-03 20:24:47,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540582 conditions, 62997 events. 47585/62997 cut-off events. For 1618529/1619005 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 325318 event pairs, 5063 based on Foata normal form. 769/63591 useless extension candidates. Maximal degree in co-relation 540434. Up to 30694 conditions per place. [2023-08-03 20:24:47,702 INFO L140 encePairwiseOnDemand]: 287/308 looper letters, 1804 selfloop transitions, 3036 changer transitions 4/4877 dead transitions. [2023-08-03 20:24:47,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 4877 transitions, 109992 flow [2023-08-03 20:24:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-08-03 20:24:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-08-03 20:24:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 5398 transitions. [2023-08-03 20:24:47,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2696303696303696 [2023-08-03 20:24:47,707 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 5398 transitions. [2023-08-03 20:24:47,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 5398 transitions. [2023-08-03 20:24:47,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:24:47,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 5398 transitions. [2023-08-03 20:24:47,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 83.04615384615384) internal successors, (5398), 65 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:24:47,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 308.0) internal successors, (20328), 66 states have internal predecessors, (20328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:24:47,726 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 308.0) internal successors, (20328), 66 states have internal predecessors, (20328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:24:47,727 INFO L175 Difference]: Start difference. First operand has 486 places, 2860 transitions, 61338 flow. Second operand 65 states and 5398 transitions. [2023-08-03 20:24:47,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 4877 transitions, 109992 flow [2023-08-03 20:25:07,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 4877 transitions, 103672 flow, removed 1873 selfloop flow, removed 23 redundant places. [2023-08-03 20:25:07,156 INFO L231 Difference]: Finished difference. Result has 538 places, 4075 transitions, 90892 flow [2023-08-03 20:25:07,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=57122, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1841, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=90892, PETRI_PLACES=538, PETRI_TRANSITIONS=4075} [2023-08-03 20:25:07,158 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 496 predicate places. [2023-08-03 20:25:07,158 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 4075 transitions, 90892 flow [2023-08-03 20:25:07,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 77.16216216216216) internal successors, (2855), 37 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:25:07,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:25:07,159 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:25:07,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-03 20:25:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-03 20:25:07,363 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:25:07,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:25:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash -417791895, now seen corresponding path program 2 times [2023-08-03 20:25:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:25:07,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686170044] [2023-08-03 20:25:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:25:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:25:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:25:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:25:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:25:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686170044] [2023-08-03 20:25:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686170044] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:25:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685108138] [2023-08-03 20:25:07,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:25:07,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:25:07,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:25:07,863 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:25:07,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-03 20:25:08,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:25:08,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:25:08,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-03 20:25:08,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:25:08,032 INFO L351 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 18 treesize of output 16 [2023-08-03 20:25:08,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-03 20:25:08,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-03 20:25:08,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:25:08,377 INFO L351 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 [2023-08-03 20:25:08,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:25:08,403 INFO L351 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 [2023-08-03 20:25:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:25:08,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:25:08,700 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))) c_~counter~0) (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1141) c_~A~0.base) c_~A~0.offset) 2))) is different from false [2023-08-03 20:25:08,946 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 Int) (v_ArrVal_1141 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| (* |c_ULTIMATE.start_main_~asdf~0#1| 4) 4) v_ArrVal_1138)))) (= (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1141) c_~A~0.base) c_~A~0.offset) 2) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:25:08,991 INFO L322 Elim1Store]: treesize reduction 53, result has 53.9 percent of original size [2023-08-03 20:25:08,992 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 492 treesize of output 373 [2023-08-03 20:25:09,011 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:25:09,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 244 [2023-08-03 20:25:09,016 INFO L351 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 181 treesize of output 173 [2023-08-03 20:25:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2023-08-03 20:25:09,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685108138] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:25:09,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:25:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 38 [2023-08-03 20:25:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078322215] [2023-08-03 20:25:09,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:25:09,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-03 20:25:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:25:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-03 20:25:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1165, Unknown=49, NotChecked=142, Total=1482 [2023-08-03 20:25:09,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 308 [2023-08-03 20:25:09,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 4075 transitions, 90892 flow. Second operand has 39 states, 39 states have (on average 76.8974358974359) internal successors, (2999), 39 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:25:09,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:25:09,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 308 [2023-08-03 20:25:09,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:25:53,798 INFO L124 PetriNetUnfolderBase]: 53556/70222 cut-off events. [2023-08-03 20:25:53,798 INFO L125 PetriNetUnfolderBase]: For 1784314/1784317 co-relation queries the response was YES. [2023-08-03 20:25:56,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625122 conditions, 70222 events. 53556/70222 cut-off events. For 1784314/1784317 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 355054 event pairs, 2698 based on Foata normal form. 409/70629 useless extension candidates. Maximal degree in co-relation 624960. Up to 28180 conditions per place. [2023-08-03 20:25:56,583 INFO L140 encePairwiseOnDemand]: 285/308 looper letters, 4406 selfloop transitions, 2617 changer transitions 3/7046 dead transitions. [2023-08-03 20:25:56,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 7046 transitions, 159464 flow [2023-08-03 20:25:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-08-03 20:25:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2023-08-03 20:25:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 8062 transitions. [2023-08-03 20:25:56,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26709514974821097 [2023-08-03 20:25:56,597 INFO L72 ComplementDD]: Start complementDD. Operand 98 states and 8062 transitions. [2023-08-03 20:25:56,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 8062 transitions. [2023-08-03 20:25:56,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:25:56,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 98 states and 8062 transitions. [2023-08-03 20:25:56,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 99 states, 98 states have (on average 82.26530612244898) internal successors, (8062), 98 states have internal predecessors, (8062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:25:56,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 99 states, 99 states have (on average 308.0) internal successors, (30492), 99 states have internal predecessors, (30492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:25:56,627 INFO L81 ComplementDD]: Finished complementDD. Result has 99 states, 99 states have (on average 308.0) internal successors, (30492), 99 states have internal predecessors, (30492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:25:56,628 INFO L175 Difference]: Start difference. First operand has 538 places, 4075 transitions, 90892 flow. Second operand 98 states and 8062 transitions. [2023-08-03 20:25:56,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 7046 transitions, 159464 flow [2023-08-03 20:26:26,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 7046 transitions, 153414 flow, removed 954 selfloop flow, removed 30 redundant places. [2023-08-03 20:26:26,393 INFO L231 Difference]: Finished difference. Result has 666 places, 5733 transitions, 130613 flow [2023-08-03 20:26:26,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=85742, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=970, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=130613, PETRI_PLACES=666, PETRI_TRANSITIONS=5733} [2023-08-03 20:26:26,397 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 624 predicate places. [2023-08-03 20:26:26,397 INFO L495 AbstractCegarLoop]: Abstraction has has 666 places, 5733 transitions, 130613 flow [2023-08-03 20:26:26,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 76.8974358974359) internal successors, (2999), 39 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:26:26,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:26:26,398 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:26:26,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-03 20:26:26,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-03 20:26:26,606 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:26:26,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:26:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash -846894265, now seen corresponding path program 1 times [2023-08-03 20:26:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:26:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836664933] [2023-08-03 20:26:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:26:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:26:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:26:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 20:26:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:26:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836664933] [2023-08-03 20:26:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836664933] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:26:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690423248] [2023-08-03 20:26:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:26:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:26:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:26:27,945 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:26:27,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-03 20:26:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:26:28,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-03 20:26:28,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:26:28,137 INFO L351 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 11 treesize of output 7 [2023-08-03 20:26:28,221 INFO L351 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 6 treesize of output 5 [2023-08-03 20:26:28,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:26:28,343 INFO L351 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 14 treesize of output 16 [2023-08-03 20:26:28,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:26:28,495 INFO L351 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 [2023-08-03 20:26:28,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 20:26:28,517 INFO L351 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 [2023-08-03 20:26:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:26:28,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:26:29,047 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1183))) (= (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:26:29,056 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1183))) (= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:26:29,067 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1183))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:26:29,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1183))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1182) c_~A~0.base) c_~A~0.offset) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-03 20:26:29,159 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:26:29,159 INFO L351 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 68 treesize of output 45 [2023-08-03 20:26:29,162 INFO L351 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 738 treesize of output 642 [2023-08-03 20:26:29,166 INFO L351 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 67 treesize of output 63 [2023-08-03 20:26:29,168 INFO L351 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 63 treesize of output 59 [2023-08-03 20:26:29,173 INFO L351 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 35 treesize of output 31 [2023-08-03 20:26:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 11 trivial. 7 not checked. [2023-08-03 20:26:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690423248] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:26:29,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:26:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 14] total 47 [2023-08-03 20:26:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150715279] [2023-08-03 20:26:29,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:26:29,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-08-03 20:26:29,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:26:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-08-03 20:26:29,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1705, Unknown=72, NotChecked=348, Total=2256 [2023-08-03 20:26:29,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 308 [2023-08-03 20:26:29,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 5733 transitions, 130613 flow. Second operand has 48 states, 48 states have (on average 60.583333333333336) internal successors, (2908), 48 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:26:29,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:26:29,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 308 [2023-08-03 20:26:29,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand