/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 21:32:17,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 21:32:17,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 21:32:17,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 21:32:17,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 21:32:17,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 21:32:17,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 21:32:17,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 21:32:17,602 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 21:32:17,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 21:32:17,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 21:32:17,605 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 21:32:17,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 21:32:17,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 21:32:17,607 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 21:32:17,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 21:32:17,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 21:32:17,608 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 21:32:17,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 21:32:17,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:32:17,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 21:32:17,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 21:32:17,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 21:32:17,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 21:32:17,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 21:32:17,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 21:32:17,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 21:32:17,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 21:32:17,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 21:32:17,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 21:32:17,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 21:32:17,822 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 21:32:17,825 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 21:32:17,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-11-29 21:32:18,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 21:32:18,999 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 21:32:19,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-11-29 21:32:19,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d152b668/658a9307e6ad48cf9f3885d05fa30fd4/FLAGbbabc6a47 [2023-11-29 21:32:19,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d152b668/658a9307e6ad48cf9f3885d05fa30fd4 [2023-11-29 21:32:19,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 21:32:19,017 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 21:32:19,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 21:32:19,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 21:32:19,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 21:32:19,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@919ebcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19, skipping insertion in model container [2023-11-29 21:32:19,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,042 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 21:32:19,142 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3096,3109] [2023-11-29 21:32:19,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:32:19,155 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 21:32:19,172 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3096,3109] [2023-11-29 21:32:19,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:32:19,179 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:32:19,179 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:32:19,183 INFO L206 MainTranslator]: Completed translation [2023-11-29 21:32:19,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19 WrapperNode [2023-11-29 21:32:19,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 21:32:19,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 21:32:19,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 21:32:19,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 21:32:19,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,211 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-11-29 21:32:19,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 21:32:19,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 21:32:19,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 21:32:19,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 21:32:19,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 21:32:19,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 21:32:19,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 21:32:19,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 21:32:19,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (1/1) ... [2023-11-29 21:32:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:32:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:32:19,289 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-11-29 21:32:19,308 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-11-29 21:32:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 21:32:19,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 21:32:19,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 21:32:19,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 21:32:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 21:32:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 21:32:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 21:32:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 21:32:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 21:32:19,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 21:32:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 21:32:19,315 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 21:32:19,382 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 21:32:19,384 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 21:32:19,611 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 21:32:19,660 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 21:32:19,660 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 21:32:19,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:32:19 BoogieIcfgContainer [2023-11-29 21:32:19,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 21:32:19,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 21:32:19,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 21:32:19,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 21:32:19,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:32:19" (1/3) ... [2023-11-29 21:32:19,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381b72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:32:19, skipping insertion in model container [2023-11-29 21:32:19,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:32:19" (2/3) ... [2023-11-29 21:32:19,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381b72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:32:19, skipping insertion in model container [2023-11-29 21:32:19,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:32:19" (3/3) ... [2023-11-29 21:32:19,667 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2023-11-29 21:32:19,680 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 21:32:19,680 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 21:32:19,680 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 21:32:19,732 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 21:32:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 185 transitions, 391 flow [2023-11-29 21:32:19,803 INFO L124 PetriNetUnfolderBase]: 12/182 cut-off events. [2023-11-29 21:32:19,804 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:32:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 12/182 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2023-11-29 21:32:19,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 185 transitions, 391 flow [2023-11-29 21:32:19,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 171 transitions, 360 flow [2023-11-29 21:32:19,818 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 21:32:19,822 INFO L362 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=LoopHeads, 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;@98d2331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 21:32:19,822 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 21:32:19,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 21:32:19,888 INFO L124 PetriNetUnfolderBase]: 12/170 cut-off events. [2023-11-29 21:32:19,888 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:32:19,888 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:19,889 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:19,889 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:19,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2031779403, now seen corresponding path program 1 times [2023-11-29 21:32:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622677229] [2023-11-29 21:32:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622677229] [2023-11-29 21:32:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622677229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:32:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:32:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:32:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427882586] [2023-11-29 21:32:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:20,322 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:32:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:32:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:32:20,344 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 185 [2023-11-29 21:32:20,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 171 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 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-11-29 21:32:20,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:20,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 185 [2023-11-29 21:32:20,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:20,541 INFO L124 PetriNetUnfolderBase]: 31/283 cut-off events. [2023-11-29 21:32:20,541 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 21:32:20,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 283 events. 31/283 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 754 event pairs, 20 based on Foata normal form. 20/279 useless extension candidates. Maximal degree in co-relation 249. Up to 82 conditions per place. [2023-11-29 21:32:20,547 INFO L140 encePairwiseOnDemand]: 168/185 looper letters, 45 selfloop transitions, 0 changer transitions 10/167 dead transitions. [2023-11-29 21:32:20,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 462 flow [2023-11-29 21:32:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 21:32:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 21:32:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-11-29 21:32:20,564 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7288288288288288 [2023-11-29 21:32:20,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-11-29 21:32:20,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-11-29 21:32:20,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:20,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-11-29 21:32:20,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 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-11-29 21:32:20,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 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-11-29 21:32:20,581 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 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-11-29 21:32:20,584 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 5 predicate places. [2023-11-29 21:32:20,584 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 167 transitions, 462 flow [2023-11-29 21:32:20,585 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 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-11-29 21:32:20,585 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:20,585 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:20,586 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 21:32:20,586 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:20,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 244998717, now seen corresponding path program 1 times [2023-11-29 21:32:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:20,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940068936] [2023-11-29 21:32:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:20,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:21,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:21,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940068936] [2023-11-29 21:32:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940068936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:32:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:32:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:32:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084044993] [2023-11-29 21:32:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:21,049 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:32:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:32:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:32:21,052 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 185 [2023-11-29 21:32:21,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 167 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-29 21:32:21,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:21,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 185 [2023-11-29 21:32:21,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:21,850 INFO L124 PetriNetUnfolderBase]: 630/2294 cut-off events. [2023-11-29 21:32:21,850 INFO L125 PetriNetUnfolderBase]: For 871/1012 co-relation queries the response was YES. [2023-11-29 21:32:21,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4213 conditions, 2294 events. 630/2294 cut-off events. For 871/1012 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 18143 event pairs, 144 based on Foata normal form. 1/2117 useless extension candidates. Maximal degree in co-relation 2857. Up to 596 conditions per place. [2023-11-29 21:32:21,863 INFO L140 encePairwiseOnDemand]: 166/185 looper letters, 131 selfloop transitions, 17 changer transitions 101/339 dead transitions. [2023-11-29 21:32:21,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 339 transitions, 1642 flow [2023-11-29 21:32:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 21:32:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-29 21:32:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3370 transitions. [2023-11-29 21:32:21,869 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6072072072072072 [2023-11-29 21:32:21,869 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3370 transitions. [2023-11-29 21:32:21,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3370 transitions. [2023-11-29 21:32:21,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:21,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3370 transitions. [2023-11-29 21:32:21,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 112.33333333333333) internal successors, (3370), 30 states have internal predecessors, (3370), 0 states have call successors, (0), 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-11-29 21:32:21,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 185.0) internal successors, (5735), 31 states have internal predecessors, (5735), 0 states have call successors, (0), 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-11-29 21:32:21,885 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 185.0) internal successors, (5735), 31 states have internal predecessors, (5735), 0 states have call successors, (0), 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-11-29 21:32:21,886 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 34 predicate places. [2023-11-29 21:32:21,886 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 339 transitions, 1642 flow [2023-11-29 21:32:21,886 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-29 21:32:21,886 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:21,887 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:21,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 21:32:21,887 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:21,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1614175823, now seen corresponding path program 2 times [2023-11-29 21:32:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250380102] [2023-11-29 21:32:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:22,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250380102] [2023-11-29 21:32:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250380102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:32:22,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:32:22,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 21:32:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678130945] [2023-11-29 21:32:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:22,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 21:32:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 21:32:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-29 21:32:22,463 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 185 [2023-11-29 21:32:22,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 339 transitions, 1642 flow. Second operand has 16 states, 16 states have (on average 89.875) internal successors, (1438), 16 states have internal predecessors, (1438), 0 states have call successors, (0), 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-11-29 21:32:22,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:22,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 185 [2023-11-29 21:32:22,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:23,798 INFO L124 PetriNetUnfolderBase]: 827/3172 cut-off events. [2023-11-29 21:32:23,798 INFO L125 PetriNetUnfolderBase]: For 2123/2584 co-relation queries the response was YES. [2023-11-29 21:32:23,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7404 conditions, 3172 events. 827/3172 cut-off events. For 2123/2584 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28178 event pairs, 97 based on Foata normal form. 113/3062 useless extension candidates. Maximal degree in co-relation 4578. Up to 828 conditions per place. [2023-11-29 21:32:23,813 INFO L140 encePairwiseOnDemand]: 158/185 looper letters, 207 selfloop transitions, 30 changer transitions 202/515 dead transitions. [2023-11-29 21:32:23,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 515 transitions, 3589 flow [2023-11-29 21:32:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 21:32:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-29 21:32:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3550 transitions. [2023-11-29 21:32:23,819 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.49203049203049204 [2023-11-29 21:32:23,819 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3550 transitions. [2023-11-29 21:32:23,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3550 transitions. [2023-11-29 21:32:23,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:23,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3550 transitions. [2023-11-29 21:32:23,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 91.02564102564102) internal successors, (3550), 39 states have internal predecessors, (3550), 0 states have call successors, (0), 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-11-29 21:32:23,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 185.0) internal successors, (7400), 40 states have internal predecessors, (7400), 0 states have call successors, (0), 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-11-29 21:32:23,833 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 185.0) internal successors, (7400), 40 states have internal predecessors, (7400), 0 states have call successors, (0), 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-11-29 21:32:23,833 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 72 predicate places. [2023-11-29 21:32:23,834 INFO L500 AbstractCegarLoop]: Abstraction has has 241 places, 515 transitions, 3589 flow [2023-11-29 21:32:23,834 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 89.875) internal successors, (1438), 16 states have internal predecessors, (1438), 0 states have call successors, (0), 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-11-29 21:32:23,834 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:23,834 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:23,834 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 21:32:23,835 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:23,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1540689005, now seen corresponding path program 3 times [2023-11-29 21:32:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022398265] [2023-11-29 21:32:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022398265] [2023-11-29 21:32:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022398265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:32:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:32:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:32:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561240024] [2023-11-29 21:32:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:23,995 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:32:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:32:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:32:23,997 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 185 [2023-11-29 21:32:23,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 515 transitions, 3589 flow. Second operand has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 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-11-29 21:32:23,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:23,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 185 [2023-11-29 21:32:23,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:24,719 INFO L124 PetriNetUnfolderBase]: 1994/6051 cut-off events. [2023-11-29 21:32:24,720 INFO L125 PetriNetUnfolderBase]: For 7091/7593 co-relation queries the response was YES. [2023-11-29 21:32:24,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15985 conditions, 6051 events. 1994/6051 cut-off events. For 7091/7593 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 60273 event pairs, 662 based on Foata normal form. 10/5343 useless extension candidates. Maximal degree in co-relation 12557. Up to 2544 conditions per place. [2023-11-29 21:32:24,833 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 159 selfloop transitions, 9 changer transitions 190/519 dead transitions. [2023-11-29 21:32:24,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 519 transitions, 4215 flow [2023-11-29 21:32:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 21:32:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 21:32:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2023-11-29 21:32:24,835 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.652027027027027 [2023-11-29 21:32:24,836 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 965 transitions. [2023-11-29 21:32:24,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 965 transitions. [2023-11-29 21:32:24,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:24,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 965 transitions. [2023-11-29 21:32:24,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 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-11-29 21:32:24,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 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-11-29 21:32:24,840 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 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-11-29 21:32:24,840 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 79 predicate places. [2023-11-29 21:32:24,840 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 519 transitions, 4215 flow [2023-11-29 21:32:24,841 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 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-11-29 21:32:24,841 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:24,841 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:24,841 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 21:32:24,841 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:24,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash -188494668, now seen corresponding path program 1 times [2023-11-29 21:32:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91241261] [2023-11-29 21:32:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91241261] [2023-11-29 21:32:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91241261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:32:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63942313] [2023-11-29 21:32:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:24,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:32:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:32:24,962 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-11-29 21:32:25,003 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-11-29 21:32:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:25,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 21:32:25,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:32:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:25,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:32:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:32:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63942313] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:32:25,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:32:25,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-29 21:32:25,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815108217] [2023-11-29 21:32:25,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:25,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:32:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:32:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-29 21:32:25,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 185 [2023-11-29 21:32:25,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 519 transitions, 4215 flow. Second operand has 7 states, 7 states have (on average 144.28571428571428) internal successors, (1010), 7 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:32:25,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:25,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 185 [2023-11-29 21:32:25,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:26,317 INFO L124 PetriNetUnfolderBase]: 2842/7131 cut-off events. [2023-11-29 21:32:26,318 INFO L125 PetriNetUnfolderBase]: For 16214/17694 co-relation queries the response was YES. [2023-11-29 21:32:26,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23585 conditions, 7131 events. 2842/7131 cut-off events. For 16214/17694 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 67675 event pairs, 647 based on Foata normal form. 94/6310 useless extension candidates. Maximal degree in co-relation 19468. Up to 3379 conditions per place. [2023-11-29 21:32:26,352 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 117 selfloop transitions, 7 changer transitions 197/539 dead transitions. [2023-11-29 21:32:26,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 539 transitions, 4931 flow [2023-11-29 21:32:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:32:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:32:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1025 transitions. [2023-11-29 21:32:26,354 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7915057915057915 [2023-11-29 21:32:26,354 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1025 transitions. [2023-11-29 21:32:26,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1025 transitions. [2023-11-29 21:32:26,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:26,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1025 transitions. [2023-11-29 21:32:26,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.42857142857142) internal successors, (1025), 7 states have internal predecessors, (1025), 0 states have call successors, (0), 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-11-29 21:32:26,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:32:26,358 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:32:26,358 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 77 predicate places. [2023-11-29 21:32:26,358 INFO L500 AbstractCegarLoop]: Abstraction has has 246 places, 539 transitions, 4931 flow [2023-11-29 21:32:26,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.28571428571428) internal successors, (1010), 7 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:32:26,359 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:26,359 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:26,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 21:32:26,563 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:32:26,564 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:26,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -865742142, now seen corresponding path program 1 times [2023-11-29 21:32:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558457645] [2023-11-29 21:32:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:32:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558457645] [2023-11-29 21:32:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558457645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:32:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908711134] [2023-11-29 21:32:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:26,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:32:26,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:32:26,687 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-11-29 21:32:26,739 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-11-29 21:32:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:26,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 21:32:26,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:32:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:32:26,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:32:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:32:27,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908711134] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:32:27,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:32:27,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-29 21:32:27,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201402455] [2023-11-29 21:32:27,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:27,036 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:32:27,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:27,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:32:27,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-29 21:32:27,038 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 185 [2023-11-29 21:32:27,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 539 transitions, 4931 flow. Second operand has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 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-11-29 21:32:27,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:27,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 185 [2023-11-29 21:32:27,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:27,894 INFO L124 PetriNetUnfolderBase]: 3102/7152 cut-off events. [2023-11-29 21:32:27,894 INFO L125 PetriNetUnfolderBase]: For 22583/25032 co-relation queries the response was YES. [2023-11-29 21:32:27,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27321 conditions, 7152 events. 3102/7152 cut-off events. For 22583/25032 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 63197 event pairs, 557 based on Foata normal form. 201/6624 useless extension candidates. Maximal degree in co-relation 24779. Up to 3345 conditions per place. [2023-11-29 21:32:27,942 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 127 selfloop transitions, 8 changer transitions 154/461 dead transitions. [2023-11-29 21:32:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 461 transitions, 4589 flow [2023-11-29 21:32:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:32:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:32:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1025 transitions. [2023-11-29 21:32:27,944 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7915057915057915 [2023-11-29 21:32:27,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1025 transitions. [2023-11-29 21:32:27,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1025 transitions. [2023-11-29 21:32:27,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:27,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1025 transitions. [2023-11-29 21:32:27,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.42857142857142) internal successors, (1025), 7 states have internal predecessors, (1025), 0 states have call successors, (0), 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-11-29 21:32:27,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:32:27,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:32:27,949 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 71 predicate places. [2023-11-29 21:32:27,949 INFO L500 AbstractCegarLoop]: Abstraction has has 240 places, 461 transitions, 4589 flow [2023-11-29 21:32:27,949 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 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-11-29 21:32:27,949 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:27,949 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:27,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 21:32:28,154 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 21:32:28,155 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:28,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 491669360, now seen corresponding path program 1 times [2023-11-29 21:32:28,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:28,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517952582] [2023-11-29 21:32:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:32:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517952582] [2023-11-29 21:32:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517952582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:32:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949098581] [2023-11-29 21:32:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:29,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:32:29,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:32:29,057 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-11-29 21:32:29,084 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-11-29 21:32:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:29,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 21:32:29,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:32:29,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 21:32:29,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 21:32:29,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 21:32:29,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:32:29,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 21:32:29,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 21:32:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:32:30,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:32:32,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_156 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ .cse1 2)) (< .cse2 (+ .cse1 1))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_156 (Array Int Int))) (let ((.cse3 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset) 1)) (< .cse2 .cse3))))))) is different from false [2023-11-29 21:32:32,499 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 c_~A~0.base)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ .cse1 2)) (< (select .cse0 c_~A~0.offset) (+ .cse1 1)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< (select .cse3 c_~A~0.offset) .cse4) (< .cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset) 1)))))))) is different from false [2023-11-29 21:32:32,617 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 c_~A~0.base)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ 2 .cse1)) (< (select .cse0 c_~A~0.offset) (+ .cse1 1)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse5 (select .cse4 c_~A~0.base))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset) 1)) (< (select .cse5 c_~A~0.offset) .cse3))))))) is different from false [2023-11-29 21:32:32,843 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse1 (select .cse0 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) (or (< (select .cse0 |c_ULTIMATE.start_main_#t~ret17#1.offset|) .cse1) (< .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) 1))))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (or (< (select .cse3 |c_ULTIMATE.start_main_#t~ret17#1.offset|) (+ .cse4 1)) (< (select .cse3 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_main_#t~ret17#1.offset|)) (+ .cse4 2))))))) is different from false [2023-11-29 21:32:32,893 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse1 1)) (< (select .cse0 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ 2 .cse1)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse3 (select .cse5 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse3))))))) is different from false [2023-11-29 21:32:32,916 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse1 1)) (< (select .cse0 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ .cse1 2)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse3))))))) is different from false [2023-11-29 21:32:33,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:32:33,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 73 [2023-11-29 21:32:33,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:32:33,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5291 treesize of output 4819 [2023-11-29 21:32:33,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:32:33,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 123 [2023-11-29 21:32:33,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:32:33,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-11-29 21:32:33,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2023-11-29 21:32:33,152 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 21:32:33,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2023-11-29 21:32:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 21:32:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949098581] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:32:33,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:32:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 20] total 48 [2023-11-29 21:32:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964508741] [2023-11-29 21:32:33,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:32:33,265 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 21:32:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 21:32:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1564, Unknown=19, NotChecked=510, Total=2256 [2023-11-29 21:32:33,268 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 185 [2023-11-29 21:32:33,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 461 transitions, 4589 flow. Second operand has 48 states, 48 states have (on average 76.02083333333333) internal successors, (3649), 48 states have internal predecessors, (3649), 0 states have call successors, (0), 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-11-29 21:32:33,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:33,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 185 [2023-11-29 21:32:33,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:40,398 INFO L124 PetriNetUnfolderBase]: 17314/34407 cut-off events. [2023-11-29 21:32:40,399 INFO L125 PetriNetUnfolderBase]: For 85246/86147 co-relation queries the response was YES. [2023-11-29 21:32:40,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138866 conditions, 34407 events. 17314/34407 cut-off events. For 85246/86147 co-relation queries the response was YES. Maximal size of possible extension queue 1629. Compared 355364 event pairs, 370 based on Foata normal form. 116/32125 useless extension candidates. Maximal degree in co-relation 131774. Up to 11401 conditions per place. [2023-11-29 21:32:40,590 INFO L140 encePairwiseOnDemand]: 155/185 looper letters, 624 selfloop transitions, 93 changer transitions 951/1743 dead transitions. [2023-11-29 21:32:40,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1743 transitions, 21203 flow [2023-11-29 21:32:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-29 21:32:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-29 21:32:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4356 transitions. [2023-11-29 21:32:40,599 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.436036036036036 [2023-11-29 21:32:40,599 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4356 transitions. [2023-11-29 21:32:40,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4356 transitions. [2023-11-29 21:32:40,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:40,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4356 transitions. [2023-11-29 21:32:40,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 80.66666666666667) internal successors, (4356), 54 states have internal predecessors, (4356), 0 states have call successors, (0), 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-11-29 21:32:40,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 185.0) internal successors, (10175), 55 states have internal predecessors, (10175), 0 states have call successors, (0), 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-11-29 21:32:40,628 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 185.0) internal successors, (10175), 55 states have internal predecessors, (10175), 0 states have call successors, (0), 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-11-29 21:32:40,629 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 124 predicate places. [2023-11-29 21:32:40,629 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 1743 transitions, 21203 flow [2023-11-29 21:32:40,630 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 76.02083333333333) internal successors, (3649), 48 states have internal predecessors, (3649), 0 states have call successors, (0), 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-11-29 21:32:40,630 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:40,631 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:40,656 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-11-29 21:32:40,839 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:32:40,840 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:40,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -232015370, now seen corresponding path program 2 times [2023-11-29 21:32:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599845814] [2023-11-29 21:32:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:32:41,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:41,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599845814] [2023-11-29 21:32:41,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599845814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:32:41,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:32:41,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:32:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901865229] [2023-11-29 21:32:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:32:41,137 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:32:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:32:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:32:41,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 185 [2023-11-29 21:32:41,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1743 transitions, 21203 flow. Second operand has 8 states, 8 states have (on average 130.75) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 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-11-29 21:32:41,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:41,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 185 [2023-11-29 21:32:41,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:32:49,477 INFO L124 PetriNetUnfolderBase]: 23418/47215 cut-off events. [2023-11-29 21:32:49,477 INFO L125 PetriNetUnfolderBase]: For 150786/152032 co-relation queries the response was YES. [2023-11-29 21:32:49,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201400 conditions, 47215 events. 23418/47215 cut-off events. For 150786/152032 co-relation queries the response was YES. Maximal size of possible extension queue 2175. Compared 515435 event pairs, 633 based on Foata normal form. 119/43893 useless extension candidates. Maximal degree in co-relation 179167. Up to 16114 conditions per place. [2023-11-29 21:32:49,952 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 387 selfloop transitions, 7 changer transitions 1656/2435 dead transitions. [2023-11-29 21:32:49,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 2435 transitions, 35504 flow [2023-11-29 21:32:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 21:32:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 21:32:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1571 transitions. [2023-11-29 21:32:49,954 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7076576576576576 [2023-11-29 21:32:49,954 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1571 transitions. [2023-11-29 21:32:49,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1571 transitions. [2023-11-29 21:32:49,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:32:49,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1571 transitions. [2023-11-29 21:32:49,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 130.91666666666666) internal successors, (1571), 12 states have internal predecessors, (1571), 0 states have call successors, (0), 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-11-29 21:32:49,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 185.0) internal successors, (2405), 13 states have internal predecessors, (2405), 0 states have call successors, (0), 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-11-29 21:32:49,958 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 185.0) internal successors, (2405), 13 states have internal predecessors, (2405), 0 states have call successors, (0), 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-11-29 21:32:49,960 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 135 predicate places. [2023-11-29 21:32:49,961 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 2435 transitions, 35504 flow [2023-11-29 21:32:49,961 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.75) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 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-11-29 21:32:49,961 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:32:49,961 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:32:49,961 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 21:32:49,961 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:32:49,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:32:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1542482746, now seen corresponding path program 3 times [2023-11-29 21:32:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:32:49,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231561982] [2023-11-29 21:32:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:32:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:32:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:32:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:32:50,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:32:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231561982] [2023-11-29 21:32:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231561982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:32:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122470500] [2023-11-29 21:32:50,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 21:32:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:32:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:32:50,285 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-11-29 21:32:50,347 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-11-29 21:32:50,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 21:32:50,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:32:50,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 21:32:50,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:32:50,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:32:50,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 21:32:50,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 21:32:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:32:50,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:32:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:32:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122470500] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:32:51,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:32:51,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 10] total 33 [2023-11-29 21:32:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908561672] [2023-11-29 21:32:51,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:32:51,284 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 21:32:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:32:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 21:32:51,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=923, Unknown=3, NotChecked=0, Total=1056 [2023-11-29 21:32:51,290 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 185 [2023-11-29 21:32:51,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 2435 transitions, 35504 flow. Second operand has 33 states, 33 states have (on average 88.48484848484848) internal successors, (2920), 33 states have internal predecessors, (2920), 0 states have call successors, (0), 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-11-29 21:32:51,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:32:51,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 185 [2023-11-29 21:32:51,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:33:19,709 INFO L124 PetriNetUnfolderBase]: 55361/111878 cut-off events. [2023-11-29 21:33:19,709 INFO L125 PetriNetUnfolderBase]: For 487399/491572 co-relation queries the response was YES. [2023-11-29 21:33:20,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518237 conditions, 111878 events. 55361/111878 cut-off events. For 487399/491572 co-relation queries the response was YES. Maximal size of possible extension queue 5466. Compared 1372065 event pairs, 1458 based on Foata normal form. 489/103822 useless extension candidates. Maximal degree in co-relation 452112. Up to 38774 conditions per place. [2023-11-29 21:33:20,413 INFO L140 encePairwiseOnDemand]: 134/185 looper letters, 183 selfloop transitions, 57 changer transitions 6051/6459 dead transitions. [2023-11-29 21:33:20,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 6459 transitions, 111032 flow [2023-11-29 21:33:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-29 21:33:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-29 21:33:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 6000 transitions. [2023-11-29 21:33:20,420 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4700352526439483 [2023-11-29 21:33:20,420 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 6000 transitions. [2023-11-29 21:33:20,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 6000 transitions. [2023-11-29 21:33:20,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:33:20,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 6000 transitions. [2023-11-29 21:33:20,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 86.95652173913044) internal successors, (6000), 69 states have internal predecessors, (6000), 0 states have call successors, (0), 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-11-29 21:33:20,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 185.0) internal successors, (12950), 70 states have internal predecessors, (12950), 0 states have call successors, (0), 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-11-29 21:33:20,443 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 185.0) internal successors, (12950), 70 states have internal predecessors, (12950), 0 states have call successors, (0), 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-11-29 21:33:20,444 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 203 predicate places. [2023-11-29 21:33:20,444 INFO L500 AbstractCegarLoop]: Abstraction has has 372 places, 6459 transitions, 111032 flow [2023-11-29 21:33:20,445 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 88.48484848484848) internal successors, (2920), 33 states have internal predecessors, (2920), 0 states have call successors, (0), 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-11-29 21:33:20,445 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:33:20,445 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:33:20,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 21:33:20,652 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:33:20,652 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:33:20,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:33:20,653 INFO L85 PathProgramCache]: Analyzing trace with hash -635189960, now seen corresponding path program 4 times [2023-11-29 21:33:20,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:33:20,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815987857] [2023-11-29 21:33:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:33:20,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:33:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:33:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:33:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:33:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815987857] [2023-11-29 21:33:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815987857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:33:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976402876] [2023-11-29 21:33:21,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 21:33:21,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:33:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:33:21,072 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-11-29 21:33:21,090 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-11-29 21:33:21,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 21:33:21,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:33:21,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 21:33:21,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:33:21,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:33:21,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 21:33:21,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 21:33:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:33:21,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:33:23,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-29 21:33:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:33:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976402876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:33:24,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:33:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 40 [2023-11-29 21:33:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62575666] [2023-11-29 21:33:24,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:33:24,126 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 21:33:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:33:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 21:33:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1387, Unknown=5, NotChecked=0, Total=1560 [2023-11-29 21:33:24,131 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2023-11-29 21:33:24,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 6459 transitions, 111032 flow. Second operand has 40 states, 40 states have (on average 85.675) internal successors, (3427), 40 states have internal predecessors, (3427), 0 states have call successors, (0), 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-11-29 21:33:24,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:33:24,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2023-11-29 21:33:24,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:35:20,980 INFO L124 PetriNetUnfolderBase]: 90098/182566 cut-off events. [2023-11-29 21:35:20,981 INFO L125 PetriNetUnfolderBase]: For 954454/962486 co-relation queries the response was YES. [2023-11-29 21:35:21,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947377 conditions, 182566 events. 90098/182566 cut-off events. For 954454/962486 co-relation queries the response was YES. Maximal size of possible extension queue 9030. Compared 2377899 event pairs, 1060 based on Foata normal form. 592/169287 useless extension candidates. Maximal degree in co-relation 824817. Up to 63061 conditions per place. [2023-11-29 21:35:22,260 INFO L140 encePairwiseOnDemand]: 158/185 looper letters, 0 selfloop transitions, 0 changer transitions 12550/12550 dead transitions. [2023-11-29 21:35:22,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 12550 transitions, 236512 flow [2023-11-29 21:35:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-29 21:35:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-29 21:35:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4340 transitions. [2023-11-29 21:35:22,291 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.47876447876447875 [2023-11-29 21:35:22,292 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4340 transitions. [2023-11-29 21:35:22,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4340 transitions. [2023-11-29 21:35:22,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:35:22,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4340 transitions. [2023-11-29 21:35:22,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 88.57142857142857) internal successors, (4340), 49 states have internal predecessors, (4340), 0 states have call successors, (0), 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-11-29 21:35:22,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 185.0) internal successors, (9250), 50 states have internal predecessors, (9250), 0 states have call successors, (0), 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-11-29 21:35:22,315 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 185.0) internal successors, (9250), 50 states have internal predecessors, (9250), 0 states have call successors, (0), 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-11-29 21:35:22,315 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 247 predicate places. [2023-11-29 21:35:22,315 INFO L500 AbstractCegarLoop]: Abstraction has has 416 places, 12550 transitions, 236512 flow [2023-11-29 21:35:22,316 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 85.675) internal successors, (3427), 40 states have internal predecessors, (3427), 0 states have call successors, (0), 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-11-29 21:35:22,321 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-min-max-1.wvr.c_BEv2_AllErrorsAtOnce [2023-11-29 21:35:22,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 21:35:22,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 21:35:22,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 21:35:22,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 21:35:22,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 21:35:22,613 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 21:35:22,614 INFO L457 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1] [2023-11-29 21:35:22,616 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 21:35:22,616 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 21:35:22,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:35:22 BasicIcfg [2023-11-29 21:35:22,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 21:35:22,621 INFO L158 Benchmark]: Toolchain (without parser) took 183603.81ms. Allocated memory was 354.4MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 302.3MB in the beginning and 5.8GB in the end (delta: -5.5GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-11-29 21:35:22,621 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 354.4MB. Free memory was 307.3MB in the beginning and 307.1MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:35:22,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.24ms. Allocated memory is still 354.4MB. Free memory was 301.8MB in the beginning and 289.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 21:35:22,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.62ms. Allocated memory is still 354.4MB. Free memory was 289.6MB in the beginning and 288.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:35:22,621 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 354.4MB. Free memory was 287.5MB in the beginning and 286.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:35:22,621 INFO L158 Benchmark]: RCFGBuilder took 417.64ms. Allocated memory is still 354.4MB. Free memory was 286.0MB in the beginning and 262.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-29 21:35:22,622 INFO L158 Benchmark]: TraceAbstraction took 182957.18ms. Allocated memory was 354.4MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 261.8MB in the beginning and 5.8GB in the end (delta: -5.5GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-11-29 21:35:22,622 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 354.4MB. Free memory was 307.3MB in the beginning and 307.1MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 166.24ms. Allocated memory is still 354.4MB. Free memory was 301.8MB in the beginning and 289.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.62ms. Allocated memory is still 354.4MB. Free memory was 289.6MB in the beginning and 288.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 354.4MB. Free memory was 287.5MB in the beginning and 286.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 417.64ms. Allocated memory is still 354.4MB. Free memory was 286.0MB in the beginning and 262.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 182957.18ms. Allocated memory was 354.4MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 261.8MB in the beginning and 5.8GB in the end (delta: -5.5GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 182.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 168.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3207 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3207 mSDsluCounter, 5969 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3054 IncrementalHoareTripleChecker+Unchecked, 5368 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6434 IncrementalHoareTripleChecker+Invalid, 9718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 601 mSDtfsCounter, 6434 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1876 GetRequests, 1457 SyntacticMatches, 12 SemanticMatches, 407 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6875 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236512occurred in iteration=10, InterpolantAutomatonStates: 281, 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.5s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 2251 NumberOfCodeBlocks, 2251 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3001 ConstructedInterpolants, 65 QuantifiedInterpolants, 17958 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1734 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 24/39 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 21:35:22,648 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...