/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_test-easy7.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:10:39,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:10:39,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:10:39,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:10:39,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:10:39,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:10:39,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:10:39,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:10:39,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:10:39,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:10:39,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:10:39,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:10:39,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:10:39,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:10:39,596 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:10:39,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:10:39,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:10:39,597 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:10:39,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:10:39,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:10:39,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:10:39,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:10:39,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:10:39,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:10:39,599 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:10:39,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:10:39,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:10:39,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:10:39,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:10:39,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:10:39,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:10:39,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:10:39,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:10:39,603 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:10:39,603 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 21:10:39,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:10:39,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:10:39,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:10:39,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:10:39,858 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:10:39,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy7.wvr_bound2.c [2023-08-03 21:10:41,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:10:41,253 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:10:41,253 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy7.wvr_bound2.c [2023-08-03 21:10:41,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17eccead4/974a172ef1e848e181259f4c8b221068/FLAG26cdc95bf [2023-08-03 21:10:41,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17eccead4/974a172ef1e848e181259f4c8b221068 [2023-08-03 21:10:41,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:10:41,284 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:10:41,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:10:41,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:10:41,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:10:41,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ee154d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41, skipping insertion in model container [2023-08-03 21:10:41,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,312 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:10:41,482 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_test-easy7.wvr_bound2.c[2034,2047] [2023-08-03 21:10:41,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:10:41,492 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:10:41,531 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_test-easy7.wvr_bound2.c[2034,2047] [2023-08-03 21:10:41,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:10:41,543 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:10:41,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41 WrapperNode [2023-08-03 21:10:41,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:10:41,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:10:41,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:10:41,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:10:41,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,595 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2023-08-03 21:10:41,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:10:41,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:10:41,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:10:41,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:10:41,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:10:41,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:10:41,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:10:41,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:10:41,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (1/1) ... [2023-08-03 21:10:41,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:10:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:41,660 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 21:10:41,681 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 21:10:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:10:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 21:10:41,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 21:10:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 21:10:41,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 21:10:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:10:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:10:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:10:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:10:41,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:10:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:10:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:10:41,698 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 21:10:41,773 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:10:41,775 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:10:41,991 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:10:41,998 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:10:41,998 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-03 21:10:42,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:10:42 BoogieIcfgContainer [2023-08-03 21:10:42,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:10:42,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:10:42,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:10:42,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:10:42,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:10:41" (1/3) ... [2023-08-03 21:10:42,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386e0935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:10:42, skipping insertion in model container [2023-08-03 21:10:42,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:41" (2/3) ... [2023-08-03 21:10:42,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386e0935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:10:42, skipping insertion in model container [2023-08-03 21:10:42,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:10:42" (3/3) ... [2023-08-03 21:10:42,007 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_test-easy7.wvr_bound2.c [2023-08-03 21:10:42,015 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:10:42,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:10:42,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 21:10:42,024 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:10:42,089 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 21:10:42,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 119 transitions, 260 flow [2023-08-03 21:10:42,259 INFO L124 PetriNetUnfolderBase]: 27/263 cut-off events. [2023-08-03 21:10:42,259 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-08-03 21:10:42,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 263 events. 27/263 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 996 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 140. Up to 8 conditions per place. [2023-08-03 21:10:42,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 119 transitions, 260 flow [2023-08-03 21:10:42,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 111 transitions, 244 flow [2023-08-03 21:10:42,271 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:10:42,279 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 111 transitions, 244 flow [2023-08-03 21:10:42,281 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 111 transitions, 244 flow [2023-08-03 21:10:42,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 111 transitions, 244 flow [2023-08-03 21:10:42,313 INFO L124 PetriNetUnfolderBase]: 27/231 cut-off events. [2023-08-03 21:10:42,314 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-08-03 21:10:42,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 231 events. 27/231 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 777 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2023-08-03 21:10:42,322 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-03 21:10:44,234 INFO L134 LiptonReduction]: Checked pairs total: 4799 [2023-08-03 21:10:44,234 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-03 21:10:44,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:10:44,251 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;@cb9f22c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:10:44,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:10:44,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:10:44,254 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 21:10:44,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:10:44,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:44,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 21:10:44,255 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 21:10:44,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:44,258 INFO L85 PathProgramCache]: Analyzing trace with hash 411797117, now seen corresponding path program 1 times [2023-08-03 21:10:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:44,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64810558] [2023-08-03 21:10:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:44,421 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 21:10:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:44,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64810558] [2023-08-03 21:10:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64810558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:44,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:10:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:10:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558792989] [2023-08-03 21:10:44,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:44,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:44,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:10:44,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 211 [2023-08-03 21:10:44,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 21:10:44,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:44,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 211 [2023-08-03 21:10:44,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:44,582 INFO L124 PetriNetUnfolderBase]: 390/726 cut-off events. [2023-08-03 21:10:44,582 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-03 21:10:44,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 726 events. 390/726 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3157 event pairs, 168 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 1266. Up to 688 conditions per place. [2023-08-03 21:10:44,589 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 30 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-03 21:10:44,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 158 flow [2023-08-03 21:10:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-03 21:10:44,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5355450236966824 [2023-08-03 21:10:44,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-03 21:10:44,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-03 21:10:44,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:44,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-03 21:10:44,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 21:10:44,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:10:44,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:10:44,616 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 84 flow. Second operand 3 states and 339 transitions. [2023-08-03 21:10:44,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 158 flow [2023-08-03 21:10:44,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:10:44,620 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 92 flow [2023-08-03 21:10:44,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=35, PETRI_TRANSITIONS=31} [2023-08-03 21:10:44,625 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-03 21:10:44,625 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 92 flow [2023-08-03 21:10:44,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 21:10:44,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:44,626 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 21:10:44,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:10:44,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:44,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash -92051790, now seen corresponding path program 1 times [2023-08-03 21:10:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58237292] [2023-08-03 21:10:44,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:10:44,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:10:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:10:44,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:10:44,698 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:10:44,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 21:10:44,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 21:10:44,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 21:10:44,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 21:10:44,706 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 21:10:44,709 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:10:44,709 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:10:44,739 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 21:10:44,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 153 transitions, 354 flow [2023-08-03 21:10:44,836 INFO L124 PetriNetUnfolderBase]: 118/858 cut-off events. [2023-08-03 21:10:44,836 INFO L125 PetriNetUnfolderBase]: For 72/88 co-relation queries the response was YES. [2023-08-03 21:10:44,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 858 events. 118/858 cut-off events. For 72/88 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4775 event pairs, 1 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 507. Up to 32 conditions per place. [2023-08-03 21:10:44,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 153 transitions, 354 flow [2023-08-03 21:10:44,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 145 transitions, 338 flow [2023-08-03 21:10:44,845 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:10:44,845 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 145 transitions, 338 flow [2023-08-03 21:10:44,845 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 145 transitions, 338 flow [2023-08-03 21:10:44,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 145 transitions, 338 flow [2023-08-03 21:10:44,920 INFO L124 PetriNetUnfolderBase]: 118/730 cut-off events. [2023-08-03 21:10:44,920 INFO L125 PetriNetUnfolderBase]: For 72/88 co-relation queries the response was YES. [2023-08-03 21:10:44,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 730 events. 118/730 cut-off events. For 72/88 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3812 event pairs, 1 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 443. Up to 32 conditions per place. [2023-08-03 21:10:44,939 INFO L119 LiptonReduction]: Number of co-enabled transitions 8176 [2023-08-03 21:10:46,554 INFO L134 LiptonReduction]: Checked pairs total: 32275 [2023-08-03 21:10:46,554 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-03 21:10:46,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:10:46,557 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;@cb9f22c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:10:46,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:10:46,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:10:46,560 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 21:10:46,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:10:46,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:46,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 21:10:46,560 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 21:10:46,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash 677251666, now seen corresponding path program 1 times [2023-08-03 21:10:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468578686] [2023-08-03 21:10:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:46,617 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 21:10:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468578686] [2023-08-03 21:10:46,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468578686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:46,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:10:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:10:46,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340983282] [2023-08-03 21:10:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:46,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:46,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:10:46,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 246 [2023-08-03 21:10:46,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 21:10:46,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:46,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 246 [2023-08-03 21:10:46,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:50,289 INFO L124 PetriNetUnfolderBase]: 28950/44773 cut-off events. [2023-08-03 21:10:50,289 INFO L125 PetriNetUnfolderBase]: For 3619/3619 co-relation queries the response was YES. [2023-08-03 21:10:50,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86874 conditions, 44773 events. 28950/44773 cut-off events. For 3619/3619 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 362530 event pairs, 23954 based on Foata normal form. 0/40807 useless extension candidates. Maximal degree in co-relation 32519. Up to 39618 conditions per place. [2023-08-03 21:10:50,733 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 45 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-03 21:10:50,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 280 flow [2023-08-03 21:10:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-03 21:10:50,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2023-08-03 21:10:50,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-03 21:10:50,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-03 21:10:50,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:50,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-03 21:10:50,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 21:10:50,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:10:50,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:10:50,741 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 174 flow. Second operand 3 states and 438 transitions. [2023-08-03 21:10:50,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 280 flow [2023-08-03 21:10:50,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:10:50,750 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 186 flow [2023-08-03 21:10:50,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2023-08-03 21:10:50,751 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-03 21:10:50,751 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 186 flow [2023-08-03 21:10:50,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 21:10:50,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:50,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:50,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:10:50,752 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 21:10:50,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash -469388715, now seen corresponding path program 1 times [2023-08-03 21:10:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855386007] [2023-08-03 21:10:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:50,805 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 21:10:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855386007] [2023-08-03 21:10:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855386007] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881876496] [2023-08-03 21:10:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:50,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:50,813 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 21:10:50,834 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 21:10:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:50,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:10:50,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:50,898 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 21:10:50,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881876496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 21:10:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229844644] [2023-08-03 21:10:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:50,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 246 [2023-08-03 21:10:50,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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 21:10:50,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:50,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 246 [2023-08-03 21:10:50,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:53,637 INFO L124 PetriNetUnfolderBase]: 28920/44750 cut-off events. [2023-08-03 21:10:53,637 INFO L125 PetriNetUnfolderBase]: For 3585/3585 co-relation queries the response was YES. [2023-08-03 21:10:53,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86993 conditions, 44750 events. 28920/44750 cut-off events. For 3585/3585 co-relation queries the response was YES. Maximal size of possible extension queue 1601. Compared 361145 event pairs, 25454 based on Foata normal form. 0/40905 useless extension candidates. Maximal degree in co-relation 71025. Up to 39077 conditions per place. [2023-08-03 21:10:53,912 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 54 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-03 21:10:53,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 326 flow [2023-08-03 21:10:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-03 21:10:53,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6043360433604336 [2023-08-03 21:10:53,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-03 21:10:53,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-03 21:10:53,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:53,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-03 21:10:53,916 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 21:10:53,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:10:53,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:10:53,918 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 186 flow. Second operand 3 states and 446 transitions. [2023-08-03 21:10:53,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 326 flow [2023-08-03 21:10:53,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:10:53,929 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 196 flow [2023-08-03 21:10:53,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-08-03 21:10:53,930 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2023-08-03 21:10:53,930 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 196 flow [2023-08-03 21:10:53,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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 21:10:53,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:53,930 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 21:10:53,940 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 21:10:54,137 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 21:10:54,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:54,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 652106641, now seen corresponding path program 1 times [2023-08-03 21:10:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326494881] [2023-08-03 21:10:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:54,220 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 21:10:54,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326494881] [2023-08-03 21:10:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326494881] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631978505] [2023-08-03 21:10:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:54,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:54,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:54,226 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 21:10:54,232 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 21:10:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:54,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:10:54,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:54,317 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 21:10:54,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631978505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:54,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:54,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 21:10:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249843261] [2023-08-03 21:10:54,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:54,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:54,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:10:54,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 246 [2023-08-03 21:10:54,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 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 21:10:54,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:54,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 246 [2023-08-03 21:10:54,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:57,100 INFO L124 PetriNetUnfolderBase]: 28880/44591 cut-off events. [2023-08-03 21:10:57,100 INFO L125 PetriNetUnfolderBase]: For 5057/5057 co-relation queries the response was YES. [2023-08-03 21:10:57,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88785 conditions, 44591 events. 28880/44591 cut-off events. For 5057/5057 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 360649 event pairs, 13372 based on Foata normal form. 25/41704 useless extension candidates. Maximal degree in co-relation 19809. Up to 39459 conditions per place. [2023-08-03 21:10:57,370 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 53 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2023-08-03 21:10:57,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 337 flow [2023-08-03 21:10:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:10:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:10:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-08-03 21:10:57,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2023-08-03 21:10:57,377 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-08-03 21:10:57,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-08-03 21:10:57,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:57,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-08-03 21:10:57,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:10:57,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 21:10:57,382 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 21:10:57,382 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 196 flow. Second operand 5 states and 702 transitions. [2023-08-03 21:10:57,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 337 flow [2023-08-03 21:10:57,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:10:57,390 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 205 flow [2023-08-03 21:10:57,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2023-08-03 21:10:57,392 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 21:10:57,392 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 205 flow [2023-08-03 21:10:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 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 21:10:57,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:57,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:57,401 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 21:10:57,599 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 21:10:57,599 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 21:10:57,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2142187157, now seen corresponding path program 1 times [2023-08-03 21:10:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702516429] [2023-08-03 21:10:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:57,672 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 21:10:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:57,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702516429] [2023-08-03 21:10:57,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702516429] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:57,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244228612] [2023-08-03 21:10:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:57,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:57,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:57,674 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 21:10:57,677 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 21:10:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:57,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:10:57,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:57,746 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 21:10:57,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244228612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 21:10:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631881304] [2023-08-03 21:10:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:57,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:57,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 246 [2023-08-03 21:10:57,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 21:10:57,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:57,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 246 [2023-08-03 21:10:57,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:59,791 INFO L124 PetriNetUnfolderBase]: 22553/34414 cut-off events. [2023-08-03 21:10:59,792 INFO L125 PetriNetUnfolderBase]: For 3484/3484 co-relation queries the response was YES. [2023-08-03 21:10:59,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69802 conditions, 34414 events. 22553/34414 cut-off events. For 3484/3484 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 266184 event pairs, 15148 based on Foata normal form. 0/32616 useless extension candidates. Maximal degree in co-relation 41876. Up to 22365 conditions per place. [2023-08-03 21:11:00,009 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 64 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 21:11:00,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 391 flow [2023-08-03 21:11:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:11:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:11:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-03 21:11:00,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6151761517615176 [2023-08-03 21:11:00,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-03 21:11:00,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-03 21:11:00,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:00,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-03 21:11:00,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 21:11:00,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:11:00,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:11:00,283 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 205 flow. Second operand 3 states and 454 transitions. [2023-08-03 21:11:00,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 391 flow [2023-08-03 21:11:00,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 384 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:11:00,287 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 210 flow [2023-08-03 21:11:00,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2023-08-03 21:11:00,288 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2023-08-03 21:11:00,288 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 210 flow [2023-08-03 21:11:00,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 21:11:00,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:00,289 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:00,317 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 21:11:00,497 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 21:11:00,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:00,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash -281716519, now seen corresponding path program 1 times [2023-08-03 21:11:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:00,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504753156] [2023-08-03 21:11:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:00,558 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 21:11:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504753156] [2023-08-03 21:11:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504753156] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:00,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704957829] [2023-08-03 21:11:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:00,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:00,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:00,566 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 21:11:00,571 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 21:11:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:00,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:11:00,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:00,648 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 21:11:00,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:11:00,677 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 21:11:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704957829] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:11:00,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:11:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:11:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185113543] [2023-08-03 21:11:00,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:11:00,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:11:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:11:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:11:00,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 246 [2023-08-03 21:11:00,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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 21:11:00,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:00,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 246 [2023-08-03 21:11:00,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:02,622 INFO L124 PetriNetUnfolderBase]: 20792/32008 cut-off events. [2023-08-03 21:11:02,623 INFO L125 PetriNetUnfolderBase]: For 7122/7122 co-relation queries the response was YES. [2023-08-03 21:11:02,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67042 conditions, 32008 events. 20792/32008 cut-off events. For 7122/7122 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 245488 event pairs, 14941 based on Foata normal form. 5/31142 useless extension candidates. Maximal degree in co-relation 20769. Up to 28862 conditions per place. [2023-08-03 21:11:02,839 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 54 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-03 21:11:02,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 78 transitions, 344 flow [2023-08-03 21:11:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:11:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:11:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2023-08-03 21:11:02,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813008130081301 [2023-08-03 21:11:02,841 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 572 transitions. [2023-08-03 21:11:02,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 572 transitions. [2023-08-03 21:11:02,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:02,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 572 transitions. [2023-08-03 21:11:02,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 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 21:11:02,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:02,846 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:02,846 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 210 flow. Second operand 4 states and 572 transitions. [2023-08-03 21:11:02,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 78 transitions, 344 flow [2023-08-03 21:11:02,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:11:02,892 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 206 flow [2023-08-03 21:11:02,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2023-08-03 21:11:02,895 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2023-08-03 21:11:02,895 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 206 flow [2023-08-03 21:11:02,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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 21:11:02,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:02,895 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:02,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-03 21:11:03,101 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 21:11:03,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:03,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1029215595, now seen corresponding path program 1 times [2023-08-03 21:11:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87213918] [2023-08-03 21:11:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:03,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:03,186 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 21:11:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87213918] [2023-08-03 21:11:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87213918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428018454] [2023-08-03 21:11:03,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:03,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:03,388 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 21:11:03,389 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 21:11:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:03,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:11:03,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:03,474 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 21:11:03,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:11:03,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428018454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:11:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:11:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:11:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618526034] [2023-08-03 21:11:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:11:03,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:11:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:11:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:11:03,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 246 [2023-08-03 21:11:03,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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 21:11:03,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:03,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 246 [2023-08-03 21:11:03,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:05,297 INFO L124 PetriNetUnfolderBase]: 18792/28617 cut-off events. [2023-08-03 21:11:05,297 INFO L125 PetriNetUnfolderBase]: For 5404/5404 co-relation queries the response was YES. [2023-08-03 21:11:05,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60182 conditions, 28617 events. 18792/28617 cut-off events. For 5404/5404 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 211898 event pairs, 4890 based on Foata normal form. 625/28464 useless extension candidates. Maximal degree in co-relation 39370. Up to 22741 conditions per place. [2023-08-03 21:11:05,467 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 78 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2023-08-03 21:11:05,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 444 flow [2023-08-03 21:11:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:11:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:11:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2023-08-03 21:11:05,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902439024390244 [2023-08-03 21:11:05,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2023-08-03 21:11:05,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2023-08-03 21:11:05,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:05,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2023-08-03 21:11:05,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 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 21:11:05,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 21:11:05,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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 21:11:05,474 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 206 flow. Second operand 5 states and 726 transitions. [2023-08-03 21:11:05,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 444 flow [2023-08-03 21:11:05,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 432 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 21:11:05,513 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 211 flow [2023-08-03 21:11:05,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2023-08-03 21:11:05,513 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2023-08-03 21:11:05,514 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 211 flow [2023-08-03 21:11:05,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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 21:11:05,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:05,514 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] [2023-08-03 21:11:05,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 21:11:05,719 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 21:11:05,720 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 21:11:05,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -104919362, now seen corresponding path program 1 times [2023-08-03 21:11:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:05,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337644846] [2023-08-03 21:11:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:05,774 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 21:11:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337644846] [2023-08-03 21:11:05,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337644846] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:05,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066377357] [2023-08-03 21:11:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:05,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:05,776 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 21:11:05,779 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 21:11:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:05,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:11:05,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:05,849 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 21:11:05,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:11:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066377357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:11:05,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:11:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 21:11:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134848883] [2023-08-03 21:11:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:11:05,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:11:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:11:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:11:05,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 246 [2023-08-03 21:11:05,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:05,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:05,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 246 [2023-08-03 21:11:05,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:07,678 INFO L124 PetriNetUnfolderBase]: 18013/27908 cut-off events. [2023-08-03 21:11:07,679 INFO L125 PetriNetUnfolderBase]: For 10284/10284 co-relation queries the response was YES. [2023-08-03 21:11:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60552 conditions, 27908 events. 18013/27908 cut-off events. For 10284/10284 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 211590 event pairs, 14497 based on Foata normal form. 0/27484 useless extension candidates. Maximal degree in co-relation 39670. Up to 20517 conditions per place. [2023-08-03 21:11:07,869 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 65 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 21:11:07,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 87 transitions, 397 flow [2023-08-03 21:11:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:11:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:11:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-03 21:11:07,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6151761517615176 [2023-08-03 21:11:07,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-03 21:11:07,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-03 21:11:07,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:07,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-03 21:11:07,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 21:11:07,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:11:07,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:11:07,875 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 211 flow. Second operand 3 states and 454 transitions. [2023-08-03 21:11:07,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 87 transitions, 397 flow [2023-08-03 21:11:07,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 390 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:11:07,918 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 216 flow [2023-08-03 21:11:07,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2023-08-03 21:11:07,919 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-03 21:11:07,919 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 216 flow [2023-08-03 21:11:07,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:07,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:07,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:07,925 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 21:11:08,125 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 21:11:08,125 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 21:11:08,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash -732013404, now seen corresponding path program 1 times [2023-08-03 21:11:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605924877] [2023-08-03 21:11:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:08,181 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 21:11:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605924877] [2023-08-03 21:11:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605924877] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375987086] [2023-08-03 21:11:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:08,184 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 21:11:08,210 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 21:11:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:08,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:11:08,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:08,294 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 21:11:08,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:11:08,318 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 21:11:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375987086] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:11:08,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:11:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:11:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958232734] [2023-08-03 21:11:08,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:11:08,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:11:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:11:08,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:11:08,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 246 [2023-08-03 21:11:08,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 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 21:11:08,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:08,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 246 [2023-08-03 21:11:08,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:10,112 INFO L124 PetriNetUnfolderBase]: 17218/25993 cut-off events. [2023-08-03 21:11:10,112 INFO L125 PetriNetUnfolderBase]: For 7501/7501 co-relation queries the response was YES. [2023-08-03 21:11:10,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57448 conditions, 25993 events. 17218/25993 cut-off events. For 7501/7501 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 189571 event pairs, 7892 based on Foata normal form. 125/26086 useless extension candidates. Maximal degree in co-relation 42641. Up to 20841 conditions per place. [2023-08-03 21:11:10,250 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 71 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-08-03 21:11:10,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 94 transitions, 416 flow [2023-08-03 21:11:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:11:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:11:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2023-08-03 21:11:10,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2023-08-03 21:11:10,252 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2023-08-03 21:11:10,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2023-08-03 21:11:10,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:10,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2023-08-03 21:11:10,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 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 21:11:10,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:10,256 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:10,256 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 216 flow. Second operand 4 states and 588 transitions. [2023-08-03 21:11:10,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 94 transitions, 416 flow [2023-08-03 21:11:10,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:11:10,457 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 212 flow [2023-08-03 21:11:10,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2023-08-03 21:11:10,458 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2023-08-03 21:11:10,458 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 212 flow [2023-08-03 21:11:10,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 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 21:11:10,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:10,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:10,463 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 21:11:10,659 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 21:11:10,660 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 21:11:10,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1705935749, now seen corresponding path program 1 times [2023-08-03 21:11:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360957556] [2023-08-03 21:11:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:10,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 21:11:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360957556] [2023-08-03 21:11:10,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360957556] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149015718] [2023-08-03 21:11:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:10,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:10,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:10,728 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 21:11:10,730 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 21:11:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:10,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:11:10,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:10,823 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 21:11:10,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:11:10,841 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 21:11:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149015718] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:11:10,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:11:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:11:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444054536] [2023-08-03 21:11:10,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:11:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:11:10,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:11:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:11:10,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 246 [2023-08-03 21:11:10,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 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 21:11:10,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:10,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 246 [2023-08-03 21:11:10,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:12,105 INFO L124 PetriNetUnfolderBase]: 13632/20817 cut-off events. [2023-08-03 21:11:12,105 INFO L125 PetriNetUnfolderBase]: For 9216/9216 co-relation queries the response was YES. [2023-08-03 21:11:12,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46170 conditions, 20817 events. 13632/20817 cut-off events. For 9216/9216 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 148213 event pairs, 5303 based on Foata normal form. 500/21049 useless extension candidates. Maximal degree in co-relation 43616. Up to 7668 conditions per place. [2023-08-03 21:11:12,235 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 79 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2023-08-03 21:11:12,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 462 flow [2023-08-03 21:11:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:11:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:11:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-08-03 21:11:12,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6067073170731707 [2023-08-03 21:11:12,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-08-03 21:11:12,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-08-03 21:11:12,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:12,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-08-03 21:11:12,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 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 21:11:12,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:12,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:12,240 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 212 flow. Second operand 4 states and 597 transitions. [2023-08-03 21:11:12,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 462 flow [2023-08-03 21:11:12,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 456 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:11:12,314 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 226 flow [2023-08-03 21:11:12,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2023-08-03 21:11:12,314 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2023-08-03 21:11:12,315 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 226 flow [2023-08-03 21:11:12,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 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 21:11:12,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:12,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:12,321 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 21:11:12,520 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 21:11:12,521 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 21:11:12,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 848237037, now seen corresponding path program 1 times [2023-08-03 21:11:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251209369] [2023-08-03 21:11:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:12,592 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 21:11:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251209369] [2023-08-03 21:11:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251209369] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848326446] [2023-08-03 21:11:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:12,594 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 21:11:12,619 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 21:11:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:12,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:11:12,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:12,690 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 21:11:12,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:11:12,704 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 21:11:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848326446] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:11:12,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:11:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:11:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652595930] [2023-08-03 21:11:12,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:11:12,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:11:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:11:12,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:11:12,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 246 [2023-08-03 21:11:12,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 226 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 21:11:12,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:12,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 246 [2023-08-03 21:11:12,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:14,267 INFO L124 PetriNetUnfolderBase]: 13616/21252 cut-off events. [2023-08-03 21:11:14,267 INFO L125 PetriNetUnfolderBase]: For 13056/13056 co-relation queries the response was YES. [2023-08-03 21:11:14,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49506 conditions, 21252 events. 13616/21252 cut-off events. For 13056/13056 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 155144 event pairs, 13009 based on Foata normal form. 21/21020 useless extension candidates. Maximal degree in co-relation 46870. Up to 18017 conditions per place. [2023-08-03 21:11:14,364 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 79 selfloop transitions, 3 changer transitions 2/104 dead transitions. [2023-08-03 21:11:14,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 478 flow [2023-08-03 21:11:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:11:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:11:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-08-03 21:11:14,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6067073170731707 [2023-08-03 21:11:14,366 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-08-03 21:11:14,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-08-03 21:11:14,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:14,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-08-03 21:11:14,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 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 21:11:14,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:14,370 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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 21:11:14,370 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 226 flow. Second operand 4 states and 597 transitions. [2023-08-03 21:11:14,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 478 flow [2023-08-03 21:11:14,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 474 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:11:14,460 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 230 flow [2023-08-03 21:11:14,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2023-08-03 21:11:14,461 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2023-08-03 21:11:14,461 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 230 flow [2023-08-03 21:11:14,461 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 21:11:14,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:14,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:14,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 21:11:14,662 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 21:11:14,662 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 21:11:14,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1013052003, now seen corresponding path program 1 times [2023-08-03 21:11:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502209421] [2023-08-03 21:11:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:11:14,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:11:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:11:14,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:11:14,887 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:11:14,888 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-03 21:11:14,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 21:11:14,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 21:11:14,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 21:11:14,889 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:14,893 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:11:14,893 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:11:14,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:11:14 BasicIcfg [2023-08-03 21:11:14,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:11:14,978 INFO L158 Benchmark]: Toolchain (without parser) took 33694.65ms. Allocated memory was 362.8MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 317.3MB in the beginning and 11.6GB in the end (delta: -11.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-03 21:11:14,978 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory is still 312.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:11:14,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.83ms. Allocated memory is still 362.8MB. Free memory was 317.3MB in the beginning and 306.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-03 21:11:14,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.07ms. Allocated memory is still 362.8MB. Free memory was 306.4MB in the beginning and 304.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:11:14,979 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 362.8MB. Free memory was 304.7MB in the beginning and 303.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:11:14,980 INFO L158 Benchmark]: RCFGBuilder took 369.19ms. Allocated memory is still 362.8MB. Free memory was 303.3MB in the beginning and 289.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-03 21:11:14,980 INFO L158 Benchmark]: TraceAbstraction took 32975.69ms. Allocated memory was 362.8MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 289.0MB in the beginning and 11.6GB in the end (delta: -11.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-03 21:11:14,982 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory is still 312.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 257.83ms. Allocated memory is still 362.8MB. Free memory was 317.3MB in the beginning and 306.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.07ms. Allocated memory is still 362.8MB. Free memory was 306.4MB in the beginning and 304.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 362.8MB. Free memory was 304.7MB in the beginning and 303.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 369.19ms. Allocated memory is still 362.8MB. Free memory was 303.3MB in the beginning and 289.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 32975.69ms. Allocated memory was 362.8MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 289.0MB in the beginning and 11.6GB in the end (delta: -11.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 106 PlacesBefore, 32 PlacesAfterwards, 111 TransitionsBefore, 31 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 92 TotalNumberOfCompositions, 4799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3743, independent: 3660, independent conditional: 0, independent unconditional: 3660, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1632, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3743, independent: 2051, independent conditional: 0, independent unconditional: 2051, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 1632, unknown conditional: 0, unknown unconditional: 1632] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 140 PlacesBefore, 64 PlacesAfterwards, 145 TransitionsBefore, 63 TransitionsAfterwards, 8176 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 93 TotalNumberOfCompositions, 32275 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12954, independent: 12551, independent conditional: 0, independent unconditional: 12551, dependent: 403, dependent conditional: 0, dependent unconditional: 403, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3932, independent: 3883, independent conditional: 0, independent unconditional: 3883, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12954, independent: 8668, independent conditional: 0, independent unconditional: 8668, dependent: 354, dependent conditional: 0, dependent unconditional: 354, unknown: 3932, unknown conditional: 0, unknown unconditional: 3932] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 559, Positive conditional cache size: 0, Positive unconditional cache size: 559, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 72]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 unsigned int x1, x2; [L59] 0 pthread_t t1[2], t2[2]; [L61] 0 x1 = __VERIFIER_nondet_uint() [L62] 0 x2 = __VERIFIER_nondet_uint() [L63] CALL 0 assume_abort_if_not(x1 == x2) [L35] COND FALSE 0 !(!cond) [L63] RET 0 assume_abort_if_not(x1 == x2) [L66] 0 int asdf=0; VAL [asdf=0, t1={3:0}, t2={5:0}, x1=4294967290, x2=4294967290] [L66] COND TRUE 0 asdf<2 [L66] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=0, pthread_create(&t1[asdf], 0, thread1, 0)=-2, t1={3:0}, t2={5:0}, x1=4294967290, x2=4294967290] [L41] 1 x2++ [L42] 1 x2++ VAL [x1=4294967290, x2++=4294967291, x2=4294967291] [L66] 0 asdf++ VAL [asdf=1, t1={3:0}, t2={5:0}, x1=4294967290, x2++=4294967291, x2=4294967291] [L66] COND TRUE 0 asdf<2 [L66] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=1, pthread_create(&t1[asdf], 0, thread1, 0)=-1, t1={3:0}, t2={5:0}, x1=4294967290, x2++=4294967291, x2=4294967291] [L41] 2 x2++ [L42] 2 x2++ [L43] 2 x2++ VAL [x1=4294967290, x2++=4294967291, x2++=4294967293, x2=4294967293] [L42] 1 x2++ VAL [x1=4294967290, x2++=4294967293, x2=4294967292] [L43] 1 x2++ [L44] 1 x2++ VAL [x1=4294967290, x2++=4294967293, x2++=4294967293, x2=4294967293] [L66] 0 asdf++ VAL [asdf=2, t1={3:0}, t2={5:0}, x1=4294967290, x2++=4294967293, x2++=4294967293, x2=4294967293] [L66] COND FALSE 0 !(asdf<2) [L67] 0 int asdf=0; VAL [asdf=0, asdf=2, t1={3:0}, t2={5:0}, x1=4294967290, x2++=4294967293, x2++=4294967293, x2=4294967293] [L67] COND TRUE 0 asdf<2 [L44] 1 x2++ [L46] 1 return 0; [L67] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [\result={0:0}, asdf=0, asdf=2, pthread_create(&t2[asdf], 0, thread2, 0)=0, t1={3:0}, t2={5:0}, x1=4294967290, x2++=4294967293, x2=4294967294] [L50] 3 x1++ VAL [\result={0:0}, x1=4294967291, x2++=4294967293, x2=4294967294] [L51] 3 x1++ [L52] 3 x1++ VAL [\result={0:0}, x1++=4294967292, x1=4294967292, x2++=4294967293, x2=4294967294] [L43] 2 x2++ VAL [\result={0:0}, x1++=4294967292, x1=4294967292, x2=4294967294] [L44] 2 x2++ [L46] 2 return 0; [L67] 0 asdf++ VAL [\result={0:0}, asdf=1, asdf=2, t1={3:0}, t2={5:0}, x1++=4294967292, x1=4294967292, x2=4294967295] [L67] COND TRUE 0 asdf<2 [L67] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [\result={0:0}, asdf=1, asdf=2, pthread_create(&t2[asdf], 0, thread2, 0)=1, t1={3:0}, t2={5:0}, x1++=4294967292, x1=4294967292, x2=4294967295] [L50] 4 x1++ [L51] 4 x1++ VAL [\result={0:0}, x1++=4294967292, x1++=4294967293, x1=4294967293, x2=4294967295] [L67] 0 asdf++ VAL [\result={0:0}, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1++=4294967292, x1++=4294967293, x1=4294967293, x2=4294967295] [L52] 3 x1++ VAL [\result={0:0}, x1++=4294967293, x1=4294967293, x2=4294967295] [L53] 3 x1++ [L55] 3 return 0; [L67] COND FALSE 0 !(asdf<2) [L68] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, asdf=0, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1++=4294967293, x1=4294967294, x2=4294967295] [L68] COND TRUE 0 asdf<2 [L68] 0 t1[asdf] VAL [\result={0:0}, \result={0:0}, asdf=0, asdf=2, asdf=2, t1={3:0}, t1[asdf]=-2, t2={5:0}, x1++=4294967293, x1=4294967294, x2=4294967295] [L51] 4 x1++ VAL [\result={0:0}, \result={0:0}, x1=4294967294, x2=4294967295] [L52] 4 x1++ [L53] 4 x1++ [L55] 4 return 0; [L68] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [\result={0:0}, \result={0:0}, asdf=0, asdf=2, asdf=2, t1={3:0}, t1[asdf]=-2, t2={5:0}, x1=4294967296, x2=4294967295] [L68] 0 asdf++ VAL [\result={0:0}, \result={0:0}, asdf=1, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1=4294967296, x2=4294967295] [L68] COND TRUE 0 asdf<2 [L68] 0 t1[asdf] VAL [\result={0:0}, \result={0:0}, asdf=1, asdf=2, asdf=2, t1={3:0}, t1[asdf]=-1, t2={5:0}, x1=4294967296, x2=4294967295] [L68] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [\result={0:0}, \result={0:0}, asdf=1, asdf=2, asdf=2, t1={3:0}, t1[asdf]=-1, t2={5:0}, x1=4294967296, x2=4294967295] [L68] 0 asdf++ VAL [\result={0:0}, \result={0:0}, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1=4294967296, x2=4294967295] [L68] COND FALSE 0 !(asdf<2) [L69] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1=4294967296, x2=4294967295] [L69] COND TRUE 0 asdf<2 [L69] 0 t2[asdf] VAL [\result={0:0}, \result={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, t2[asdf]=0, x1=4294967296, x2=4294967295] [L69] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [\result={0:0}, \result={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, t2[asdf]=0, x1=4294967296, x2=4294967295] [L69] 0 asdf++ VAL [\result={0:0}, \result={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1=4294967296, x2=4294967295] [L69] COND TRUE 0 asdf<2 [L69] 0 t2[asdf] VAL [\result={0:0}, \result={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, t2[asdf]=1, x1=4294967296, x2=4294967295] [L69] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [\result={0:0}, \result={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, t2[asdf]=1, x1=4294967296, x2=4294967295] [L69] 0 asdf++ VAL [\result={0:0}, \result={0:0}, asdf=2, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1=4294967296, x2=4294967295] [L69] COND FALSE 0 !(asdf<2) [L71] CALL 0 assume_abort_if_not(x1 != x2) [L35] COND FALSE 0 !(!cond) [L71] RET 0 assume_abort_if_not(x1 != x2) [L72] 0 reach_error() VAL [\result={0:0}, \result={0:0}, asdf=2, asdf=2, asdf=2, asdf=2, t1={3:0}, t2={5:0}, x1=4294967296, x2=4294967295] - UnprovableResult [Line: 66]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 140 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 170 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.1s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1324 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 19 mSDtfsCounter, 1324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 384 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 623 ConstructedInterpolants, 0 QuantifiedInterpolants, 877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 191/216 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 21:11:15,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...