/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:28:38,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:28:38,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 12:28:38,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:28:38,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:28:38,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:28:38,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:28:38,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:28:38,379 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:28:38,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:28:38,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:28:38,385 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:28:38,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:28:38,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:28:38,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:28:38,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:28:38,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:28:38,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:28:38,387 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:28:38,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:28:38,388 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:28:38,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:28:38,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:28:38,390 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:28:38,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:28:38,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:28:38,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:28:38,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:28:38,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:28:38,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:28:38,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:28:38,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:28:38,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:28:38,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 12:28:38,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:28:38,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:28:38,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:28:38,663 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:28:38,664 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:28:38,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2023-11-10 12:28:39,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:28:40,034 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:28:40,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2023-11-10 12:28:40,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6773bc10/e09c8efacd8449a8a7b4807caf6bf7b0/FLAGc8ccd233d [2023-11-10 12:28:40,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6773bc10/e09c8efacd8449a8a7b4807caf6bf7b0 [2023-11-10 12:28:40,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:28:40,061 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:28:40,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:28:40,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:28:40,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:28:40,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132e38d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40, skipping insertion in model container [2023-11-10 12:28:40,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,098 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:28:40,244 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-horseshoe.wvr.c[3424,3437] [2023-11-10 12:28:40,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:28:40,261 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:28:40,282 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-horseshoe.wvr.c[3424,3437] [2023-11-10 12:28:40,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:28:40,293 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:28:40,293 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:28:40,299 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:28:40,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40 WrapperNode [2023-11-10 12:28:40,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:28:40,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:28:40,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:28:40,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:28:40,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,371 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 254 [2023-11-10 12:28:40,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:28:40,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:28:40,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:28:40,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:28:40,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:28:40,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:28:40,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:28:40,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:28:40,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (1/1) ... [2023-11-10 12:28:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:28:40,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:28:40,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 12:28:40,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 12:28:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:28:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:28:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:28:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:28:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:28:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:28:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:28:40,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:28:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-10 12:28:40,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-10 12:28:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:28:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 12:28:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 12:28:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:28:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:28:40,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:28:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:28:40,517 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:28:40,643 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:28:40,645 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:28:41,020 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:28:41,185 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:28:41,186 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-10 12:28:41,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:28:41 BoogieIcfgContainer [2023-11-10 12:28:41,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:28:41,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:28:41,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:28:41,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:28:41,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:28:40" (1/3) ... [2023-11-10 12:28:41,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf1b2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:28:41, skipping insertion in model container [2023-11-10 12:28:41,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:40" (2/3) ... [2023-11-10 12:28:41,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf1b2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:28:41, skipping insertion in model container [2023-11-10 12:28:41,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:28:41" (3/3) ... [2023-11-10 12:28:41,199 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2023-11-10 12:28:41,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:28:41,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:28:41,214 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:28:41,272 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 12:28:41,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 217 transitions, 455 flow [2023-11-10 12:28:41,375 INFO L124 PetriNetUnfolderBase]: 18/214 cut-off events. [2023-11-10 12:28:41,375 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 12:28:41,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 214 events. 18/214 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 116 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 176. Up to 3 conditions per place. [2023-11-10 12:28:41,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 217 transitions, 455 flow [2023-11-10 12:28:41,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 203 transitions, 424 flow [2023-11-10 12:28:41,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:28:41,399 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@46f9a547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:28:41,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-10 12:28:41,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:28:41,445 INFO L124 PetriNetUnfolderBase]: 18/202 cut-off events. [2023-11-10 12:28:41,445 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 12:28:41,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:28:41,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:28:41,446 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-11-10 12:28:41,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:28:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 914137893, now seen corresponding path program 1 times [2023-11-10 12:28:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:28:41,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617929033] [2023-11-10 12:28:41,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:41,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:28:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:28:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617929033] [2023-11-10 12:28:41,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617929033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:28:41,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:28:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 12:28:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134552183] [2023-11-10 12:28:41,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:28:41,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-10 12:28:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:28:41,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-10 12:28:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-10 12:28:41,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 217 [2023-11-10 12:28:41,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 203 transitions, 424 flow. Second operand has 2 states, 2 states have (on average 196.5) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:41,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:28:41,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 217 [2023-11-10 12:28:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:28:42,008 INFO L124 PetriNetUnfolderBase]: 71/380 cut-off events. [2023-11-10 12:28:42,009 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-10 12:28:42,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 380 events. 71/380 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1077 event pairs, 38 based on Foata normal form. 60/401 useless extension candidates. Maximal degree in co-relation 336. Up to 106 conditions per place. [2023-11-10 12:28:42,017 INFO L140 encePairwiseOnDemand]: 204/217 looper letters, 11 selfloop transitions, 0 changer transitions 6/190 dead transitions. [2023-11-10 12:28:42,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 190 transitions, 420 flow [2023-11-10 12:28:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-10 12:28:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-10 12:28:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 408 transitions. [2023-11-10 12:28:42,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9400921658986175 [2023-11-10 12:28:42,037 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 408 transitions. [2023-11-10 12:28:42,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 408 transitions. [2023-11-10 12:28:42,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:28:42,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 408 transitions. [2023-11-10 12:28:42,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 204.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,058 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,059 INFO L175 Difference]: Start difference. First operand has 195 places, 203 transitions, 424 flow. Second operand 2 states and 408 transitions. [2023-11-10 12:28:42,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 190 transitions, 420 flow [2023-11-10 12:28:42,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 190 transitions, 408 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-10 12:28:42,071 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 374 flow [2023-11-10 12:28:42,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=374, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2023-11-10 12:28:42,078 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, -5 predicate places. [2023-11-10 12:28:42,079 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 374 flow [2023-11-10 12:28:42,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 196.5) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:28:42,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:28:42,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:28:42,081 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-11-10 12:28:42,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:28:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 634169762, now seen corresponding path program 1 times [2023-11-10 12:28:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:28:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681208371] [2023-11-10 12:28:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:28:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:28:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681208371] [2023-11-10 12:28:42,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681208371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:28:42,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:28:42,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:28:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433148525] [2023-11-10 12:28:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:28:42,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:28:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:28:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:28:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:28:42,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 217 [2023-11-10 12:28:42,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:28:42,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 217 [2023-11-10 12:28:42,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:28:42,596 INFO L124 PetriNetUnfolderBase]: 82/402 cut-off events. [2023-11-10 12:28:42,596 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-10 12:28:42,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 402 events. 82/402 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1140 event pairs, 23 based on Foata normal form. 8/383 useless extension candidates. Maximal degree in co-relation 537. Up to 82 conditions per place. [2023-11-10 12:28:42,599 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 19 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2023-11-10 12:28:42,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 190 transitions, 430 flow [2023-11-10 12:28:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:28:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:28:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2023-11-10 12:28:42,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001536098310292 [2023-11-10 12:28:42,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 586 transitions. [2023-11-10 12:28:42,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 586 transitions. [2023-11-10 12:28:42,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:28:42,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 586 transitions. [2023-11-10 12:28:42,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,608 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 374 flow. Second operand 3 states and 586 transitions. [2023-11-10 12:28:42,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 190 transitions, 430 flow [2023-11-10 12:28:42,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 12:28:42,615 INFO L231 Difference]: Finished difference. Result has 187 places, 185 transitions, 386 flow [2023-11-10 12:28:42,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=187, PETRI_TRANSITIONS=185} [2023-11-10 12:28:42,616 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, -8 predicate places. [2023-11-10 12:28:42,616 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 185 transitions, 386 flow [2023-11-10 12:28:42,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:28:42,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:28:42,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:28:42,617 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-11-10 12:28:42,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:28:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1211723578, now seen corresponding path program 2 times [2023-11-10 12:28:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:28:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753559326] [2023-11-10 12:28:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:28:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:42,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:28:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753559326] [2023-11-10 12:28:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753559326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:28:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:28:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:28:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490843836] [2023-11-10 12:28:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:28:42,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:28:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:28:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:28:42,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:28:42,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 217 [2023-11-10 12:28:42,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 185 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:28:42,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 217 [2023-11-10 12:28:42,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:28:42,951 INFO L124 PetriNetUnfolderBase]: 58/352 cut-off events. [2023-11-10 12:28:42,951 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-10 12:28:42,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 352 events. 58/352 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 841 event pairs, 15 based on Foata normal form. 2/331 useless extension candidates. Maximal degree in co-relation 492. Up to 91 conditions per place. [2023-11-10 12:28:42,954 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 17 selfloop transitions, 3 changer transitions 0/189 dead transitions. [2023-11-10 12:28:42,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 189 transitions, 436 flow [2023-11-10 12:28:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:28:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:28:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-11-10 12:28:42,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8970814132104454 [2023-11-10 12:28:42,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-11-10 12:28:42,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-11-10 12:28:42,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:28:42,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-11-10 12:28:42,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,962 INFO L175 Difference]: Start difference. First operand has 187 places, 185 transitions, 386 flow. Second operand 3 states and 584 transitions. [2023-11-10 12:28:42,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 189 transitions, 436 flow [2023-11-10 12:28:42,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 189 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:28:42,969 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 403 flow [2023-11-10 12:28:42,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2023-11-10 12:28:42,970 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, -6 predicate places. [2023-11-10 12:28:42,971 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 403 flow [2023-11-10 12:28:42,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:42,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:28:42,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:28:42,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:28:42,972 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-11-10 12:28:42,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:28:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash 14074000, now seen corresponding path program 3 times [2023-11-10 12:28:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:28:42,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291793597] [2023-11-10 12:28:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:28:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:28:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291793597] [2023-11-10 12:28:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291793597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:28:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:28:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 12:28:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486884637] [2023-11-10 12:28:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:28:43,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 12:28:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:28:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 12:28:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 12:28:43,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 217 [2023-11-10 12:28:43,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 187 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 165.66666666666666) internal successors, (994), 6 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:28:43,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 217 [2023-11-10 12:28:43,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:28:43,437 INFO L124 PetriNetUnfolderBase]: 59/436 cut-off events. [2023-11-10 12:28:43,438 INFO L125 PetriNetUnfolderBase]: For 60/70 co-relation queries the response was YES. [2023-11-10 12:28:43,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 436 events. 59/436 cut-off events. For 60/70 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1098 event pairs, 19 based on Foata normal form. 6/410 useless extension candidates. Maximal degree in co-relation 676. Up to 108 conditions per place. [2023-11-10 12:28:43,441 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 42 selfloop transitions, 8 changer transitions 22/213 dead transitions. [2023-11-10 12:28:43,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 213 transitions, 602 flow [2023-11-10 12:28:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 12:28:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 12:28:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1511 transitions. [2023-11-10 12:28:43,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7736815156169995 [2023-11-10 12:28:43,445 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1511 transitions. [2023-11-10 12:28:43,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1511 transitions. [2023-11-10 12:28:43,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:28:43,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1511 transitions. [2023-11-10 12:28:43,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.88888888888889) internal successors, (1511), 9 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,455 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,455 INFO L175 Difference]: Start difference. First operand has 189 places, 187 transitions, 403 flow. Second operand 9 states and 1511 transitions. [2023-11-10 12:28:43,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 213 transitions, 602 flow [2023-11-10 12:28:43,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 213 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:28:43,460 INFO L231 Difference]: Finished difference. Result has 199 places, 188 transitions, 432 flow [2023-11-10 12:28:43,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=199, PETRI_TRANSITIONS=188} [2023-11-10 12:28:43,462 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 4 predicate places. [2023-11-10 12:28:43,462 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 188 transitions, 432 flow [2023-11-10 12:28:43,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.66666666666666) internal successors, (994), 6 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:28:43,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:28:43,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 12:28:43,464 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-11-10 12:28:43,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:28:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash 576584057, now seen corresponding path program 1 times [2023-11-10 12:28:43,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:28:43,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189870865] [2023-11-10 12:28:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:28:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:28:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:28:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189870865] [2023-11-10 12:28:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189870865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:28:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:28:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 12:28:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394852734] [2023-11-10 12:28:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:28:43,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 12:28:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:28:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 12:28:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 12:28:43,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 217 [2023-11-10 12:28:43,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 188 transitions, 432 flow. Second operand has 6 states, 6 states have (on average 166.33333333333334) internal successors, (998), 6 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:28:43,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 217 [2023-11-10 12:28:43,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:28:43,851 INFO L124 PetriNetUnfolderBase]: 75/458 cut-off events. [2023-11-10 12:28:43,852 INFO L125 PetriNetUnfolderBase]: For 103/121 co-relation queries the response was YES. [2023-11-10 12:28:43,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 458 events. 75/458 cut-off events. For 103/121 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1319 event pairs, 26 based on Foata normal form. 5/422 useless extension candidates. Maximal degree in co-relation 762. Up to 93 conditions per place. [2023-11-10 12:28:43,855 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 43 selfloop transitions, 8 changer transitions 13/205 dead transitions. [2023-11-10 12:28:43,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 205 transitions, 612 flow [2023-11-10 12:28:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 12:28:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 12:28:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1499 transitions. [2023-11-10 12:28:43,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.767537122375832 [2023-11-10 12:28:43,866 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1499 transitions. [2023-11-10 12:28:43,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1499 transitions. [2023-11-10 12:28:43,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:28:43,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1499 transitions. [2023-11-10 12:28:43,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 166.55555555555554) internal successors, (1499), 9 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,875 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,875 INFO L175 Difference]: Start difference. First operand has 199 places, 188 transitions, 432 flow. Second operand 9 states and 1499 transitions. [2023-11-10 12:28:43,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 205 transitions, 612 flow [2023-11-10 12:28:43,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 586 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-10 12:28:43,881 INFO L231 Difference]: Finished difference. Result has 201 places, 189 transitions, 440 flow [2023-11-10 12:28:43,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=201, PETRI_TRANSITIONS=189} [2023-11-10 12:28:43,883 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 6 predicate places. [2023-11-10 12:28:43,883 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 189 transitions, 440 flow [2023-11-10 12:28:43,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.33333333333334) internal successors, (998), 6 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:43,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:28:43,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:28:43,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 12:28:43,885 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-11-10 12:28:43,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:28:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 329517885, now seen corresponding path program 1 times [2023-11-10 12:28:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:28:43,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305849406] [2023-11-10 12:28:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:43,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:28:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:28:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305849406] [2023-11-10 12:28:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305849406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:28:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871310728] [2023-11-10 12:28:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:28:48,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:28:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:28:48,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:28:48,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-10 12:28:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:28:48,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-10 12:28:48,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:28:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:52,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:28:53,488 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-11-10 12:28:53,489 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 63 treesize of output 111 [2023-11-10 12:28:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:28:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871310728] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:28:57,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:28:57,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36, 26] total 89 [2023-11-10 12:28:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574763807] [2023-11-10 12:28:57,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:28:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-11-10 12:28:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:28:57,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-11-10 12:28:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=998, Invalid=6834, Unknown=0, NotChecked=0, Total=7832 [2023-11-10 12:28:57,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 217 [2023-11-10 12:28:57,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 189 transitions, 440 flow. Second operand has 89 states, 89 states have (on average 77.58426966292134) internal successors, (6905), 89 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:28:57,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:28:57,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 217 [2023-11-10 12:28:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:29:16,811 INFO L124 PetriNetUnfolderBase]: 5094/10810 cut-off events. [2023-11-10 12:29:16,811 INFO L125 PetriNetUnfolderBase]: For 2762/2842 co-relation queries the response was YES. [2023-11-10 12:29:16,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21820 conditions, 10810 events. 5094/10810 cut-off events. For 2762/2842 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 94865 event pairs, 166 based on Foata normal form. 2/9955 useless extension candidates. Maximal degree in co-relation 21810. Up to 1450 conditions per place. [2023-11-10 12:29:16,894 INFO L140 encePairwiseOnDemand]: 159/217 looper letters, 891 selfloop transitions, 429 changer transitions 8/1390 dead transitions. [2023-11-10 12:29:16,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1390 transitions, 6283 flow [2023-11-10 12:29:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2023-11-10 12:29:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2023-11-10 12:29:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 13615 transitions. [2023-11-10 12:29:16,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.377963466770307 [2023-11-10 12:29:16,928 INFO L72 ComplementDD]: Start complementDD. Operand 166 states and 13615 transitions. [2023-11-10 12:29:16,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 13615 transitions. [2023-11-10 12:29:16,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:29:16,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 166 states and 13615 transitions. [2023-11-10 12:29:16,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 167 states, 166 states have (on average 82.01807228915662) internal successors, (13615), 166 states have internal predecessors, (13615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:17,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 167 states, 167 states have (on average 217.0) internal successors, (36239), 167 states have internal predecessors, (36239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:17,047 INFO L81 ComplementDD]: Finished complementDD. Result has 167 states, 167 states have (on average 217.0) internal successors, (36239), 167 states have internal predecessors, (36239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:17,047 INFO L175 Difference]: Start difference. First operand has 201 places, 189 transitions, 440 flow. Second operand 166 states and 13615 transitions. [2023-11-10 12:29:17,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1390 transitions, 6283 flow [2023-11-10 12:29:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1390 transitions, 6216 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-10 12:29:17,077 INFO L231 Difference]: Finished difference. Result has 399 places, 665 transitions, 3146 flow [2023-11-10 12:29:17,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=166, PETRI_FLOW=3146, PETRI_PLACES=399, PETRI_TRANSITIONS=665} [2023-11-10 12:29:17,080 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 204 predicate places. [2023-11-10 12:29:17,081 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 665 transitions, 3146 flow [2023-11-10 12:29:17,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 77.58426966292134) internal successors, (6905), 89 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:17,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:29:17,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:29:17,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-10 12:29:17,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-10 12:29:17,296 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-11-10 12:29:17,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:29:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 853470773, now seen corresponding path program 2 times [2023-11-10 12:29:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:29:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089225434] [2023-11-10 12:29:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:29:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:29:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:29:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:29:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:29:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089225434] [2023-11-10 12:29:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089225434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:29:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904034335] [2023-11-10 12:29:20,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:29:20,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:29:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:29:20,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:29:20,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-10 12:29:20,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-10 12:29:20,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:29:20,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-10 12:29:20,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:29:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:29:22,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-10 12:29:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:29:22,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 12:29:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904034335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:29:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 12:29:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [38] total 52 [2023-11-10 12:29:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047996959] [2023-11-10 12:29:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:29:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-10 12:29:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:29:22,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-10 12:29:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2433, Unknown=0, NotChecked=0, Total=2652 [2023-11-10 12:29:22,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-11-10 12:29:22,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 665 transitions, 3146 flow. Second operand has 21 states, 21 states have (on average 97.66666666666667) internal successors, (2051), 21 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:22,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:29:22,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-11-10 12:29:22,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:29:25,550 INFO L124 PetriNetUnfolderBase]: 6902/14192 cut-off events. [2023-11-10 12:29:25,551 INFO L125 PetriNetUnfolderBase]: For 17821/18065 co-relation queries the response was YES. [2023-11-10 12:29:25,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37937 conditions, 14192 events. 6902/14192 cut-off events. For 17821/18065 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 128823 event pairs, 1300 based on Foata normal form. 42/13959 useless extension candidates. Maximal degree in co-relation 37887. Up to 6368 conditions per place. [2023-11-10 12:29:25,681 INFO L140 encePairwiseOnDemand]: 185/217 looper letters, 648 selfloop transitions, 154 changer transitions 4/919 dead transitions. [2023-11-10 12:29:25,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 919 transitions, 5935 flow [2023-11-10 12:29:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-10 12:29:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-10 12:29:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2720 transitions. [2023-11-10 12:29:25,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46424304488820617 [2023-11-10 12:29:25,686 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2720 transitions. [2023-11-10 12:29:25,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2720 transitions. [2023-11-10 12:29:25,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:29:25,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2720 transitions. [2023-11-10 12:29:25,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 100.74074074074075) internal successors, (2720), 27 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:25,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 217.0) internal successors, (6076), 28 states have internal predecessors, (6076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:25,699 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 217.0) internal successors, (6076), 28 states have internal predecessors, (6076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:25,699 INFO L175 Difference]: Start difference. First operand has 399 places, 665 transitions, 3146 flow. Second operand 27 states and 2720 transitions. [2023-11-10 12:29:25,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 919 transitions, 5935 flow [2023-11-10 12:29:25,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 919 transitions, 5223 flow, removed 337 selfloop flow, removed 15 redundant places. [2023-11-10 12:29:25,800 INFO L231 Difference]: Finished difference. Result has 415 places, 746 transitions, 3581 flow [2023-11-10 12:29:25,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3581, PETRI_PLACES=415, PETRI_TRANSITIONS=746} [2023-11-10 12:29:25,801 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 220 predicate places. [2023-11-10 12:29:25,801 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 746 transitions, 3581 flow [2023-11-10 12:29:25,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 97.66666666666667) internal successors, (2051), 21 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:25,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:29:25,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:29:25,810 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-11-10 12:29:26,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-10 12:29:26,008 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-11-10 12:29:26,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:29:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1605936357, now seen corresponding path program 3 times [2023-11-10 12:29:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:29:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124439127] [2023-11-10 12:29:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:29:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:29:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:29:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:29:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:29:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124439127] [2023-11-10 12:29:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124439127] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:29:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756360778] [2023-11-10 12:29:29,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:29:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:29:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:29:29,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:29:29,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-10 12:29:29,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-10 12:29:29,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:29:29,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-10 12:29:29,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:29:30,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:29:30,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-10 12:29:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:29:30,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 12:29:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756360778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:29:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 12:29:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [39] total 53 [2023-11-10 12:29:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505411710] [2023-11-10 12:29:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:29:30,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-10 12:29:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:29:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-10 12:29:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2552, Unknown=0, NotChecked=0, Total=2756 [2023-11-10 12:29:30,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-11-10 12:29:30,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 746 transitions, 3581 flow. Second operand has 21 states, 21 states have (on average 97.66666666666667) internal successors, (2051), 21 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:30,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:29:30,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-11-10 12:29:30,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:29:34,303 INFO L124 PetriNetUnfolderBase]: 7526/15496 cut-off events. [2023-11-10 12:29:34,303 INFO L125 PetriNetUnfolderBase]: For 21143/21347 co-relation queries the response was YES. [2023-11-10 12:29:34,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41329 conditions, 15496 events. 7526/15496 cut-off events. For 21143/21347 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 143866 event pairs, 1400 based on Foata normal form. 33/15262 useless extension candidates. Maximal degree in co-relation 41274. Up to 6386 conditions per place. [2023-11-10 12:29:34,410 INFO L140 encePairwiseOnDemand]: 185/217 looper letters, 636 selfloop transitions, 161 changer transitions 4/914 dead transitions. [2023-11-10 12:29:34,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 914 transitions, 5827 flow [2023-11-10 12:29:34,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-10 12:29:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-10 12:29:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2717 transitions. [2023-11-10 12:29:34,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637310121181089 [2023-11-10 12:29:34,414 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2717 transitions. [2023-11-10 12:29:34,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2717 transitions. [2023-11-10 12:29:34,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:29:34,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2717 transitions. [2023-11-10 12:29:34,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 100.62962962962963) internal successors, (2717), 27 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:34,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 217.0) internal successors, (6076), 28 states have internal predecessors, (6076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:34,425 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 217.0) internal successors, (6076), 28 states have internal predecessors, (6076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:34,425 INFO L175 Difference]: Start difference. First operand has 415 places, 746 transitions, 3581 flow. Second operand 27 states and 2717 transitions. [2023-11-10 12:29:34,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 914 transitions, 5827 flow [2023-11-10 12:29:34,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 914 transitions, 5735 flow, removed 18 selfloop flow, removed 18 redundant places. [2023-11-10 12:29:34,576 INFO L231 Difference]: Finished difference. Result has 426 places, 756 transitions, 4021 flow [2023-11-10 12:29:34,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3417, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4021, PETRI_PLACES=426, PETRI_TRANSITIONS=756} [2023-11-10 12:29:34,579 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 231 predicate places. [2023-11-10 12:29:34,579 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 756 transitions, 4021 flow [2023-11-10 12:29:34,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 97.66666666666667) internal successors, (2051), 21 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:34,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:29:34,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:29:34,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-10 12:29:34,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:29:34,785 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-11-10 12:29:34,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:29:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1554115961, now seen corresponding path program 4 times [2023-11-10 12:29:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:29:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38258771] [2023-11-10 12:29:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:29:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:29:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:29:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:29:37,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:29:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38258771] [2023-11-10 12:29:37,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38258771] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:29:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254423434] [2023-11-10 12:29:37,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:29:37,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:29:37,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:29:37,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:29:37,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-10 12:29:37,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:29:37,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:29:37,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-10 12:29:37,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:29:39,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:29:39,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:29:39,383 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:29:39,383 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 32 treesize of output 28 [2023-11-10 12:29:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:29:39,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:29:40,113 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:29:40,114 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 212 treesize of output 240 [2023-11-10 12:29:40,140 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:29:40,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 113 [2023-11-10 12:29:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:29:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254423434] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:29:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:29:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 28, 28] total 82 [2023-11-10 12:29:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183966103] [2023-11-10 12:29:43,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:29:43,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-11-10 12:29:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:29:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-11-10 12:29:43,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=6197, Unknown=8, NotChecked=0, Total=6642 [2023-11-10 12:29:43,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 217 [2023-11-10 12:29:43,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 756 transitions, 4021 flow. Second operand has 82 states, 82 states have (on average 71.95121951219512) internal successors, (5900), 82 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:43,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:29:43,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 217 [2023-11-10 12:29:43,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:29:49,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~t~0 2))) (let ((.cse10 (= c_~s~0 .cse1)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (.cse11 (= c_~q2_front~0 c_~q2_back~0)) (.cse12 (= c_~q1_back~0 c_~q1_front~0))) (let ((.cse3 (* c_~q2_front~0 4)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (* c_~q2_back~0 4)) (.cse19 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse13 (and .cse10 .cse14 .cse11 .cse12)) (.cse15 (not (= c_~q1_back~0 0))) (.cse8 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse20 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q1~0.base))) (.cse9 (< c_~q1_back~0 0))) (and (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_245))) (let ((.cse2 (select .cse5 ~q2~0.base))) (let ((.cse0 (select .cse2 (+ ~q2~0.offset .cse7)))) (let ((.cse4 (+ .cse0 1))) (or (= (+ c_~s~0 .cse0) (+ .cse1 (* 2 (select .cse2 (+ ~q2~0.offset .cse3))) 1)) (< 0 .cse4) (< .cse4 (select (select .cse5 c_~q1~0.base) .cse6)))))))) (or .cse8 .cse9 (and .cse10 (<= (+ |c_ULTIMATE.start_main_#t~ret15#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse11 .cse12)) (or .cse8 .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse13) (or (< c_~n1~0 2) (< c_~q1_back~0 1)) (= c_~q1~0.offset 0) (= c_~s~0 0) (<= c_~q1_front~0 c_~q1_back~0) (or (and .cse10 (= c_~q1_front~0 0) .cse14 .cse11) .cse15) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse18 (select |c_#memory_int| ~q2~0.base))) (let ((.cse17 (select .cse18 (+ ~q2~0.offset .cse7)))) (let ((.cse16 (+ .cse17 1))) (or (< 0 .cse16) (= (+ c_~s~0 .cse17) (+ .cse1 (* (select .cse18 (+ ~q2~0.offset .cse3)) 2) 1)) (< .cse16 (select (select |c_#memory_int| c_~q1~0.base) .cse6))))))) (or .cse8 .cse19 .cse9 (and .cse10 (<= (+ 1 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base|) |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse11 .cse12)) (<= c_~q2_front~0 c_~q2_back~0) (= c_~t~0 0) (or .cse8 (and .cse10 (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse11 .cse12) .cse9) (or .cse8 .cse19 .cse9 .cse13) (or .cse8 (and (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse10 .cse11 .cse12) .cse9) (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) 2) .cse15) .cse20 (or .cse8 (and .cse10 .cse11 .cse12 .cse20) .cse9) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|))))) is different from false [2023-11-10 12:30:07,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:30:09,215 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-11-10 12:30:11,369 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-11-10 12:30:13,521 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-11-10 12:30:38,887 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-11-10 12:30:54,354 INFO L124 PetriNetUnfolderBase]: 11825/24934 cut-off events. [2023-11-10 12:30:54,354 INFO L125 PetriNetUnfolderBase]: For 41297/42252 co-relation queries the response was YES. [2023-11-10 12:30:54,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68937 conditions, 24934 events. 11825/24934 cut-off events. For 41297/42252 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 251689 event pairs, 1357 based on Foata normal form. 691/25153 useless extension candidates. Maximal degree in co-relation 68879. Up to 4022 conditions per place. [2023-11-10 12:30:54,661 INFO L140 encePairwiseOnDemand]: 155/217 looper letters, 1097 selfloop transitions, 831 changer transitions 15/2001 dead transitions. [2023-11-10 12:30:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 2001 transitions, 13519 flow [2023-11-10 12:30:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2023-11-10 12:30:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2023-11-10 12:30:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 12434 transitions. [2023-11-10 12:30:54,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34726993436670855 [2023-11-10 12:30:54,686 INFO L72 ComplementDD]: Start complementDD. Operand 165 states and 12434 transitions. [2023-11-10 12:30:54,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 12434 transitions. [2023-11-10 12:30:54,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:30:54,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 165 states and 12434 transitions. [2023-11-10 12:30:54,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 166 states, 165 states have (on average 75.35757575757576) internal successors, (12434), 165 states have internal predecessors, (12434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:54,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 166 states, 166 states have (on average 217.0) internal successors, (36022), 166 states have internal predecessors, (36022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:54,772 INFO L81 ComplementDD]: Finished complementDD. Result has 166 states, 166 states have (on average 217.0) internal successors, (36022), 166 states have internal predecessors, (36022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:54,772 INFO L175 Difference]: Start difference. First operand has 426 places, 756 transitions, 4021 flow. Second operand 165 states and 12434 transitions. [2023-11-10 12:30:54,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 2001 transitions, 13519 flow [2023-11-10 12:30:55,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 2001 transitions, 13190 flow, removed 34 selfloop flow, removed 24 redundant places. [2023-11-10 12:30:55,109 INFO L231 Difference]: Finished difference. Result has 590 places, 1220 transitions, 10158 flow [2023-11-10 12:30:55,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3293, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=327, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=165, PETRI_FLOW=10158, PETRI_PLACES=590, PETRI_TRANSITIONS=1220} [2023-11-10 12:30:55,110 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 395 predicate places. [2023-11-10 12:30:55,110 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 1220 transitions, 10158 flow [2023-11-10 12:30:55,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 71.95121951219512) internal successors, (5900), 82 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:55,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:30:55,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:30:55,121 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-11-10 12:30:55,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:30:55,321 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-11-10 12:30:55,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:30:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1455743643, now seen corresponding path program 5 times [2023-11-10 12:30:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:30:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597337717] [2023-11-10 12:30:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:30:55,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:30:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:31:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:31:01,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:31:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597337717] [2023-11-10 12:31:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597337717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:31:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943973671] [2023-11-10 12:31:01,380 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:31:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:31:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:31:01,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:31:01,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-10 12:31:01,488 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:31:01,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:31:01,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-10 12:31:01,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:31:01,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11-10 12:31:01,827 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-10 12:31:01,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-10 12:31:03,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:31:03,887 INFO L322 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2023-11-10 12:31:03,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2023-11-10 12:31:04,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-10 12:31:08,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:31:08,541 INFO L322 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-10 12:31:08,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-11-10 12:31:09,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:31:12,952 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 8 treesize of output 1 [2023-11-10 12:31:13,535 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:31:15,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:31:15,821 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 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-10 12:31:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:31:16,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:31:32,780 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:32,781 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 195 treesize of output 135 [2023-11-10 12:31:32,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:32,828 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 11439 treesize of output 11031 [2023-11-10 12:31:33,039 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:33,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2805 treesize of output 2637 [2023-11-10 12:31:33,159 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:33,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2605 treesize of output 2521 [2023-11-10 12:31:33,210 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 1686 treesize of output 1622 [2023-11-10 12:31:33,312 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:33,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2448 treesize of output 2080 [2023-11-10 12:31:49,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:31:49,492 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-10 12:31:49,493 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 25 treesize of output 21 [2023-11-10 12:31:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:31:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943973671] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:31:49,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:31:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42, 43] total 112 [2023-11-10 12:31:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958149618] [2023-11-10 12:31:49,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:31:49,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2023-11-10 12:31:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:31:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2023-11-10 12:31:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=11507, Unknown=49, NotChecked=0, Total=12432 [2023-11-10 12:31:49,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 217 [2023-11-10 12:31:49,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 1220 transitions, 10158 flow. Second operand has 112 states, 112 states have (on average 63.973214285714285) internal successors, (7165), 112 states have internal predecessors, (7165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:49,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:31:49,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 217 [2023-11-10 12:31:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:33:56,893 INFO L124 PetriNetUnfolderBase]: 16558/34825 cut-off events. [2023-11-10 12:33:56,893 INFO L125 PetriNetUnfolderBase]: For 112028/114271 co-relation queries the response was YES. [2023-11-10 12:33:57,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129941 conditions, 34825 events. 16558/34825 cut-off events. For 112028/114271 co-relation queries the response was YES. Maximal size of possible extension queue 1783. Compared 372494 event pairs, 1056 based on Foata normal form. 992/35141 useless extension candidates. Maximal degree in co-relation 129830. Up to 5447 conditions per place. [2023-11-10 12:33:57,693 INFO L140 encePairwiseOnDemand]: 149/217 looper letters, 936 selfloop transitions, 1485 changer transitions 14/2490 dead transitions. [2023-11-10 12:33:57,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 2490 transitions, 24011 flow [2023-11-10 12:33:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-11-10 12:33:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2023-11-10 12:33:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 9825 transitions. [2023-11-10 12:33:57,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3144201228878648 [2023-11-10 12:33:57,706 INFO L72 ComplementDD]: Start complementDD. Operand 144 states and 9825 transitions. [2023-11-10 12:33:57,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 9825 transitions. [2023-11-10 12:33:57,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:33:57,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 144 states and 9825 transitions. [2023-11-10 12:33:57,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 145 states, 144 states have (on average 68.22916666666667) internal successors, (9825), 144 states have internal predecessors, (9825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:33:57,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 145 states, 145 states have (on average 217.0) internal successors, (31465), 145 states have internal predecessors, (31465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:33:57,748 INFO L81 ComplementDD]: Finished complementDD. Result has 145 states, 145 states have (on average 217.0) internal successors, (31465), 145 states have internal predecessors, (31465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:33:57,748 INFO L175 Difference]: Start difference. First operand has 590 places, 1220 transitions, 10158 flow. Second operand 144 states and 9825 transitions. [2023-11-10 12:33:57,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 2490 transitions, 24011 flow [2023-11-10 12:34:00,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 2490 transitions, 23084 flow, removed 383 selfloop flow, removed 68 redundant places. [2023-11-10 12:34:00,419 INFO L231 Difference]: Finished difference. Result has 693 places, 1860 transitions, 19938 flow [2023-11-10 12:34:00,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=9611, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=875, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=144, PETRI_FLOW=19938, PETRI_PLACES=693, PETRI_TRANSITIONS=1860} [2023-11-10 12:34:00,420 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 498 predicate places. [2023-11-10 12:34:00,421 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 1860 transitions, 19938 flow [2023-11-10 12:34:00,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 63.973214285714285) internal successors, (7165), 112 states have internal predecessors, (7165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:34:00,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:34:00,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:34:00,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-10 12:34:00,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-10 12:34:00,623 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-11-10 12:34:00,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:34:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1040780471, now seen corresponding path program 6 times [2023-11-10 12:34:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:34:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174112947] [2023-11-10 12:34:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:34:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:34:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:34:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:34:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:34:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174112947] [2023-11-10 12:34:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174112947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:34:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480458958] [2023-11-10 12:34:06,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:34:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:34:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:34:06,089 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-11-10 12:34:06,092 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-11-10 12:34:06,215 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-10 12:34:06,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:34:06,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-10 12:34:06,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:34:07,867 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 5 treesize of output 3 [2023-11-10 12:34:10,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:34:10,031 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-10 12:34:10,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2023-11-10 12:34:10,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2023-11-10 12:34:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:34:10,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 12:34:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480458958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:34:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 12:34:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [39] total 54 [2023-11-10 12:34:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492464822] [2023-11-10 12:34:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:34:10,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-10 12:34:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:34:10,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-10 12:34:10,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2607, Unknown=0, NotChecked=0, Total=2862 [2023-11-10 12:34:10,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-11-10 12:34:10,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 1860 transitions, 19938 flow. Second operand has 22 states, 22 states have (on average 97.45454545454545) internal successors, (2144), 22 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:34:10,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:34:10,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-11-10 12:34:10,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:34:26,738 INFO L124 PetriNetUnfolderBase]: 16972/36241 cut-off events. [2023-11-10 12:34:26,738 INFO L125 PetriNetUnfolderBase]: For 170082/173292 co-relation queries the response was YES. [2023-11-10 12:34:27,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156536 conditions, 36241 events. 16972/36241 cut-off events. For 170082/173292 co-relation queries the response was YES. Maximal size of possible extension queue 1845. Compared 396302 event pairs, 3882 based on Foata normal form. 220/35639 useless extension candidates. Maximal degree in co-relation 156407. Up to 19645 conditions per place. [2023-11-10 12:34:27,497 INFO L140 encePairwiseOnDemand]: 185/217 looper letters, 1540 selfloop transitions, 343 changer transitions 5/2002 dead transitions. [2023-11-10 12:34:27,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 2002 transitions, 25047 flow [2023-11-10 12:34:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-10 12:34:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-10 12:34:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2624 transitions. [2023-11-10 12:34:27,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46508330379298124 [2023-11-10 12:34:27,500 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2624 transitions. [2023-11-10 12:34:27,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2624 transitions. [2023-11-10 12:34:27,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:34:27,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2624 transitions. [2023-11-10 12:34:27,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 100.92307692307692) internal successors, (2624), 26 states have internal predecessors, (2624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:34:27,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:34:27,508 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:34:27,509 INFO L175 Difference]: Start difference. First operand has 693 places, 1860 transitions, 19938 flow. Second operand 26 states and 2624 transitions. [2023-11-10 12:34:27,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 2002 transitions, 25047 flow [2023-11-10 12:34:33,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 2002 transitions, 24186 flow, removed 312 selfloop flow, removed 57 redundant places. [2023-11-10 12:34:33,194 INFO L231 Difference]: Finished difference. Result has 666 places, 1908 transitions, 20747 flow [2023-11-10 12:34:33,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=19137, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=20747, PETRI_PLACES=666, PETRI_TRANSITIONS=1908} [2023-11-10 12:34:33,195 INFO L281 CegarLoopForPetriNet]: 195 programPoint places, 471 predicate places. [2023-11-10 12:34:33,195 INFO L495 AbstractCegarLoop]: Abstraction has has 666 places, 1908 transitions, 20747 flow [2023-11-10 12:34:33,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 97.45454545454545) internal successors, (2144), 22 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:34:33,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:34:33,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:34:33,201 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-11-10 12:34:33,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:34:33,397 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-11-10 12:34:33,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:34:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash 771723843, now seen corresponding path program 7 times [2023-11-10 12:34:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:34:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651494515] [2023-11-10 12:34:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:34:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:34:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:34:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:34:38,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:34:38,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651494515] [2023-11-10 12:34:38,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651494515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:34:38,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104533949] [2023-11-10 12:34:38,502 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:34:38,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:34:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:34:38,503 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-11-10 12:34:38,504 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-11-10 12:34:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:34:38,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-10 12:34:38,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:34:40,503 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11-10 12:34:41,393 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 23 treesize of output 1 [2023-11-10 12:34:44,523 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-10 12:34:44,523 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 11 treesize of output 11 [2023-11-10 12:34:45,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-10 12:34:48,423 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 8 treesize of output 1 [2023-11-10 12:34:48,928 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 8 treesize of output 1 [2023-11-10 12:34:50,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:34:50,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:34:50,437 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 0 case distinctions, treesize of input 29 treesize of output 27 [2023-11-10 12:34:50,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-10 12:34:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:34:51,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:35:09,141 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-11-10 12:35:09,141 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 2 case distinctions, treesize of input 330 treesize of output 156 [2023-11-10 12:35:09,370 INFO L322 Elim1Store]: treesize reduction 65, result has 55.8 percent of original size [2023-11-10 12:35:09,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19908 treesize of output 18157 [2023-11-10 12:35:09,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:35:09,557 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:35:09,558 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 574 treesize of output 532 [2023-11-10 12:35:09,587 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 218 treesize of output 194 [2023-11-10 12:35:09,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:35:09,680 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:35:09,680 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 534 treesize of output 410 [2023-11-10 12:35:14,135 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:35:14,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 73 [2023-11-10 12:35:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:35:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104533949] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:35:16,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:35:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 43, 42] total 112 [2023-11-10 12:35:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920927480] [2023-11-10 12:35:16,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:35:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2023-11-10 12:35:16,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:35:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2023-11-10 12:35:16,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=11371, Unknown=38, NotChecked=0, Total=12432 [2023-11-10 12:35:16,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 217 [2023-11-10 12:35:16,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 1908 transitions, 20747 flow. Second operand has 112 states, 112 states have (on average 63.9375) internal successors, (7161), 112 states have internal predecessors, (7161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:35:16,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:35:16,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 217 [2023-11-10 12:35:16,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:35:48,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:36:02,932 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 [0, 1] [2023-11-10 12:36:22,790 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-11-10 12:36:25,783 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-11-10 12:36:27,916 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-11-10 12:36:47,815 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 [0, 1] [2023-11-10 12:36:50,988 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-11-10 12:36:53,363 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-11-10 12:36:55,402 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-11-10 12:36:57,971 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-11-10 12:37:00,112 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] Received shutdown request... [2023-11-10 12:37:10,370 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-11-10 12:37:10,370 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-10 12:37:10,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-10 12:37:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-11-10 12:37:10,815 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-10 12:37:10,820 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-11-10 12:37:11,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:37:11,016 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 180 known predicates. [2023-11-10 12:37:11,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-10 12:37:11,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-10 12:37:11,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-10 12:37:11,018 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 1, 1] [2023-11-10 12:37:11,021 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 12:37:11,022 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 12:37:11,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:37:11 BasicIcfg [2023-11-10 12:37:11,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 12:37:11,025 INFO L158 Benchmark]: Toolchain (without parser) took 510963.95ms. Allocated memory was 302.0MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 250.6MB in the beginning and 990.7MB in the end (delta: -740.1MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-11-10 12:37:11,025 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 181.4MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 12:37:11,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.09ms. Allocated memory is still 302.0MB. Free memory was 250.2MB in the beginning and 238.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-10 12:37:11,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.58ms. Allocated memory is still 302.0MB. Free memory was 238.0MB in the beginning and 235.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:37:11,030 INFO L158 Benchmark]: Boogie Preprocessor took 57.75ms. Allocated memory is still 302.0MB. Free memory was 235.5MB in the beginning and 233.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:37:11,030 INFO L158 Benchmark]: RCFGBuilder took 759.02ms. Allocated memory is still 302.0MB. Free memory was 233.8MB in the beginning and 265.0MB in the end (delta: -31.2MB). Peak memory consumption was 35.5MB. Max. memory is 8.0GB. [2023-11-10 12:37:11,030 INFO L158 Benchmark]: TraceAbstraction took 509832.96ms. Allocated memory was 302.0MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 264.5MB in the beginning and 990.7MB in the end (delta: -726.2MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-11-10 12:37:11,032 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.16ms. Allocated memory is still 181.4MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.09ms. Allocated memory is still 302.0MB. Free memory was 250.2MB in the beginning and 238.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.58ms. Allocated memory is still 302.0MB. Free memory was 238.0MB in the beginning and 235.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.75ms. Allocated memory is still 302.0MB. Free memory was 235.5MB in the beginning and 233.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 759.02ms. Allocated memory is still 302.0MB. Free memory was 233.8MB in the beginning and 265.0MB in the end (delta: -31.2MB). Peak memory consumption was 35.5MB. Max. memory is 8.0GB. * TraceAbstraction took 509832.96ms. Allocated memory was 302.0MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 264.5MB in the beginning and 990.7MB in the end (delta: -726.2MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 180 known predicates. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 180 known predicates. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 180 known predicates. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 180 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 231 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: 509.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 365.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 885 mSolverCounterUnknown, 9375 SdHoareTripleChecker+Valid, 131.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9375 mSDsluCounter, 22816 SdHoareTripleChecker+Invalid, 125.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 797 IncrementalHoareTripleChecker+Unchecked, 21981 mSDsCounter, 2052 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42692 IncrementalHoareTripleChecker+Invalid, 46426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2052 mSolverCounterUnsat, 835 mSDtfsCounter, 42692 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2788 GetRequests, 1679 SyntacticMatches, 1 SemanticMatches, 1107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69800 ImplicationChecksByTransitivity, 252.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20747occurred in iteration=11, InterpolantAutomatonStates: 581, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 140.4s InterpolantComputationTime, 3284 NumberOfCodeBlocks, 3236 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3969 ConstructedInterpolants, 301 QuantifiedInterpolants, 114200 SizeOfPredicates, 236 NumberOfNonLiveVariables, 2702 ConjunctsInSsa, 385 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 9/37 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