/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 09:11:29,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 09:11:29,155 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-VariableLbe.epf [2023-08-24 09:11:29,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 09:11:29,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 09:11:29,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 09:11:29,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 09:11:29,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 09:11:29,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 09:11:29,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 09:11:29,180 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 09:11:29,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 09:11:29,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 09:11:29,182 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 09:11:29,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 09:11:29,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 09:11:29,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 09:11:29,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 09:11:29,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 09:11:29,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 09:11:29,184 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 09:11:29,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 09:11:29,185 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 09:11:29,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 09:11:29,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 09:11:29,186 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 09:11:29,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 09:11:29,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:11:29,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 09:11:29,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 09:11:29,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 09:11:29,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 09:11:29,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 09:11:29,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 09:11:29,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 09:11:29,189 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 09:11:29,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 09:11:29,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 09:11:29,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 09:11:29,518 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 09:11:29,518 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 09:11:29,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-24 09:11:30,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 09:11:30,904 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 09:11:30,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-24 09:11:30,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9cf6f04/1cb1bc81aec242df97538521dca33d76/FLAGb903943f3 [2023-08-24 09:11:30,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9cf6f04/1cb1bc81aec242df97538521dca33d76 [2023-08-24 09:11:30,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 09:11:30,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 09:11:30,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 09:11:30,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 09:11:30,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 09:11:30,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:11:30" (1/1) ... [2023-08-24 09:11:30,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9e8aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:30, skipping insertion in model container [2023-08-24 09:11:30,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:11:30" (1/1) ... [2023-08-24 09:11:30,947 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 09:11:31,104 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/popl20-more-array-sum.wvr.c[2835,2848] [2023-08-24 09:11:31,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:11:31,125 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 09:11:31,157 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/popl20-more-array-sum.wvr.c[2835,2848] [2023-08-24 09:11:31,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:11:31,170 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:11:31,171 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:11:31,181 INFO L206 MainTranslator]: Completed translation [2023-08-24 09:11:31,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31 WrapperNode [2023-08-24 09:11:31,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 09:11:31,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 09:11:31,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 09:11:31,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 09:11:31,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,250 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 289 [2023-08-24 09:11:31,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 09:11:31,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 09:11:31,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 09:11:31,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 09:11:31,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 09:11:31,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 09:11:31,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 09:11:31,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 09:11:31,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (1/1) ... [2023-08-24 09:11:31,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:11:31,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:11:31,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 09:11:31,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 09:11:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 09:11:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 09:11:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 09:11:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 09:11:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 09:11:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 09:11:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 09:11:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 09:11:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 09:11:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 09:11:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 09:11:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 09:11:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 09:11:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 09:11:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 09:11:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 09:11:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 09:11:31,388 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 09:11:31,505 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 09:11:31,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 09:11:31,917 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 09:11:32,163 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 09:11:32,163 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-24 09:11:32,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:11:32 BoogieIcfgContainer [2023-08-24 09:11:32,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 09:11:32,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 09:11:32,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 09:11:32,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 09:11:32,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 09:11:30" (1/3) ... [2023-08-24 09:11:32,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17565558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:11:32, skipping insertion in model container [2023-08-24 09:11:32,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:11:31" (2/3) ... [2023-08-24 09:11:32,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17565558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:11:32, skipping insertion in model container [2023-08-24 09:11:32,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:11:32" (3/3) ... [2023-08-24 09:11:32,172 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-08-24 09:11:32,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 09:11:32,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 09:11:32,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 09:11:32,252 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 09:11:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 400 flow [2023-08-24 09:11:32,372 INFO L124 PetriNetUnfolderBase]: 16/185 cut-off events. [2023-08-24 09:11:32,372 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:11:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 16/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 126 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-08-24 09:11:32,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 400 flow [2023-08-24 09:11:32,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 175 transitions, 368 flow [2023-08-24 09:11:32,387 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 09:11:32,394 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 175 transitions, 368 flow [2023-08-24 09:11:32,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 175 transitions, 368 flow [2023-08-24 09:11:32,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 175 transitions, 368 flow [2023-08-24 09:11:32,429 INFO L124 PetriNetUnfolderBase]: 16/175 cut-off events. [2023-08-24 09:11:32,429 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:11:32,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 175 events. 16/175 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 125 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-08-24 09:11:32,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-08-24 09:11:38,386 INFO L134 LiptonReduction]: Checked pairs total: 2271 [2023-08-24 09:11:38,387 INFO L136 LiptonReduction]: Total number of compositions: 174 [2023-08-24 09:11:38,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 09:11:38,404 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@696abbb9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 09:11:38,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 09:11:38,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 09:11:38,411 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2023-08-24 09:11:38,412 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:11:38,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:11:38,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:11:38,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:11:38,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:11:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1883863174, now seen corresponding path program 1 times [2023-08-24 09:11:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:11:38,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736430415] [2023-08-24 09:11:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:11:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:11:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:11:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736430415] [2023-08-24 09:11:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736430415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:11:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:11:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 09:11:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398005279] [2023-08-24 09:11:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:11:39,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:11:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:11:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:11:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:11:39,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 362 [2023-08-24 09:11:39,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:11:39,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 362 [2023-08-24 09:11:39,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:11:39,422 INFO L124 PetriNetUnfolderBase]: 438/613 cut-off events. [2023-08-24 09:11:39,422 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-08-24 09:11:39,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 613 events. 438/613 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2026 event pairs, 247 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 986. Up to 605 conditions per place. [2023-08-24 09:11:39,428 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 24 selfloop transitions, 4 changer transitions 3/33 dead transitions. [2023-08-24 09:11:39,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 146 flow [2023-08-24 09:11:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:11:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:11:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-24 09:11:39,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3751381215469613 [2023-08-24 09:11:39,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-24 09:11:39,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-24 09:11:39,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:11:39,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-24 09:11:39,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,463 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 5 states and 679 transitions. [2023-08-24 09:11:39,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 146 flow [2023-08-24 09:11:39,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 09:11:39,470 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 90 flow [2023-08-24 09:11:39,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-08-24 09:11:39,474 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-08-24 09:11:39,474 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 90 flow [2023-08-24 09:11:39,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:11:39,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:11:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 09:11:39,475 INFO L420 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-08-24 09:11:39,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:11:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1747603798, now seen corresponding path program 1 times [2023-08-24 09:11:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:11:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050525343] [2023-08-24 09:11:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:11:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:11:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:11:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050525343] [2023-08-24 09:11:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050525343] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:11:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607198091] [2023-08-24 09:11:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:39,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:11:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:11:39,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:11:39,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 09:11:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:39,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 09:11:39,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:11:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:11:39,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:11:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:11:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607198091] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 09:11:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 09:11:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-24 09:11:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889353312] [2023-08-24 09:11:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:11:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 09:11:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:11:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 09:11:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-24 09:11:39,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2023-08-24 09:11:39,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:11:39,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2023-08-24 09:11:39,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:11:39,967 INFO L124 PetriNetUnfolderBase]: 514/729 cut-off events. [2023-08-24 09:11:39,967 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-24 09:11:39,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 729 events. 514/729 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2588 event pairs, 127 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1463. Up to 563 conditions per place. [2023-08-24 09:11:39,972 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-24 09:11:39,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 196 flow [2023-08-24 09:11:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:11:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:11:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-24 09:11:39,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812154696132597 [2023-08-24 09:11:39,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-24 09:11:39,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-24 09:11:39,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:11:39,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-24 09:11:39,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,981 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,981 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 90 flow. Second operand 5 states and 690 transitions. [2023-08-24 09:11:39,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 196 flow [2023-08-24 09:11:39,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 186 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 09:11:39,983 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 96 flow [2023-08-24 09:11:39,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2023-08-24 09:11:39,983 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-08-24 09:11:39,984 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 96 flow [2023-08-24 09:11:39,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:39,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:11:39,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:11:39,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 09:11:40,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:11:40,191 INFO L420 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-08-24 09:11:40,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:11:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1434012832, now seen corresponding path program 1 times [2023-08-24 09:11:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:11:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990785485] [2023-08-24 09:11:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:11:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:11:40,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:11:40,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990785485] [2023-08-24 09:11:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990785485] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:11:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629720461] [2023-08-24 09:11:40,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:11:40,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:11:40,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:11:40,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 09:11:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:40,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:11:40,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:11:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:11:40,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:11:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:11:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629720461] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 09:11:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 09:11:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2023-08-24 09:11:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560188763] [2023-08-24 09:11:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:11:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 09:11:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:11:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 09:11:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:11:40,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:11:40,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 96 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:40,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:11:40,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:11:40,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:11:40,941 INFO L124 PetriNetUnfolderBase]: 690/1012 cut-off events. [2023-08-24 09:11:40,942 INFO L125 PetriNetUnfolderBase]: For 181/255 co-relation queries the response was YES. [2023-08-24 09:11:40,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2358 conditions, 1012 events. 690/1012 cut-off events. For 181/255 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3764 event pairs, 160 based on Foata normal form. 74/845 useless extension candidates. Maximal degree in co-relation 2330. Up to 380 conditions per place. [2023-08-24 09:11:40,949 INFO L140 encePairwiseOnDemand]: 351/362 looper letters, 68 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2023-08-24 09:11:40,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 85 transitions, 409 flow [2023-08-24 09:11:40,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:11:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:11:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1055 transitions. [2023-08-24 09:11:40,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36429558011049723 [2023-08-24 09:11:40,953 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1055 transitions. [2023-08-24 09:11:40,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1055 transitions. [2023-08-24 09:11:40,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:11:40,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1055 transitions. [2023-08-24 09:11:40,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:40,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:40,962 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:40,962 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 96 flow. Second operand 8 states and 1055 transitions. [2023-08-24 09:11:40,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 85 transitions, 409 flow [2023-08-24 09:11:40,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 389 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 09:11:40,965 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 192 flow [2023-08-24 09:11:40,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-24 09:11:40,966 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-08-24 09:11:40,967 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 192 flow [2023-08-24 09:11:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:40,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:11:40,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:11:40,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 09:11:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-24 09:11:41,176 INFO L420 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-08-24 09:11:41,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:11:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1945135670, now seen corresponding path program 2 times [2023-08-24 09:11:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:11:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865938459] [2023-08-24 09:11:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:11:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:11:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:11:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865938459] [2023-08-24 09:11:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865938459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:11:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921755666] [2023-08-24 09:11:41,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:11:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:11:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:11:41,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:11:41,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 09:11:41,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 09:11:41,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:11:41,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 09:11:41,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:11:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:11:41,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 09:11:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921755666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:11:41,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 09:11:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-08-24 09:11:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256053452] [2023-08-24 09:11:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:11:41,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:11:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:11:41,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:11:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-24 09:11:41,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 362 [2023-08-24 09:11:41,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:41,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:11:41,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 362 [2023-08-24 09:11:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:11:41,677 INFO L124 PetriNetUnfolderBase]: 564/822 cut-off events. [2023-08-24 09:11:41,678 INFO L125 PetriNetUnfolderBase]: For 692/748 co-relation queries the response was YES. [2023-08-24 09:11:41,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 822 events. 564/822 cut-off events. For 692/748 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2947 event pairs, 198 based on Foata normal form. 98/851 useless extension candidates. Maximal degree in co-relation 2581. Up to 468 conditions per place. [2023-08-24 09:11:41,684 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 44 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2023-08-24 09:11:41,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 324 flow [2023-08-24 09:11:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 09:11:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 09:11:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2023-08-24 09:11:41,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44060773480662985 [2023-08-24 09:11:41,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2023-08-24 09:11:41,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2023-08-24 09:11:41,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:11:41,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2023-08-24 09:11:41,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:41,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:41,698 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:41,698 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 192 flow. Second operand 4 states and 638 transitions. [2023-08-24 09:11:41,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 324 flow [2023-08-24 09:11:41,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 09:11:41,705 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 208 flow [2023-08-24 09:11:41,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-24 09:11:41,707 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-08-24 09:11:41,707 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 208 flow [2023-08-24 09:11:41,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:11:41,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:11:41,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:11:41,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 09:11:41,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:11:41,913 INFO L420 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-08-24 09:11:41,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:11:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1258187663, now seen corresponding path program 1 times [2023-08-24 09:11:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:11:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450668201] [2023-08-24 09:11:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:11:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:11:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:11:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450668201] [2023-08-24 09:11:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450668201] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:11:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135918765] [2023-08-24 09:11:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:11:43,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:11:43,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:11:43,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:11:43,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 09:11:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:11:44,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 83 conjunts are in the unsatisfiable core [2023-08-24 09:11:44,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:11:44,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 09:11:44,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 09:11:44,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:11:44,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:11:44,626 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 09:11:44,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 09:11:44,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:11:44,731 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 09:11:44,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 09:11:44,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:11:44,871 INFO L322 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-24 09:11:44,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2023-08-24 09:11:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:11:44,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:11:45,106 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (= c_~res1~0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))))) is different from false [2023-08-24 09:11:45,120 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse0 c_~B~0.offset)) c_~res1~0)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238)) (.cse2 (* 4 c_~M~0))) (+ (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) c_~res2~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)))))) is different from false [2023-08-24 09:11:45,130 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))))) is different from false [2023-08-24 09:11:45,263 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:11:45,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 70 [2023-08-24 09:11:45,366 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:11:45,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76790 treesize of output 64570 [2023-08-24 09:11:45,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:11:45,609 INFO L351 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 2006 treesize of output 1822 [2023-08-24 09:11:45,652 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:11:45,653 INFO L351 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 1814 treesize of output 1438 [2023-08-24 09:11:45,736 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:11:45,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1430 treesize of output 1262 [2023-08-24 09:11:59,831 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:01,736 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,094 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,229 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,246 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,256 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:02,301 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:02,308 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:02,474 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,481 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:02,487 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,513 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:02,525 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:02,564 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:02,580 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:02,593 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:02,603 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:02,811 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:02,836 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:02,841 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:02,877 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:02,884 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:03,014 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:03,163 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:03,270 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:03,348 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:03,379 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:03,384 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:03,683 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:03,688 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:03,717 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:03,722 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:03,851 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:03,900 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:03,928 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:04,171 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:04,181 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:04,254 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:04,261 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:04,273 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:04,393 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:04,449 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 09:12:04,456 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:05,248 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 09:12:06,858 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-24 09:12:06,874 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:06,988 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:06,994 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,093 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:07,115 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:07,217 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,236 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:07,255 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,262 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,279 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,340 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,471 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,478 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,510 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:07,514 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,536 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:07,558 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:07,586 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,593 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,634 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,676 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:07,683 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:07,710 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:07,839 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:07,862 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:07,875 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:07,930 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:08,065 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:08,125 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:08,150 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:08,187 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:08,193 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:08,207 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:08,226 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:08,271 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:08,312 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:08,344 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:08,602 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:08,761 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:08,781 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:08,845 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:08,938 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:08,957 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:08,986 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:09,427 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:09,462 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:09,531 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:09,542 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:09,558 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:09,565 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:09,617 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:09,632 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:09,641 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:11,003 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:11,009 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:11,597 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:11,604 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:11,617 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:11,670 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:11,869 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:11,926 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:11,932 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:12,101 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:12,109 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:12,163 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:12,171 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:12,258 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:12,271 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:12,357 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:12,382 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:12,389 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:12,468 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:12,548 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:13,031 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:13,061 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:13,085 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:13,245 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:13,310 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:13,344 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:13,431 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:13,481 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:13,618 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:13,898 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:13,916 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:14,068 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:14,134 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:14,280 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:14,458 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:14,527 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:14,651 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:14,769 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:15,062 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:15,189 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:15,441 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:15,447 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:15,513 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:15,519 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:15,653 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:15,660 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:15,962 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:16,099 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:16,139 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:16,192 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:16,223 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:16,379 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:16,407 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:16,472 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:16,536 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:16,543 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:16,683 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:16,689 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:16,936 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:16,943 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:16,984 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:16,999 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:17,090 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:17,124 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:17,246 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:17,306 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:17,397 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:17,560 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:17,725 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:17,732 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:17,888 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:18,192 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:18,291 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:18,297 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:18,591 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:18,712 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:18,815 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-24 09:12:18,842 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:19,539 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 09:12:19,557 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:20,242 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 09:12:20,450 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:20,456 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:20,669 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:20,800 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:20,826 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:20,834 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:20,872 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:20,882 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:20,913 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:20,927 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:21,100 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:21,257 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:21,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:21,449 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:22,307 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:22,332 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:26,763 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:27,170 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:27,180 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:27,220 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:27,266 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:28,077 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:28,167 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:28,178 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:28,200 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:28,214 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:28,237 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:28,399 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:28,409 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:28,472 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:28,483 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:28,595 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:28,818 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:28,872 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:28,897 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:29,356 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:29,365 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:29,373 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:29,485 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:29,507 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:29,763 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:29,926 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,089 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,180 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:30,191 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,201 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:30,210 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,245 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:30,258 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,311 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,337 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:30,349 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:30,355 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:30,493 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,599 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:30,605 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:30,640 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:30,647 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:30,675 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:30,682 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:31,018 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:31,106 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:31,122 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:31,170 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:31,194 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:31,234 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:31,362 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:31,412 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:31,433 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:31,834 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:31,974 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:31,985 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:32,045 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:32,172 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:32,238 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:32,329 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:32,609 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:32,733 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:32,880 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:33,120 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:33,394 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:33,412 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:33,419 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:33,604 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:34,284 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 09:12:34,336 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-24 09:12:34,345 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 09:12:36,033 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:36,342 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 09:12:36,359 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:36,366 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:36,508 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:36,520 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:36,558 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:36,689 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:36,823 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:36,954 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:37,086 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:37,419 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:37,629 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:37,698 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:37,720 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:37,772 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:37,789 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:37,802 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:37,836 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:37,871 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:38,008 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:38,021 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:38,119 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 09:12:38,128 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:38,441 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:38,611 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:38,637 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:38,645 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:38,685 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:38,694 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:38,736 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:38,756 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:38,998 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,197 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,388 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,395 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:39,476 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:39,483 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:39,508 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,619 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,681 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,699 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:39,709 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:39,723 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:39,777 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,785 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:39,791 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,877 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:39,902 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:39,911 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:39,967 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:39,982 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:40,001 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,118 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:40,144 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,173 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:40,203 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:40,237 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:40,270 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,367 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:40,372 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,403 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:40,430 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:40,466 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:40,474 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:40,538 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,673 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,688 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:40,695 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,735 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:40,786 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 09:12:40,806 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:40,828 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:40,844 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,867 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 09:12:40,887 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:12:40,893 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:41,116 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:12:41,125 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:12:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 09:12:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135918765] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:12:56,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:12:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2023-08-24 09:12:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024229418] [2023-08-24 09:12:56,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:12:56,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 09:12:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:12:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 09:12:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=930, Unknown=17, NotChecked=192, Total=1260 [2023-08-24 09:12:56,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 362 [2023-08-24 09:12:56,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 208 flow. Second operand has 36 states, 36 states have (on average 87.66666666666667) internal successors, (3156), 36 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:12:56,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:12:56,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 362 [2023-08-24 09:12:56,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:12:59,678 INFO L124 PetriNetUnfolderBase]: 2447/3530 cut-off events. [2023-08-24 09:12:59,679 INFO L125 PetriNetUnfolderBase]: For 5081/5137 co-relation queries the response was YES. [2023-08-24 09:12:59,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12377 conditions, 3530 events. 2447/3530 cut-off events. For 5081/5137 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16438 event pairs, 161 based on Foata normal form. 30/3296 useless extension candidates. Maximal degree in co-relation 10049. Up to 1333 conditions per place. [2023-08-24 09:12:59,705 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 217 selfloop transitions, 97 changer transitions 2/318 dead transitions. [2023-08-24 09:12:59,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 318 transitions, 2133 flow [2023-08-24 09:12:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 09:12:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-24 09:12:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2480 transitions. [2023-08-24 09:12:59,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2634934126646834 [2023-08-24 09:12:59,714 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2480 transitions. [2023-08-24 09:12:59,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2480 transitions. [2023-08-24 09:12:59,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:12:59,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2480 transitions. [2023-08-24 09:12:59,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 95.38461538461539) internal successors, (2480), 26 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:12:59,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 362.0) internal successors, (9774), 27 states have internal predecessors, (9774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:12:59,731 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 362.0) internal successors, (9774), 27 states have internal predecessors, (9774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:12:59,732 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 208 flow. Second operand 26 states and 2480 transitions. [2023-08-24 09:12:59,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 318 transitions, 2133 flow [2023-08-24 09:12:59,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 318 transitions, 2035 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-24 09:12:59,762 INFO L231 Difference]: Finished difference. Result has 77 places, 140 transitions, 1102 flow [2023-08-24 09:12:59,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1102, PETRI_PLACES=77, PETRI_TRANSITIONS=140} [2023-08-24 09:12:59,764 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2023-08-24 09:12:59,764 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 140 transitions, 1102 flow [2023-08-24 09:12:59,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 87.66666666666667) internal successors, (3156), 36 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:12:59,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:12:59,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:12:59,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 09:12:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:12:59,976 INFO L420 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-08-24 09:12:59,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:12:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2000448063, now seen corresponding path program 2 times [2023-08-24 09:12:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:12:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725660608] [2023-08-24 09:12:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:12:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:13:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725660608] [2023-08-24 09:13:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725660608] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587459541] [2023-08-24 09:13:00,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:13:00,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:00,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:00,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 09:13:01,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:13:01,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:01,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-24 09:13:01,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:01,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:13:01,378 INFO L322 Elim1Store]: treesize reduction 45, result has 31.8 percent of original size [2023-08-24 09:13:01,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 31 [2023-08-24 09:13:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:01,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:01,517 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:13:01,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-24 09:13:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587459541] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:01,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2023-08-24 09:13:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447309670] [2023-08-24 09:13:01,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:01,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 09:13:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 09:13:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2023-08-24 09:13:01,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 362 [2023-08-24 09:13:01,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 140 transitions, 1102 flow. Second operand has 27 states, 27 states have (on average 98.48148148148148) internal successors, (2659), 27 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:01,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:01,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 362 [2023-08-24 09:13:01,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:04,766 INFO L124 PetriNetUnfolderBase]: 3929/5670 cut-off events. [2023-08-24 09:13:04,767 INFO L125 PetriNetUnfolderBase]: For 14053/14053 co-relation queries the response was YES. [2023-08-24 09:13:04,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23535 conditions, 5670 events. 3929/5670 cut-off events. For 14053/14053 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 27330 event pairs, 447 based on Foata normal form. 1/5670 useless extension candidates. Maximal degree in co-relation 21347. Up to 2769 conditions per place. [2023-08-24 09:13:04,801 INFO L140 encePairwiseOnDemand]: 346/362 looper letters, 227 selfloop transitions, 289 changer transitions 1/517 dead transitions. [2023-08-24 09:13:04,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 517 transitions, 4517 flow [2023-08-24 09:13:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-24 09:13:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-24 09:13:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4339 transitions. [2023-08-24 09:13:04,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2853854248881873 [2023-08-24 09:13:04,816 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4339 transitions. [2023-08-24 09:13:04,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4339 transitions. [2023-08-24 09:13:04,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:04,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4339 transitions. [2023-08-24 09:13:04,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 103.30952380952381) internal successors, (4339), 42 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:04,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 362.0) internal successors, (15566), 43 states have internal predecessors, (15566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:04,846 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 362.0) internal successors, (15566), 43 states have internal predecessors, (15566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:04,846 INFO L175 Difference]: Start difference. First operand has 77 places, 140 transitions, 1102 flow. Second operand 42 states and 4339 transitions. [2023-08-24 09:13:04,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 517 transitions, 4517 flow [2023-08-24 09:13:04,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 517 transitions, 4449 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-24 09:13:04,926 INFO L231 Difference]: Finished difference. Result has 137 places, 371 transitions, 3937 flow [2023-08-24 09:13:04,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3937, PETRI_PLACES=137, PETRI_TRANSITIONS=371} [2023-08-24 09:13:04,928 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2023-08-24 09:13:04,929 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 371 transitions, 3937 flow [2023-08-24 09:13:04,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 98.48148148148148) internal successors, (2659), 27 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:04,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:04,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:04,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:05,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:05,136 INFO L420 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-08-24 09:13:05,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1652253555, now seen corresponding path program 3 times [2023-08-24 09:13:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224364823] [2023-08-24 09:13:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:13:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224364823] [2023-08-24 09:13:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224364823] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662509613] [2023-08-24 09:13:06,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:13:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:06,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:06,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 09:13:06,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 09:13:06,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:06,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 09:13:06,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:06,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:13:07,004 INFO L322 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-24 09:13:07,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2023-08-24 09:13:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:07,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:07,089 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:13:07,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-24 09:13:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662509613] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:07,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:07,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 28 [2023-08-24 09:13:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302264897] [2023-08-24 09:13:07,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 09:13:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 09:13:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2023-08-24 09:13:07,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 362 [2023-08-24 09:13:07,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 371 transitions, 3937 flow. Second operand has 30 states, 30 states have (on average 85.13333333333334) internal successors, (2554), 30 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:07,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:07,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 362 [2023-08-24 09:13:07,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:10,379 INFO L124 PetriNetUnfolderBase]: 4993/7272 cut-off events. [2023-08-24 09:13:10,379 INFO L125 PetriNetUnfolderBase]: For 49686/49686 co-relation queries the response was YES. [2023-08-24 09:13:10,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40628 conditions, 7272 events. 4993/7272 cut-off events. For 49686/49686 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 37436 event pairs, 645 based on Foata normal form. 2/7274 useless extension candidates. Maximal degree in co-relation 38320. Up to 4351 conditions per place. [2023-08-24 09:13:10,440 INFO L140 encePairwiseOnDemand]: 346/362 looper letters, 403 selfloop transitions, 505 changer transitions 2/910 dead transitions. [2023-08-24 09:13:10,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 910 transitions, 11035 flow [2023-08-24 09:13:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-24 09:13:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-24 09:13:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3539 transitions. [2023-08-24 09:13:10,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25067289984417057 [2023-08-24 09:13:10,448 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3539 transitions. [2023-08-24 09:13:10,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3539 transitions. [2023-08-24 09:13:10,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:10,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3539 transitions. [2023-08-24 09:13:10,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 90.74358974358974) internal successors, (3539), 39 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:10,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 362.0) internal successors, (14480), 40 states have internal predecessors, (14480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:10,472 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 362.0) internal successors, (14480), 40 states have internal predecessors, (14480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:10,472 INFO L175 Difference]: Start difference. First operand has 137 places, 371 transitions, 3937 flow. Second operand 39 states and 3539 transitions. [2023-08-24 09:13:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 910 transitions, 11035 flow [2023-08-24 09:13:10,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 910 transitions, 10230 flow, removed 397 selfloop flow, removed 3 redundant places. [2023-08-24 09:13:10,742 INFO L231 Difference]: Finished difference. Result has 193 places, 686 transitions, 8971 flow [2023-08-24 09:13:10,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=3662, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=8971, PETRI_PLACES=193, PETRI_TRANSITIONS=686} [2023-08-24 09:13:10,743 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 160 predicate places. [2023-08-24 09:13:10,743 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 686 transitions, 8971 flow [2023-08-24 09:13:10,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 85.13333333333334) internal successors, (2554), 30 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:10,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:10,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:10,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:10,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:10,953 INFO L420 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-08-24 09:13:10,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1109560275, now seen corresponding path program 4 times [2023-08-24 09:13:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663901673] [2023-08-24 09:13:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:13:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663901673] [2023-08-24 09:13:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663901673] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079782950] [2023-08-24 09:13:12,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:13:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:12,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:12,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 09:13:12,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:13:12,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:12,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-24 09:13:12,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:12,567 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:13:12,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-08-24 09:13:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:12,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:12,667 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:13:12,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-24 09:13:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079782950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:12,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:12,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 28 [2023-08-24 09:13:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095132364] [2023-08-24 09:13:12,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 09:13:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 09:13:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2023-08-24 09:13:12,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 362 [2023-08-24 09:13:12,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 686 transitions, 8971 flow. Second operand has 30 states, 30 states have (on average 85.1) internal successors, (2553), 30 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:12,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:12,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 362 [2023-08-24 09:13:12,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:17,312 INFO L124 PetriNetUnfolderBase]: 6148/8915 cut-off events. [2023-08-24 09:13:17,312 INFO L125 PetriNetUnfolderBase]: For 87133/87133 co-relation queries the response was YES. [2023-08-24 09:13:17,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58772 conditions, 8915 events. 6148/8915 cut-off events. For 87133/87133 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 47221 event pairs, 998 based on Foata normal form. 2/8917 useless extension candidates. Maximal degree in co-relation 58211. Up to 5796 conditions per place. [2023-08-24 09:13:17,392 INFO L140 encePairwiseOnDemand]: 347/362 looper letters, 425 selfloop transitions, 652 changer transitions 1/1078 dead transitions. [2023-08-24 09:13:17,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1078 transitions, 15498 flow [2023-08-24 09:13:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-24 09:13:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-24 09:13:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4578 transitions. [2023-08-24 09:13:17,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2479688007799805 [2023-08-24 09:13:17,401 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 4578 transitions. [2023-08-24 09:13:17,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 4578 transitions. [2023-08-24 09:13:17,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:17,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 4578 transitions. [2023-08-24 09:13:17,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 89.76470588235294) internal successors, (4578), 51 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:17,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 362.0) internal successors, (18824), 52 states have internal predecessors, (18824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:17,430 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 362.0) internal successors, (18824), 52 states have internal predecessors, (18824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:17,430 INFO L175 Difference]: Start difference. First operand has 193 places, 686 transitions, 8971 flow. Second operand 51 states and 4578 transitions. [2023-08-24 09:13:17,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1078 transitions, 15498 flow [2023-08-24 09:13:18,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 1078 transitions, 14741 flow, removed 106 selfloop flow, removed 7 redundant places. [2023-08-24 09:13:18,031 INFO L231 Difference]: Finished difference. Result has 246 places, 931 transitions, 13137 flow [2023-08-24 09:13:18,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=8421, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=13137, PETRI_PLACES=246, PETRI_TRANSITIONS=931} [2023-08-24 09:13:18,032 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 213 predicate places. [2023-08-24 09:13:18,032 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 931 transitions, 13137 flow [2023-08-24 09:13:18,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 85.1) internal successors, (2553), 30 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:18,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:18,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:18,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:18,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:18,239 INFO L420 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-08-24 09:13:18,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 929901233, now seen corresponding path program 5 times [2023-08-24 09:13:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77076691] [2023-08-24 09:13:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:13:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77076691] [2023-08-24 09:13:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77076691] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756894165] [2023-08-24 09:13:19,117 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:13:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:19,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:19,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 09:13:19,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:13:19,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:19,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 09:13:19,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:19,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:13:19,687 INFO L322 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-24 09:13:19,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2023-08-24 09:13:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:13:19,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:19,818 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:13:19,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-24 09:13:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:13:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756894165] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:20,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2023-08-24 09:13:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540367139] [2023-08-24 09:13:20,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:20,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 09:13:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 09:13:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2023-08-24 09:13:20,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 362 [2023-08-24 09:13:20,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 931 transitions, 13137 flow. Second operand has 30 states, 30 states have (on average 98.13333333333334) internal successors, (2944), 30 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:20,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:20,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 362 [2023-08-24 09:13:20,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:26,123 INFO L124 PetriNetUnfolderBase]: 9870/14327 cut-off events. [2023-08-24 09:13:26,123 INFO L125 PetriNetUnfolderBase]: For 138534/138534 co-relation queries the response was YES. [2023-08-24 09:13:26,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101003 conditions, 14327 events. 9870/14327 cut-off events. For 138534/138534 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 80994 event pairs, 1146 based on Foata normal form. 46/14373 useless extension candidates. Maximal degree in co-relation 100419. Up to 7562 conditions per place. [2023-08-24 09:13:26,270 INFO L140 encePairwiseOnDemand]: 346/362 looper letters, 812 selfloop transitions, 865 changer transitions 3/1680 dead transitions. [2023-08-24 09:13:26,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1680 transitions, 25811 flow [2023-08-24 09:13:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-08-24 09:13:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-08-24 09:13:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 5569 transitions. [2023-08-24 09:13:26,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2902637339726884 [2023-08-24 09:13:26,281 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 5569 transitions. [2023-08-24 09:13:26,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 5569 transitions. [2023-08-24 09:13:26,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:26,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 5569 transitions. [2023-08-24 09:13:26,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 105.0754716981132) internal successors, (5569), 53 states have internal predecessors, (5569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:26,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 362.0) internal successors, (19548), 54 states have internal predecessors, (19548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:26,307 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 362.0) internal successors, (19548), 54 states have internal predecessors, (19548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:26,307 INFO L175 Difference]: Start difference. First operand has 246 places, 931 transitions, 13137 flow. Second operand 53 states and 5569 transitions. [2023-08-24 09:13:26,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1680 transitions, 25811 flow [2023-08-24 09:13:27,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 1680 transitions, 25355 flow, removed 189 selfloop flow, removed 9 redundant places. [2023-08-24 09:13:27,377 INFO L231 Difference]: Finished difference. Result has 293 places, 1335 transitions, 21348 flow [2023-08-24 09:13:27,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=11212, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=21348, PETRI_PLACES=293, PETRI_TRANSITIONS=1335} [2023-08-24 09:13:27,378 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 260 predicate places. [2023-08-24 09:13:27,378 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 1335 transitions, 21348 flow [2023-08-24 09:13:27,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.13333333333334) internal successors, (2944), 30 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:27,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:27,379 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:27,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 09:13:27,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-24 09:13:27,585 INFO L420 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-08-24 09:13:27,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 717577615, now seen corresponding path program 6 times [2023-08-24 09:13:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901316918] [2023-08-24 09:13:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901316918] [2023-08-24 09:13:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901316918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550812281] [2023-08-24 09:13:27,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:13:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:27,729 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:27,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 09:13:27,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 09:13:27,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:27,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:13:27,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:27,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:27,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550812281] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:27,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:27,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 09:13:27,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775992063] [2023-08-24 09:13:27,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:27,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 09:13:27,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:27,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 09:13:27,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:13:27,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 362 [2023-08-24 09:13:27,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1335 transitions, 21348 flow. Second operand has 15 states, 15 states have (on average 136.33333333333334) internal successors, (2045), 15 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:27,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:27,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 362 [2023-08-24 09:13:27,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:33,199 INFO L124 PetriNetUnfolderBase]: 13840/20443 cut-off events. [2023-08-24 09:13:33,199 INFO L125 PetriNetUnfolderBase]: For 239728/240506 co-relation queries the response was YES. [2023-08-24 09:13:33,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157170 conditions, 20443 events. 13840/20443 cut-off events. For 239728/240506 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 129559 event pairs, 4342 based on Foata normal form. 260/20388 useless extension candidates. Maximal degree in co-relation 156928. Up to 10280 conditions per place. [2023-08-24 09:13:33,414 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 1731 selfloop transitions, 14 changer transitions 0/1805 dead transitions. [2023-08-24 09:13:33,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1805 transitions, 32518 flow [2023-08-24 09:13:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:13:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:13:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1126 transitions. [2023-08-24 09:13:33,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888121546961326 [2023-08-24 09:13:33,416 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1126 transitions. [2023-08-24 09:13:33,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1126 transitions. [2023-08-24 09:13:33,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:33,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1126 transitions. [2023-08-24 09:13:33,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:33,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:33,420 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:33,420 INFO L175 Difference]: Start difference. First operand has 293 places, 1335 transitions, 21348 flow. Second operand 8 states and 1126 transitions. [2023-08-24 09:13:33,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1805 transitions, 32518 flow [2023-08-24 09:13:35,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1805 transitions, 31415 flow, removed 316 selfloop flow, removed 26 redundant places. [2023-08-24 09:13:35,588 INFO L231 Difference]: Finished difference. Result has 257 places, 989 transitions, 15146 flow [2023-08-24 09:13:35,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=15118, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15146, PETRI_PLACES=257, PETRI_TRANSITIONS=989} [2023-08-24 09:13:35,589 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 224 predicate places. [2023-08-24 09:13:35,589 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 989 transitions, 15146 flow [2023-08-24 09:13:35,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 136.33333333333334) internal successors, (2045), 15 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:35,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:35,590 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:35,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:35,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-24 09:13:35,796 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:13:35,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 455895023, now seen corresponding path program 7 times [2023-08-24 09:13:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357553157] [2023-08-24 09:13:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357553157] [2023-08-24 09:13:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357553157] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695816076] [2023-08-24 09:13:35,919 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:13:35,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:35,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:35,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 09:13:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:36,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:13:36,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:36,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695816076] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:36,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-24 09:13:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516592047] [2023-08-24 09:13:36,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:36,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 09:13:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 09:13:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-24 09:13:36,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2023-08-24 09:13:36,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 989 transitions, 15146 flow. Second operand has 14 states, 14 states have (on average 132.64285714285714) internal successors, (1857), 14 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:36,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:36,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2023-08-24 09:13:36,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:40,781 INFO L124 PetriNetUnfolderBase]: 13125/19998 cut-off events. [2023-08-24 09:13:40,781 INFO L125 PetriNetUnfolderBase]: For 257170/257678 co-relation queries the response was YES. [2023-08-24 09:13:40,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148581 conditions, 19998 events. 13125/19998 cut-off events. For 257170/257678 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 136283 event pairs, 1984 based on Foata normal form. 1550/21380 useless extension candidates. Maximal degree in co-relation 147158. Up to 11170 conditions per place. [2023-08-24 09:13:40,986 INFO L140 encePairwiseOnDemand]: 354/362 looper letters, 1066 selfloop transitions, 161 changer transitions 1/1256 dead transitions. [2023-08-24 09:13:40,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1256 transitions, 21962 flow [2023-08-24 09:13:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 09:13:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 09:13:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1248 transitions. [2023-08-24 09:13:40,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3830570902394107 [2023-08-24 09:13:40,989 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1248 transitions. [2023-08-24 09:13:40,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1248 transitions. [2023-08-24 09:13:40,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:40,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1248 transitions. [2023-08-24 09:13:40,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.66666666666666) internal successors, (1248), 9 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:40,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:40,994 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:40,994 INFO L175 Difference]: Start difference. First operand has 257 places, 989 transitions, 15146 flow. Second operand 9 states and 1248 transitions. [2023-08-24 09:13:40,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1256 transitions, 21962 flow [2023-08-24 09:13:42,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1256 transitions, 21938 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 09:13:42,448 INFO L231 Difference]: Finished difference. Result has 262 places, 889 transitions, 14247 flow [2023-08-24 09:13:42,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=13405, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14247, PETRI_PLACES=262, PETRI_TRANSITIONS=889} [2023-08-24 09:13:42,449 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 229 predicate places. [2023-08-24 09:13:42,449 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 889 transitions, 14247 flow [2023-08-24 09:13:42,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 132.64285714285714) internal successors, (1857), 14 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:42,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:42,449 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:42,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:42,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 09:13:42,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:13:42,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash -226947251, now seen corresponding path program 8 times [2023-08-24 09:13:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51603882] [2023-08-24 09:13:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:42,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:13:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51603882] [2023-08-24 09:13:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51603882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460758211] [2023-08-24 09:13:42,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:13:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:42,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:42,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:42,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 09:13:42,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:13:42,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:42,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:13:42,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:13:43,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:13:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460758211] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:43,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2023-08-24 09:13:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528540757] [2023-08-24 09:13:43,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:43,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 09:13:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 09:13:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-08-24 09:13:43,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 362 [2023-08-24 09:13:43,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 889 transitions, 14247 flow. Second operand has 20 states, 20 states have (on average 120.9) internal successors, (2418), 20 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:43,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:43,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 362 [2023-08-24 09:13:43,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:47,679 INFO L124 PetriNetUnfolderBase]: 11289/16987 cut-off events. [2023-08-24 09:13:47,679 INFO L125 PetriNetUnfolderBase]: For 202367/202367 co-relation queries the response was YES. [2023-08-24 09:13:47,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133074 conditions, 16987 events. 11289/16987 cut-off events. For 202367/202367 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 107905 event pairs, 1253 based on Foata normal form. 972/17959 useless extension candidates. Maximal degree in co-relation 132316. Up to 5901 conditions per place. [2023-08-24 09:13:47,821 INFO L140 encePairwiseOnDemand]: 345/362 looper letters, 558 selfloop transitions, 946 changer transitions 739/2243 dead transitions. [2023-08-24 09:13:47,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 2243 transitions, 39796 flow [2023-08-24 09:13:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-24 09:13:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-24 09:13:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5795 transitions. [2023-08-24 09:13:47,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34800624549603654 [2023-08-24 09:13:47,829 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 5795 transitions. [2023-08-24 09:13:47,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 5795 transitions. [2023-08-24 09:13:47,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:47,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5795 transitions. [2023-08-24 09:13:47,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 125.97826086956522) internal successors, (5795), 46 states have internal predecessors, (5795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:47,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 362.0) internal successors, (17014), 47 states have internal predecessors, (17014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:47,856 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 362.0) internal successors, (17014), 47 states have internal predecessors, (17014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:47,856 INFO L175 Difference]: Start difference. First operand has 262 places, 889 transitions, 14247 flow. Second operand 46 states and 5795 transitions. [2023-08-24 09:13:47,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 2243 transitions, 39796 flow [2023-08-24 09:13:49,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 2243 transitions, 39748 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-24 09:13:49,578 INFO L231 Difference]: Finished difference. Result has 337 places, 1277 transitions, 24515 flow [2023-08-24 09:13:49,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=14217, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=588, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=24515, PETRI_PLACES=337, PETRI_TRANSITIONS=1277} [2023-08-24 09:13:49,580 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 304 predicate places. [2023-08-24 09:13:49,580 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 1277 transitions, 24515 flow [2023-08-24 09:13:49,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 120.9) internal successors, (2418), 20 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:49,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:49,580 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:49,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-24 09:13:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-24 09:13:49,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:13:49,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -988261552, now seen corresponding path program 9 times [2023-08-24 09:13:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809625232] [2023-08-24 09:13:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809625232] [2023-08-24 09:13:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809625232] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823563531] [2023-08-24 09:13:49,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:13:49,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:49,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:50,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 09:13:50,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 09:13:50,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:50,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 09:13:50,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:50,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823563531] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:50,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-24 09:13:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510202632] [2023-08-24 09:13:50,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:50,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 09:13:50,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:50,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 09:13:50,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-08-24 09:13:50,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 362 [2023-08-24 09:13:50,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1277 transitions, 24515 flow. Second operand has 17 states, 17 states have (on average 129.52941176470588) internal successors, (2202), 17 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:50,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:50,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 362 [2023-08-24 09:13:50,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:52,494 INFO L124 PetriNetUnfolderBase]: 4859/7542 cut-off events. [2023-08-24 09:13:52,495 INFO L125 PetriNetUnfolderBase]: For 199097/199291 co-relation queries the response was YES. [2023-08-24 09:13:52,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71125 conditions, 7542 events. 4859/7542 cut-off events. For 199097/199291 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 45236 event pairs, 1064 based on Foata normal form. 500/7973 useless extension candidates. Maximal degree in co-relation 71016. Up to 3178 conditions per place. [2023-08-24 09:13:52,572 INFO L140 encePairwiseOnDemand]: 353/362 looper letters, 746 selfloop transitions, 90 changer transitions 47/952 dead transitions. [2023-08-24 09:13:52,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 952 transitions, 19311 flow [2023-08-24 09:13:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 09:13:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 09:13:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1209 transitions. [2023-08-24 09:13:52,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3710865561694291 [2023-08-24 09:13:52,574 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1209 transitions. [2023-08-24 09:13:52,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1209 transitions. [2023-08-24 09:13:52,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:52,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1209 transitions. [2023-08-24 09:13:52,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:52,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:52,578 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:52,578 INFO L175 Difference]: Start difference. First operand has 337 places, 1277 transitions, 24515 flow. Second operand 9 states and 1209 transitions. [2023-08-24 09:13:52,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 952 transitions, 19311 flow [2023-08-24 09:13:53,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 952 transitions, 17121 flow, removed 639 selfloop flow, removed 24 redundant places. [2023-08-24 09:13:53,800 INFO L231 Difference]: Finished difference. Result has 295 places, 840 transitions, 14143 flow [2023-08-24 09:13:53,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=14496, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14143, PETRI_PLACES=295, PETRI_TRANSITIONS=840} [2023-08-24 09:13:53,802 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 262 predicate places. [2023-08-24 09:13:53,803 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 840 transitions, 14143 flow [2023-08-24 09:13:53,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 129.52941176470588) internal successors, (2202), 17 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:53,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:53,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:53,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-24 09:13:54,009 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:13:54,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1389074324, now seen corresponding path program 1 times [2023-08-24 09:13:54,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:54,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421248079] [2023-08-24 09:13:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421248079] [2023-08-24 09:13:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421248079] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012892634] [2023-08-24 09:13:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:54,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:54,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:54,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 09:13:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:54,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-24 09:13:54,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:54,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:13:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012892634] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:54,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:54,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-08-24 09:13:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163654540] [2023-08-24 09:13:54,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:54,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 09:13:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:54,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 09:13:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-08-24 09:13:54,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:13:54,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 840 transitions, 14143 flow. Second operand has 16 states, 16 states have (on average 124.8125) internal successors, (1997), 16 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:54,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:54,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:13:54,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:55,625 INFO L124 PetriNetUnfolderBase]: 3035/4660 cut-off events. [2023-08-24 09:13:55,625 INFO L125 PetriNetUnfolderBase]: For 112640/112663 co-relation queries the response was YES. [2023-08-24 09:13:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42087 conditions, 4660 events. 3035/4660 cut-off events. For 112640/112663 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24522 event pairs, 844 based on Foata normal form. 181/4839 useless extension candidates. Maximal degree in co-relation 41995. Up to 3252 conditions per place. [2023-08-24 09:13:55,685 INFO L140 encePairwiseOnDemand]: 352/362 looper letters, 488 selfloop transitions, 6 changer transitions 152/680 dead transitions. [2023-08-24 09:13:55,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 680 transitions, 12244 flow [2023-08-24 09:13:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:13:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:13:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1300 transitions. [2023-08-24 09:13:55,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35911602209944754 [2023-08-24 09:13:55,687 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1300 transitions. [2023-08-24 09:13:55,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1300 transitions. [2023-08-24 09:13:55,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:55,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1300 transitions. [2023-08-24 09:13:55,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 130.0) internal successors, (1300), 10 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:55,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 362.0) internal successors, (3982), 11 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:55,691 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 362.0) internal successors, (3982), 11 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:55,691 INFO L175 Difference]: Start difference. First operand has 295 places, 840 transitions, 14143 flow. Second operand 10 states and 1300 transitions. [2023-08-24 09:13:55,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 680 transitions, 12244 flow [2023-08-24 09:13:56,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 680 transitions, 11259 flow, removed 196 selfloop flow, removed 22 redundant places. [2023-08-24 09:13:56,166 INFO L231 Difference]: Finished difference. Result has 259 places, 528 transitions, 8124 flow [2023-08-24 09:13:56,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=9486, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8124, PETRI_PLACES=259, PETRI_TRANSITIONS=528} [2023-08-24 09:13:56,167 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 226 predicate places. [2023-08-24 09:13:56,167 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 528 transitions, 8124 flow [2023-08-24 09:13:56,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 124.8125) internal successors, (1997), 16 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:56,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:56,168 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:56,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:56,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 09:13:56,372 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:13:56,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 469753245, now seen corresponding path program 10 times [2023-08-24 09:13:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684580056] [2023-08-24 09:13:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:13:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684580056] [2023-08-24 09:13:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684580056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266698205] [2023-08-24 09:13:56,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:13:56,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:56,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:56,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-24 09:13:56,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:13:56,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:56,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:13:56,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:13:56,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:13:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266698205] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:56,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-24 09:13:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285837053] [2023-08-24 09:13:56,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:56,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 09:13:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 09:13:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-24 09:13:56,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:13:56,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 528 transitions, 8124 flow. Second operand has 20 states, 20 states have (on average 124.35) internal successors, (2487), 20 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:56,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:56,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:13:56,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:13:58,353 INFO L124 PetriNetUnfolderBase]: 3478/5050 cut-off events. [2023-08-24 09:13:58,353 INFO L125 PetriNetUnfolderBase]: For 106282/106293 co-relation queries the response was YES. [2023-08-24 09:13:58,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46205 conditions, 5050 events. 3478/5050 cut-off events. For 106282/106293 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24412 event pairs, 256 based on Foata normal form. 25/5075 useless extension candidates. Maximal degree in co-relation 46122. Up to 2409 conditions per place. [2023-08-24 09:13:58,407 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 358 selfloop transitions, 500 changer transitions 0/892 dead transitions. [2023-08-24 09:13:58,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 892 transitions, 16088 flow [2023-08-24 09:13:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 09:13:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 09:13:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2461 transitions. [2023-08-24 09:13:58,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35780750218086654 [2023-08-24 09:13:58,411 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2461 transitions. [2023-08-24 09:13:58,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2461 transitions. [2023-08-24 09:13:58,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:13:58,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2461 transitions. [2023-08-24 09:13:58,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 129.52631578947367) internal successors, (2461), 19 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:58,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 362.0) internal successors, (7240), 20 states have internal predecessors, (7240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:58,420 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 362.0) internal successors, (7240), 20 states have internal predecessors, (7240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:58,420 INFO L175 Difference]: Start difference. First operand has 259 places, 528 transitions, 8124 flow. Second operand 19 states and 2461 transitions. [2023-08-24 09:13:58,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 892 transitions, 16088 flow [2023-08-24 09:13:58,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 892 transitions, 14880 flow, removed 257 selfloop flow, removed 23 redundant places. [2023-08-24 09:13:58,828 INFO L231 Difference]: Finished difference. Result has 201 places, 734 transitions, 12559 flow [2023-08-24 09:13:58,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=7432, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12559, PETRI_PLACES=201, PETRI_TRANSITIONS=734} [2023-08-24 09:13:58,829 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 168 predicate places. [2023-08-24 09:13:58,829 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 734 transitions, 12559 flow [2023-08-24 09:13:58,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 124.35) internal successors, (2487), 20 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:58,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:13:58,830 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:13:58,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-24 09:13:59,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:59,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:13:59,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:13:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1452152421, now seen corresponding path program 11 times [2023-08-24 09:13:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:13:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579818209] [2023-08-24 09:13:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:13:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:13:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:13:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:13:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:13:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579818209] [2023-08-24 09:13:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579818209] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:13:59,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693577547] [2023-08-24 09:13:59,212 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:13:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:13:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:13:59,213 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:13:59,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-24 09:13:59,351 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:13:59,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:13:59,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:13:59,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:13:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:13:59,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:13:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:13:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693577547] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:13:59,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:13:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-08-24 09:13:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592333614] [2023-08-24 09:13:59,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:13:59,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 09:13:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:13:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 09:13:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-08-24 09:13:59,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 362 [2023-08-24 09:13:59,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 734 transitions, 12559 flow. Second operand has 17 states, 17 states have (on average 120.82352941176471) internal successors, (2054), 17 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:13:59,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:13:59,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 362 [2023-08-24 09:13:59,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:14:01,467 INFO L124 PetriNetUnfolderBase]: 3680/5375 cut-off events. [2023-08-24 09:14:01,467 INFO L125 PetriNetUnfolderBase]: For 108343/108343 co-relation queries the response was YES. [2023-08-24 09:14:01,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49180 conditions, 5375 events. 3680/5375 cut-off events. For 108343/108343 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26351 event pairs, 211 based on Foata normal form. 30/5405 useless extension candidates. Maximal degree in co-relation 49107. Up to 2519 conditions per place. [2023-08-24 09:14:01,519 INFO L140 encePairwiseOnDemand]: 347/362 looper letters, 403 selfloop transitions, 693 changer transitions 0/1096 dead transitions. [2023-08-24 09:14:01,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1096 transitions, 20419 flow [2023-08-24 09:14:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 09:14:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 09:14:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3754 transitions. [2023-08-24 09:14:01,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3456721915285451 [2023-08-24 09:14:01,522 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3754 transitions. [2023-08-24 09:14:01,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3754 transitions. [2023-08-24 09:14:01,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:14:01,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3754 transitions. [2023-08-24 09:14:01,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 125.13333333333334) internal successors, (3754), 30 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:01,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 362.0) internal successors, (11222), 31 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:01,534 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 362.0) internal successors, (11222), 31 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:01,534 INFO L175 Difference]: Start difference. First operand has 201 places, 734 transitions, 12559 flow. Second operand 30 states and 3754 transitions. [2023-08-24 09:14:01,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1096 transitions, 20419 flow [2023-08-24 09:14:02,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 1096 transitions, 19423 flow, removed 236 selfloop flow, removed 11 redundant places. [2023-08-24 09:14:02,112 INFO L231 Difference]: Finished difference. Result has 226 places, 915 transitions, 16862 flow [2023-08-24 09:14:02,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=11868, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=513, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=16862, PETRI_PLACES=226, PETRI_TRANSITIONS=915} [2023-08-24 09:14:02,114 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2023-08-24 09:14:02,114 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 915 transitions, 16862 flow [2023-08-24 09:14:02,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 120.82352941176471) internal successors, (2054), 17 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:02,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:14:02,114 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:14:02,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-24 09:14:02,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 09:14:02,319 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:14:02,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:14:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash -369483559, now seen corresponding path program 12 times [2023-08-24 09:14:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:14:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455235430] [2023-08-24 09:14:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:14:02,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:14:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:14:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455235430] [2023-08-24 09:14:02,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455235430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:14:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552996380] [2023-08-24 09:14:02,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:14:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:14:02,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:14:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-24 09:14:02,650 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 09:14:02,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:14:02,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:14:02,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:14:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:02,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:14:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552996380] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:14:02,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:14:02,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-24 09:14:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291179454] [2023-08-24 09:14:02,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:14:02,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 09:14:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:14:02,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 09:14:02,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-24 09:14:02,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:14:02,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 915 transitions, 16862 flow. Second operand has 20 states, 20 states have (on average 124.25) internal successors, (2485), 20 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:02,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:14:02,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:14:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:14:04,730 INFO L124 PetriNetUnfolderBase]: 4956/7245 cut-off events. [2023-08-24 09:14:04,731 INFO L125 PetriNetUnfolderBase]: For 151620/151623 co-relation queries the response was YES. [2023-08-24 09:14:04,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68583 conditions, 7245 events. 4956/7245 cut-off events. For 151620/151623 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 36941 event pairs, 234 based on Foata normal form. 12/7254 useless extension candidates. Maximal degree in co-relation 68508. Up to 3523 conditions per place. [2023-08-24 09:14:04,817 INFO L140 encePairwiseOnDemand]: 349/362 looper letters, 571 selfloop transitions, 799 changer transitions 0/1418 dead transitions. [2023-08-24 09:14:04,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1418 transitions, 29299 flow [2023-08-24 09:14:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 09:14:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 09:14:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2199 transitions. [2023-08-24 09:14:04,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35732856678583036 [2023-08-24 09:14:04,820 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2199 transitions. [2023-08-24 09:14:04,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2199 transitions. [2023-08-24 09:14:04,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:14:04,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2199 transitions. [2023-08-24 09:14:04,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 129.35294117647058) internal successors, (2199), 17 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:04,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 362.0) internal successors, (6516), 18 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:04,826 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 362.0) internal successors, (6516), 18 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:04,826 INFO L175 Difference]: Start difference. First operand has 226 places, 915 transitions, 16862 flow. Second operand 17 states and 2199 transitions. [2023-08-24 09:14:04,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1418 transitions, 29299 flow [2023-08-24 09:14:05,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1418 transitions, 28857 flow, removed 156 selfloop flow, removed 11 redundant places. [2023-08-24 09:14:05,859 INFO L231 Difference]: Finished difference. Result has 237 places, 1198 transitions, 24909 flow [2023-08-24 09:14:05,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=16552, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=24909, PETRI_PLACES=237, PETRI_TRANSITIONS=1198} [2023-08-24 09:14:05,861 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 204 predicate places. [2023-08-24 09:14:05,861 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 1198 transitions, 24909 flow [2023-08-24 09:14:05,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 124.25) internal successors, (2485), 20 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:05,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:14:05,861 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:14:05,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-24 09:14:06,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 09:14:06,078 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:14:06,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:14:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1702220595, now seen corresponding path program 13 times [2023-08-24 09:14:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:14:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634148949] [2023-08-24 09:14:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:14:06,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:14:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:14:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634148949] [2023-08-24 09:14:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634148949] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:14:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240751509] [2023-08-24 09:14:06,251 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:14:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:14:06,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:14:06,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-24 09:14:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:06,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:14:06,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:14:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:06,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:14:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240751509] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:14:06,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:14:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-08-24 09:14:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229242806] [2023-08-24 09:14:06,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:14:06,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 09:14:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:14:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 09:14:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-08-24 09:14:06,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:14:06,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 1198 transitions, 24909 flow. Second operand has 21 states, 21 states have (on average 124.19047619047619) internal successors, (2608), 21 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:06,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:14:06,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:14:06,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:14:09,917 INFO L124 PetriNetUnfolderBase]: 7026/10163 cut-off events. [2023-08-24 09:14:09,917 INFO L125 PetriNetUnfolderBase]: For 244362/244365 co-relation queries the response was YES. [2023-08-24 09:14:09,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102914 conditions, 10163 events. 7026/10163 cut-off events. For 244362/244365 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 53866 event pairs, 252 based on Foata normal form. 14/10174 useless extension candidates. Maximal degree in co-relation 102839. Up to 5023 conditions per place. [2023-08-24 09:14:10,021 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 939 selfloop transitions, 1041 changer transitions 0/2028 dead transitions. [2023-08-24 09:14:10,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 2028 transitions, 45104 flow [2023-08-24 09:14:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 09:14:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 09:14:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4970 transitions. [2023-08-24 09:14:10,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3612968886304158 [2023-08-24 09:14:10,030 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4970 transitions. [2023-08-24 09:14:10,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4970 transitions. [2023-08-24 09:14:10,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:14:10,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4970 transitions. [2023-08-24 09:14:10,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 130.78947368421052) internal successors, (4970), 38 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:10,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 362.0) internal successors, (14118), 39 states have internal predecessors, (14118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:10,044 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 362.0) internal successors, (14118), 39 states have internal predecessors, (14118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:10,044 INFO L175 Difference]: Start difference. First operand has 237 places, 1198 transitions, 24909 flow. Second operand 38 states and 4970 transitions. [2023-08-24 09:14:10,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 2028 transitions, 45104 flow [2023-08-24 09:14:11,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 2028 transitions, 43568 flow, removed 121 selfloop flow, removed 7 redundant places. [2023-08-24 09:14:11,791 INFO L231 Difference]: Finished difference. Result has 278 places, 1550 transitions, 34903 flow [2023-08-24 09:14:11,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=23867, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=699, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=34903, PETRI_PLACES=278, PETRI_TRANSITIONS=1550} [2023-08-24 09:14:11,792 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 245 predicate places. [2023-08-24 09:14:11,792 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 1550 transitions, 34903 flow [2023-08-24 09:14:11,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 124.19047619047619) internal successors, (2608), 21 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:11,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:14:11,793 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:14:11,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-24 09:14:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 09:14:11,993 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:14:11,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:14:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1620112755, now seen corresponding path program 14 times [2023-08-24 09:14:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:14:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676953240] [2023-08-24 09:14:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:14:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:14:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:14:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676953240] [2023-08-24 09:14:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676953240] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:14:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361607918] [2023-08-24 09:14:12,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:14:12,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:14:12,153 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:14:12,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-24 09:14:12,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:14:12,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:14:12,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:14:12,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:14:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:12,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:14:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361607918] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:14:12,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:14:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-24 09:14:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611477440] [2023-08-24 09:14:12,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:14:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 09:14:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:14:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 09:14:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-08-24 09:14:12,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:14:12,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1550 transitions, 34903 flow. Second operand has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:12,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:14:12,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:14:12,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:14:17,681 INFO L124 PetriNetUnfolderBase]: 10632/15201 cut-off events. [2023-08-24 09:14:17,682 INFO L125 PetriNetUnfolderBase]: For 375601/375628 co-relation queries the response was YES. [2023-08-24 09:14:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160506 conditions, 15201 events. 10632/15201 cut-off events. For 375601/375628 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 82896 event pairs, 250 based on Foata normal form. 36/15234 useless extension candidates. Maximal degree in co-relation 160421. Up to 7571 conditions per place. [2023-08-24 09:14:17,871 INFO L140 encePairwiseOnDemand]: 349/362 looper letters, 1004 selfloop transitions, 1675 changer transitions 0/2727 dead transitions. [2023-08-24 09:14:17,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 2727 transitions, 64030 flow [2023-08-24 09:14:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-24 09:14:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-24 09:14:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5632 transitions. [2023-08-24 09:14:17,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.361814210458692 [2023-08-24 09:14:17,876 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 5632 transitions. [2023-08-24 09:14:17,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 5632 transitions. [2023-08-24 09:14:17,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:14:17,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 5632 transitions. [2023-08-24 09:14:17,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 130.97674418604652) internal successors, (5632), 43 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:17,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 362.0) internal successors, (15928), 44 states have internal predecessors, (15928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:17,892 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 362.0) internal successors, (15928), 44 states have internal predecessors, (15928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:17,892 INFO L175 Difference]: Start difference. First operand has 278 places, 1550 transitions, 34903 flow. Second operand 43 states and 5632 transitions. [2023-08-24 09:14:17,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 2727 transitions, 64030 flow [2023-08-24 09:14:21,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2727 transitions, 59417 flow, removed 474 selfloop flow, removed 13 redundant places. [2023-08-24 09:14:21,743 INFO L231 Difference]: Finished difference. Result has 311 places, 2084 transitions, 47757 flow [2023-08-24 09:14:21,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=31872, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=47757, PETRI_PLACES=311, PETRI_TRANSITIONS=2084} [2023-08-24 09:14:21,744 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 278 predicate places. [2023-08-24 09:14:21,744 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 2084 transitions, 47757 flow [2023-08-24 09:14:21,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:21,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:14:21,745 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:14:21,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-24 09:14:21,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:21,945 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:14:21,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:14:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash 515814499, now seen corresponding path program 15 times [2023-08-24 09:14:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:14:21,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278329001] [2023-08-24 09:14:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:14:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:14:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:14:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278329001] [2023-08-24 09:14:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278329001] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:14:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754951304] [2023-08-24 09:14:22,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:14:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:14:22,115 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:14:22,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 09:14:22,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:14:22,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:14:22,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:14:22,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:14:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:22,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:14:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754951304] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:14:22,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:14:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-08-24 09:14:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513427931] [2023-08-24 09:14:22,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:14:22,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 09:14:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:14:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 09:14:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-08-24 09:14:22,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:14:22,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 2084 transitions, 47757 flow. Second operand has 21 states, 21 states have (on average 124.38095238095238) internal successors, (2612), 21 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:22,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:14:22,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:14:22,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:14:29,097 INFO L124 PetriNetUnfolderBase]: 11023/15757 cut-off events. [2023-08-24 09:14:29,097 INFO L125 PetriNetUnfolderBase]: For 371022/371052 co-relation queries the response was YES. [2023-08-24 09:14:29,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160822 conditions, 15757 events. 11023/15757 cut-off events. For 371022/371052 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 86543 event pairs, 611 based on Foata normal form. 36/15792 useless extension candidates. Maximal degree in co-relation 160735. Up to 7874 conditions per place. [2023-08-24 09:14:29,250 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 539 selfloop transitions, 1840 changer transitions 0/2427 dead transitions. [2023-08-24 09:14:29,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 2427 transitions, 58548 flow [2023-08-24 09:14:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-24 09:14:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-24 09:14:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3642 transitions. [2023-08-24 09:14:29,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35931333859510656 [2023-08-24 09:14:29,253 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3642 transitions. [2023-08-24 09:14:29,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3642 transitions. [2023-08-24 09:14:29,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:14:29,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3642 transitions. [2023-08-24 09:14:29,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 130.07142857142858) internal successors, (3642), 28 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:29,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 362.0) internal successors, (10498), 29 states have internal predecessors, (10498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:29,262 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 362.0) internal successors, (10498), 29 states have internal predecessors, (10498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:29,263 INFO L175 Difference]: Start difference. First operand has 311 places, 2084 transitions, 47757 flow. Second operand 28 states and 3642 transitions. [2023-08-24 09:14:29,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 2427 transitions, 58548 flow [2023-08-24 09:14:32,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 2427 transitions, 55804 flow, removed 119 selfloop flow, removed 14 redundant places. [2023-08-24 09:14:32,393 INFO L231 Difference]: Finished difference. Result has 329 places, 2177 transitions, 51605 flow [2023-08-24 09:14:32,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=45157, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=51605, PETRI_PLACES=329, PETRI_TRANSITIONS=2177} [2023-08-24 09:14:32,394 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 296 predicate places. [2023-08-24 09:14:32,394 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 2177 transitions, 51605 flow [2023-08-24 09:14:32,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 124.38095238095238) internal successors, (2612), 21 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:32,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:14:32,395 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:14:32,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 09:14:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:32,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:14:32,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:14:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -855207849, now seen corresponding path program 16 times [2023-08-24 09:14:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:14:32,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860341424] [2023-08-24 09:14:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:14:32,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:14:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:14:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860341424] [2023-08-24 09:14:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860341424] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:14:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616879930] [2023-08-24 09:14:32,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:14:32,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:32,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:14:32,761 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:14:32,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 09:14:32,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:14:32,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:14:32,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:14:32,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:14:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:33,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:14:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:14:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616879930] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:14:33,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:14:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-24 09:14:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63066100] [2023-08-24 09:14:33,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:14:33,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 09:14:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:14:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 09:14:33,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-08-24 09:14:33,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 09:14:33,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 2177 transitions, 51605 flow. Second operand has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:33,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:14:33,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 09:14:33,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:14:39,583 INFO L124 PetriNetUnfolderBase]: 11556/16516 cut-off events. [2023-08-24 09:14:39,583 INFO L125 PetriNetUnfolderBase]: For 404494/404516 co-relation queries the response was YES. [2023-08-24 09:14:39,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171983 conditions, 16516 events. 11556/16516 cut-off events. For 404494/404516 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 91428 event pairs, 861 based on Foata normal form. 26/16542 useless extension candidates. Maximal degree in co-relation 171896. Up to 8209 conditions per place. [2023-08-24 09:14:39,746 INFO L140 encePairwiseOnDemand]: 349/362 looper letters, 1016 selfloop transitions, 1441 changer transitions 0/2505 dead transitions. [2023-08-24 09:14:39,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 2505 transitions, 62538 flow [2023-08-24 09:14:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 09:14:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 09:14:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2595 transitions. [2023-08-24 09:14:39,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842541436464087 [2023-08-24 09:14:39,749 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2595 transitions. [2023-08-24 09:14:39,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2595 transitions. [2023-08-24 09:14:39,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:14:39,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2595 transitions. [2023-08-24 09:14:39,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 129.75) internal successors, (2595), 20 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:39,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 362.0) internal successors, (7602), 21 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:39,754 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 362.0) internal successors, (7602), 21 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:39,754 INFO L175 Difference]: Start difference. First operand has 329 places, 2177 transitions, 51605 flow. Second operand 20 states and 2595 transitions. [2023-08-24 09:14:39,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 2505 transitions, 62538 flow [2023-08-24 09:14:43,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 2505 transitions, 61165 flow, removed 72 selfloop flow, removed 13 redundant places. [2023-08-24 09:14:44,028 INFO L231 Difference]: Finished difference. Result has 337 places, 2280 transitions, 56349 flow [2023-08-24 09:14:44,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=50262, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=56349, PETRI_PLACES=337, PETRI_TRANSITIONS=2280} [2023-08-24 09:14:44,030 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 304 predicate places. [2023-08-24 09:14:44,030 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 2280 transitions, 56349 flow [2023-08-24 09:14:44,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:14:44,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:14:44,030 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:14:44,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 09:14:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-24 09:14:44,231 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:14:44,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:14:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash 795410662, now seen corresponding path program 2 times [2023-08-24 09:14:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:14:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665029946] [2023-08-24 09:14:44,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:14:44,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:14:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:14:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:14:46,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:14:46,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665029946] [2023-08-24 09:14:46,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665029946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:14:46,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125833072] [2023-08-24 09:14:46,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:14:46,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:14:46,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:14:46,334 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:14:46,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 09:14:46,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:14:46,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:14:46,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 117 conjunts are in the unsatisfiable core [2023-08-24 09:14:46,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:14:46,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 09:14:46,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 09:14:46,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:14:47,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:14:47,025 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 09:14:47,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 09:14:47,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:14:47,087 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 09:14:47,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 09:14:47,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:47,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:14:47,441 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-24 09:14:47,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2023-08-24 09:14:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:14:47,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:14:48,009 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ c_~A~0.offset .cse10)) (.cse4 (+ .cse10 c_~B~0.offset))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (~M~0 Int)) (or (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse2 (select .cse5 c_~A~0.base)) (.cse0 (select .cse5 c_~B~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)) (select .cse0 c_~B~0.offset) (select .cse2 c_~A~0.offset))) (+ (select .cse2 .cse3) c_~res1~0 (select .cse0 .cse4) 1)))) (<= c_~N~0 ~M~0) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (~M~0 Int)) (or (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse7 (select .cse9 c_~B~0.base)) (.cse6 (select .cse9 c_~A~0.base))) (<= (+ (select .cse6 .cse3) c_~res1~0 (select .cse7 .cse4)) (let ((.cse8 (* ~M~0 4))) (+ (select .cse7 (+ .cse8 c_~B~0.offset)) c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse8)) (select .cse7 c_~B~0.offset) (select .cse6 c_~A~0.offset)))))) (<= c_~N~0 ~M~0) (<= ~M~0 0)))))) is different from false [2023-08-24 09:14:48,046 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ .cse10 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset .cse10))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse0 (select .cse5 c_~B~0.base)) (.cse2 (select .cse5 c_~A~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) (select .cse2 c_~A~0.offset) (select .cse0 c_~B~0.offset) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select .cse0 .cse3) 1 (select .cse2 .cse4))))) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse6 (select .cse9 c_~B~0.base)) (.cse7 (select .cse9 c_~A~0.base))) (<= (+ c_~res1~0 (select .cse6 .cse3) (select .cse7 .cse4)) (let ((.cse8 (* ~M~0 4))) (+ (select .cse6 (+ .cse8 c_~B~0.offset)) (select .cse7 c_~A~0.offset) (select .cse6 c_~B~0.offset) c_~res2~0 (select .cse7 (+ c_~A~0.offset .cse8))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0)))))) is different from false [2023-08-24 09:14:48,072 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse12))) (.cse2 (+ c_~A~0.offset .cse12 4)) (.cse4 (+ .cse12 4 c_~B~0.offset)) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ .cse12 c_~B~0.offset)))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse3 (select .cse7 c_~B~0.base)) (.cse1 (select .cse7 c_~A~0.base))) (<= (+ .cse0 (select .cse1 .cse2) (select .cse3 .cse4) .cse5 c_~res1~0) (let ((.cse6 (* ~M~0 4))) (+ (select .cse3 (+ .cse6 c_~B~0.offset)) (select .cse1 c_~A~0.offset) (select .cse3 c_~B~0.offset) c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse6))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse10 (select .cse11 c_~A~0.base)) (.cse8 (select .cse11 c_~B~0.base))) (< (let ((.cse9 (* ~M~0 4))) (+ (select .cse8 (+ .cse9 c_~B~0.offset)) (select .cse10 c_~A~0.offset) (select .cse8 c_~B~0.offset) c_~res2~0 (select .cse10 (+ c_~A~0.offset .cse9)))) (+ .cse0 (select .cse10 .cse2) (select .cse8 .cse4) .cse5 c_~res1~0 1)))) (<= ~M~0 0)))))) is different from false [2023-08-24 09:14:48,093 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse4 (+ 4 c_~B~0.offset)) (.cse5 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse6 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= ~M~0 0) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse0 (select .cse7 c_~B~0.base)) (.cse2 (select .cse7 c_~A~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) (select .cse2 c_~A~0.offset) (select .cse0 c_~B~0.offset) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ .cse3 (select .cse0 .cse4) .cse5 c_~res1~0 (select .cse2 .cse6) 1)))))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse8 (select .cse11 c_~B~0.base)) (.cse9 (select .cse11 c_~A~0.base))) (<= (+ .cse3 (select .cse8 .cse4) .cse5 c_~res1~0 (select .cse9 .cse6)) (let ((.cse10 (* ~M~0 4))) (+ (select .cse8 (+ .cse10 c_~B~0.offset)) (select .cse9 c_~A~0.offset) (select .cse8 c_~B~0.offset) c_~res2~0 (select .cse9 (+ c_~A~0.offset .cse10))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0))))) is different from false [2023-08-24 09:14:48,141 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1204))) (let ((.cse6 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (select .cse6 c_~A~0.base))) (<= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select .cse1 .cse2) (select .cse3 .cse4)) (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse3 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse1 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse3 (+ c_~A~0.offset .cse5)))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= ~M~0 0) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1204))) (let ((.cse11 (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse7 (select .cse11 c_~A~0.base))) (< (let ((.cse9 (* ~M~0 4))) (+ c_~res2~0 (select .cse7 c_~A~0.offset) (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse8 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse7 (+ c_~A~0.offset .cse9)))) (+ (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select (select .cse10 c_~A~0.base) c_~A~0.offset) (select .cse8 .cse2) (select .cse7 .cse4) 1))))))))) is different from false [2023-08-24 09:14:48,153 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:14:48,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 130 [2023-08-24 09:14:48,321 INFO L322 Elim1Store]: treesize reduction 16, result has 89.7 percent of original size [2023-08-24 09:14:48,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53750 treesize of output 46209 [2023-08-24 09:14:48,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:48,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:48,509 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:14:48,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 2806 treesize of output 2534 [2023-08-24 09:14:48,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:48,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:48,649 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:14:48,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 2422 treesize of output 1766 [2023-08-24 09:14:48,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:48,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:14:48,791 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:14:48,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1654 treesize of output 1510 [2023-08-24 09:19:33,367 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:33,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 131 [2023-08-24 09:19:33,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:33,372 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:33,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:33,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:33,463 INFO L322 Elim1Store]: treesize reduction 91, result has 41.7 percent of original size [2023-08-24 09:19:33,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 822 treesize of output 598 [2023-08-24 09:19:33,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:19:33,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:19:33,497 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:33,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 58 [2023-08-24 09:19:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-08-24 09:19:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125833072] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:19:33,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:19:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 48 [2023-08-24 09:19:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334430895] [2023-08-24 09:19:33,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:19:33,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-08-24 09:19:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:19:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-08-24 09:19:33,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1826, Unknown=5, NotChecked=450, Total=2450 [2023-08-24 09:19:33,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 362 [2023-08-24 09:19:33,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 2280 transitions, 56349 flow. Second operand has 50 states, 50 states have (on average 86.5) internal successors, (4325), 50 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:33,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:19:33,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 362 [2023-08-24 09:19:33,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:19:54,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:19:56,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:20:00,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:20:03,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:20:16,980 INFO L124 PetriNetUnfolderBase]: 31264/44092 cut-off events. [2023-08-24 09:20:16,980 INFO L125 PetriNetUnfolderBase]: For 1351753/1351753 co-relation queries the response was YES. [2023-08-24 09:20:17,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504643 conditions, 44092 events. 31264/44092 cut-off events. For 1351753/1351753 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 271878 event pairs, 1699 based on Foata normal form. 4/44096 useless extension candidates. Maximal degree in co-relation 504556. Up to 24548 conditions per place. [2023-08-24 09:20:17,728 INFO L140 encePairwiseOnDemand]: 343/362 looper letters, 3786 selfloop transitions, 3323 changer transitions 58/7167 dead transitions. [2023-08-24 09:20:17,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 7167 transitions, 186324 flow [2023-08-24 09:20:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-08-24 09:20:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-08-24 09:20:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 9904 transitions. [2023-08-24 09:20:17,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25810486813301364 [2023-08-24 09:20:17,740 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 9904 transitions. [2023-08-24 09:20:17,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 9904 transitions. [2023-08-24 09:20:17,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:20:17,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 9904 transitions. [2023-08-24 09:20:17,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 93.43396226415095) internal successors, (9904), 106 states have internal predecessors, (9904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:20:17,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 362.0) internal successors, (38734), 107 states have internal predecessors, (38734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:20:17,778 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 362.0) internal successors, (38734), 107 states have internal predecessors, (38734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:20:17,779 INFO L175 Difference]: Start difference. First operand has 337 places, 2280 transitions, 56349 flow. Second operand 106 states and 9904 transitions. [2023-08-24 09:20:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 7167 transitions, 186324 flow [2023-08-24 09:20:38,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 7167 transitions, 178492 flow, removed 153 selfloop flow, removed 13 redundant places. [2023-08-24 09:20:38,371 INFO L231 Difference]: Finished difference. Result has 490 places, 5587 transitions, 147711 flow [2023-08-24 09:20:38,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=53725, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=643, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=147711, PETRI_PLACES=490, PETRI_TRANSITIONS=5587} [2023-08-24 09:20:38,373 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 457 predicate places. [2023-08-24 09:20:38,373 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 5587 transitions, 147711 flow [2023-08-24 09:20:38,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 86.5) internal successors, (4325), 50 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:20:38,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:20:38,374 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:20:38,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-24 09:20:38,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-24 09:20:38,582 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:20:38,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:20:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 586470184, now seen corresponding path program 3 times [2023-08-24 09:20:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:20:38,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902159316] [2023-08-24 09:20:38,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:20:38,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:20:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:20:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:20:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:20:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902159316] [2023-08-24 09:20:40,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902159316] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:20:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546340075] [2023-08-24 09:20:40,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:20:40,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:20:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:20:40,255 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:20:40,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 09:20:40,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:20:40,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:20:40,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 108 conjunts are in the unsatisfiable core [2023-08-24 09:20:40,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:20:40,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 09:20:40,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:20:40,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:20:40,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:20:41,132 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:20:41,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:20:41,158 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-24 09:20:41,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2023-08-24 09:20:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:20:41,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:20:55,739 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:20:55,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 86 [2023-08-24 09:20:55,782 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:20:55,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 20470 treesize of output 18750 [2023-08-24 09:20:55,868 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:20:55,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2326 treesize of output 2066 [2023-08-24 09:20:55,932 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:20:55,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2006 treesize of output 1906 [2023-08-24 09:20:56,007 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:20:56,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1846 treesize of output 1266 [2023-08-24 09:21:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:21:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546340075] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:21:06,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:21:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 49 [2023-08-24 09:21:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294585097] [2023-08-24 09:21:06,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:21:06,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-24 09:21:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:21:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-24 09:21:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2214, Unknown=31, NotChecked=0, Total=2550 [2023-08-24 09:21:06,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 362 [2023-08-24 09:21:06,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 5587 transitions, 147711 flow. Second operand has 51 states, 51 states have (on average 86.54901960784314) internal successors, (4414), 51 states have internal predecessors, (4414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:21:06,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:21:06,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 362 [2023-08-24 09:21:06,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:21:09,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:21:12,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:22:08,252 INFO L124 PetriNetUnfolderBase]: 42112/59785 cut-off events. [2023-08-24 09:22:08,252 INFO L125 PetriNetUnfolderBase]: For 2069103/2069103 co-relation queries the response was YES. [2023-08-24 09:22:09,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733456 conditions, 59785 events. 42112/59785 cut-off events. For 2069103/2069103 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 388111 event pairs, 2321 based on Foata normal form. 6/59791 useless extension candidates. Maximal degree in co-relation 733315. Up to 38908 conditions per place. [2023-08-24 09:22:09,945 INFO L140 encePairwiseOnDemand]: 344/362 looper letters, 4268 selfloop transitions, 4396 changer transitions 3/8667 dead transitions. [2023-08-24 09:22:09,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 8667 transitions, 237427 flow [2023-08-24 09:22:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-08-24 09:22:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2023-08-24 09:22:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 7948 transitions. [2023-08-24 09:22:09,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26137858458300445 [2023-08-24 09:22:09,952 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 7948 transitions. [2023-08-24 09:22:09,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 7948 transitions. [2023-08-24 09:22:09,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:22:09,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 7948 transitions. [2023-08-24 09:22:09,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 94.61904761904762) internal successors, (7948), 84 states have internal predecessors, (7948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:22:09,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 362.0) internal successors, (30770), 85 states have internal predecessors, (30770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:22:09,977 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 362.0) internal successors, (30770), 85 states have internal predecessors, (30770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:22:09,978 INFO L175 Difference]: Start difference. First operand has 490 places, 5587 transitions, 147711 flow. Second operand 84 states and 7948 transitions. [2023-08-24 09:22:09,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 8667 transitions, 237427 flow [2023-08-24 09:23:20,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 8667 transitions, 226027 flow, removed 5694 selfloop flow, removed 9 redundant places. [2023-08-24 09:23:20,242 INFO L231 Difference]: Finished difference. Result has 596 places, 7693 transitions, 207896 flow [2023-08-24 09:23:20,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=139977, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=207896, PETRI_PLACES=596, PETRI_TRANSITIONS=7693} [2023-08-24 09:23:20,246 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 563 predicate places. [2023-08-24 09:23:20,246 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 7693 transitions, 207896 flow [2023-08-24 09:23:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 86.54901960784314) internal successors, (4414), 51 states have internal predecessors, (4414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:23:20,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:23:20,247 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:23:20,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 09:23:20,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:23:20,454 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:23:20,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:23:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1019052926, now seen corresponding path program 4 times [2023-08-24 09:23:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:23:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094403862] [2023-08-24 09:23:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:23:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:23:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:23:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:23:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:23:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094403862] [2023-08-24 09:23:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094403862] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:23:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183180282] [2023-08-24 09:23:22,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:23:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:23:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:23:22,005 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:23:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-24 09:23:22,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:23:22,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:23:22,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-24 09:23:22,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:23:22,841 INFO L322 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2023-08-24 09:23:22,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2023-08-24 09:23:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:23:23,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:23:23,820 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:23:23,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 342 [2023-08-24 09:23:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:23:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183180282] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:23:58,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:23:58,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 14] total 46 [2023-08-24 09:23:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804920304] [2023-08-24 09:23:58,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:23:58,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-08-24 09:23:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:23:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-08-24 09:23:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2023-08-24 09:23:58,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 362 [2023-08-24 09:23:58,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 7693 transitions, 207896 flow. Second operand has 48 states, 48 states have (on average 84.75) internal successors, (4068), 48 states have internal predecessors, (4068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:23:58,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:23:58,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 362 [2023-08-24 09:23:58,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-24 09:24:43,260 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 09:24:43,262 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 09:24:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2023-08-24 09:24:43,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 09:24:43,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-24 09:24:43,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:43,621 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 83/362 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 232821 conditions, 21178 events (14803/21177 cut-off events. For 647099/647099 co-relation queries the response was YES. Maximal size of possible extension queue 2592. Compared 145037 event pairs, 657 based on Foata normal form. 0/23757 useless extension candidates. Maximal degree in co-relation 232646. Up to 9038 conditions per place.). [2023-08-24 09:24:43,622 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 09:24:43,622 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 09:24:43,622 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 09:24:43,623 INFO L445 BasicCegarLoop]: Path program histogram: [16, 4, 2, 1, 1] [2023-08-24 09:24:43,625 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 09:24:43,625 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 09:24:43,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 09:24:43 BasicIcfg [2023-08-24 09:24:43,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 09:24:43,628 INFO L158 Benchmark]: Toolchain (without parser) took 792704.54ms. Allocated memory was 364.9MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 325.1MB in the beginning and 6.5GB in the end (delta: -6.1GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2023-08-24 09:24:43,628 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 364.9MB. Free memory was 342.9MB in the beginning and 342.7MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 09:24:43,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.74ms. Allocated memory is still 364.9MB. Free memory was 325.1MB in the beginning and 313.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-24 09:24:43,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.80ms. Allocated memory is still 364.9MB. Free memory was 313.5MB in the beginning and 310.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 09:24:43,629 INFO L158 Benchmark]: Boogie Preprocessor took 54.87ms. Allocated memory is still 364.9MB. Free memory was 310.4MB in the beginning and 308.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 09:24:43,629 INFO L158 Benchmark]: RCFGBuilder took 858.41ms. Allocated memory is still 364.9MB. Free memory was 308.3MB in the beginning and 244.3MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.0GB. [2023-08-24 09:24:43,629 INFO L158 Benchmark]: TraceAbstraction took 791460.63ms. Allocated memory was 364.9MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 244.3MB in the beginning and 6.5GB in the end (delta: -6.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-24 09:24:43,630 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.17ms. Allocated memory is still 364.9MB. Free memory was 342.9MB in the beginning and 342.7MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 259.74ms. Allocated memory is still 364.9MB. Free memory was 325.1MB in the beginning and 313.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.80ms. Allocated memory is still 364.9MB. Free memory was 313.5MB in the beginning and 310.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.87ms. Allocated memory is still 364.9MB. Free memory was 310.4MB in the beginning and 308.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 858.41ms. Allocated memory is still 364.9MB. Free memory was 308.3MB in the beginning and 244.3MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.0GB. * TraceAbstraction took 791460.63ms. Allocated memory was 364.9MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 244.3MB in the beginning and 6.5GB in the end (delta: -6.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 169 PlacesBefore, 33 PlacesAfterwards, 175 TransitionsBefore, 28 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 7 FixpointIterations, 100 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 6 ConcurrentYvCompositions, 11 ChoiceCompositions, 174 TotalNumberOfCompositions, 2271 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1929, independent: 1883, independent conditional: 0, independent unconditional: 1883, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 929, independent: 915, independent conditional: 0, independent unconditional: 915, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1929, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 929, unknown conditional: 0, unknown unconditional: 929] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 83/362 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 232821 conditions, 21178 events (14803/21177 cut-off events. For 647099/647099 co-relation queries the response was YES. Maximal size of possible extension queue 2592. Compared 145037 event pairs, 657 based on Foata normal form. 0/23757 useless extension candidates. Maximal degree in co-relation 232646. Up to 9038 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 83/362 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 232821 conditions, 21178 events (14803/21177 cut-off events. For 647099/647099 co-relation queries the response was YES. Maximal size of possible extension queue 2592. Compared 145037 event pairs, 657 based on Foata normal form. 0/23757 useless extension candidates. Maximal degree in co-relation 232646. Up to 9038 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 83/362 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 232821 conditions, 21178 events (14803/21177 cut-off events. For 647099/647099 co-relation queries the response was YES. Maximal size of possible extension queue 2592. Compared 145037 event pairs, 657 based on Foata normal form. 0/23757 useless extension candidates. Maximal degree in co-relation 232646. Up to 9038 conditions per place.). - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 83/362 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 232821 conditions, 21178 events (14803/21177 cut-off events. For 647099/647099 co-relation queries the response was YES. Maximal size of possible extension queue 2592. Compared 145037 event pairs, 657 based on Foata normal form. 0/23757 useless extension candidates. Maximal degree in co-relation 232646. Up to 9038 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 209 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 791.3s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 334.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 6149 SdHoareTripleChecker+Valid, 37.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6149 mSDsluCounter, 1882 SdHoareTripleChecker+Invalid, 34.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5156 IncrementalHoareTripleChecker+Unchecked, 1723 mSDsCounter, 739 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36863 IncrementalHoareTripleChecker+Invalid, 42764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 739 mSolverCounterUnsat, 159 mSDtfsCounter, 36863 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2157 GetRequests, 887 SyntacticMatches, 39 SemanticMatches, 1231 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 34307 ImplicationChecksByTransitivity, 66.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207896occurred in iteration=23, InterpolantAutomatonStates: 700, 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.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 441.2s InterpolantComputationTime, 1291 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1833 ConstructedInterpolants, 47 QuantifiedInterpolants, 21290 SizeOfPredicates, 350 NumberOfNonLiveVariables, 7386 ConjunctsInSsa, 782 ConjunctsInUnsatCore, 69 InterpolantComputations, 4 PerfectInterpolantSequences, 261/486 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown