/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 23:39:06,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 23:39:07,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 23:39:07,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 23:39:07,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 23:39:07,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 23:39:07,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 23:39:07,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 23:39:07,032 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 23:39:07,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 23:39:07,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 23:39:07,033 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 23:39:07,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 23:39:07,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 23:39:07,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 23:39:07,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 23:39:07,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 23:39:07,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 23:39:07,039 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 23:39:07,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 23:39:07,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 23:39:07,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 23:39:07,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 23:39:07,045 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 23:39:07,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 23:39:07,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:39:07,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 23:39:07,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 23:39:07,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 23:39:07,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 23:39:07,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 23:39:07,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 23:39:07,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 23:39:07,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 23:39:07,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 23:39:07,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 23:39:07,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 23:39:07,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 23:39:07,272 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 23:39:07,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-11-29 23:39:08,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 23:39:08,444 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 23:39:08,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-11-29 23:39:08,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cb1a8a7/cc94c1a9cbdf4b5abe0bdd9d78064d23/FLAGdea3e618b [2023-11-29 23:39:08,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cb1a8a7/cc94c1a9cbdf4b5abe0bdd9d78064d23 [2023-11-29 23:39:08,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 23:39:08,464 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 23:39:08,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 23:39:08,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 23:39:08,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 23:39:08,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606ce71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08, skipping insertion in model container [2023-11-29 23:39:08,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,488 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 23:39:08,607 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/unroll-5.wvr.c[2670,2683] [2023-11-29 23:39:08,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:39:08,621 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 23:39:08,638 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/unroll-5.wvr.c[2670,2683] [2023-11-29 23:39:08,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:39:08,651 INFO L206 MainTranslator]: Completed translation [2023-11-29 23:39:08,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08 WrapperNode [2023-11-29 23:39:08,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 23:39:08,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 23:39:08,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 23:39:08,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 23:39:08,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,683 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 169 [2023-11-29 23:39:08,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 23:39:08,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 23:39:08,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 23:39:08,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 23:39:08,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 23:39:08,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 23:39:08,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 23:39:08,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 23:39:08,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (1/1) ... [2023-11-29 23:39:08,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:39:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:08,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 23:39:08,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 23:39:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 23:39:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 23:39:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 23:39:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 23:39:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 23:39:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 23:39:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 23:39:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 23:39:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 23:39:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 23:39:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 23:39:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 23:39:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 23:39:08,785 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 23:39:08,918 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 23:39:08,920 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 23:39:09,156 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 23:39:09,168 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 23:39:09,168 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 23:39:09,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:39:09 BoogieIcfgContainer [2023-11-29 23:39:09,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 23:39:09,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 23:39:09,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 23:39:09,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 23:39:09,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:39:08" (1/3) ... [2023-11-29 23:39:09,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c3ddbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:39:09, skipping insertion in model container [2023-11-29 23:39:09,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:39:08" (2/3) ... [2023-11-29 23:39:09,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c3ddbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:39:09, skipping insertion in model container [2023-11-29 23:39:09,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:39:09" (3/3) ... [2023-11-29 23:39:09,176 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2023-11-29 23:39:09,190 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 23:39:09,191 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 23:39:09,191 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 23:39:09,282 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 23:39:09,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 215 transitions, 444 flow [2023-11-29 23:39:09,401 INFO L124 PetriNetUnfolderBase]: 17/213 cut-off events. [2023-11-29 23:39:09,401 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:39:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 17/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 185 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-11-29 23:39:09,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 215 transitions, 444 flow [2023-11-29 23:39:09,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 204 transitions, 420 flow [2023-11-29 23:39:09,422 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 23:39:09,427 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e769d68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 23:39:09,427 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-29 23:39:09,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 23:39:09,459 INFO L124 PetriNetUnfolderBase]: 13/159 cut-off events. [2023-11-29 23:39:09,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:39:09,459 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:09,460 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:09,460 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:09,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1691187430, now seen corresponding path program 1 times [2023-11-29 23:39:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787875729] [2023-11-29 23:39:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787875729] [2023-11-29 23:39:10,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787875729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:10,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:10,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 23:39:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555501857] [2023-11-29 23:39:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:10,059 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 23:39:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 23:39:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 23:39:10,096 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 215 [2023-11-29 23:39:10,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 204 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 145.625) internal successors, (1165), 8 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:10,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:10,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 215 [2023-11-29 23:39:10,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:10,313 INFO L124 PetriNetUnfolderBase]: 26/337 cut-off events. [2023-11-29 23:39:10,313 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 23:39:10,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 337 events. 26/337 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 783 event pairs, 11 based on Foata normal form. 43/345 useless extension candidates. Maximal degree in co-relation 273. Up to 62 conditions per place. [2023-11-29 23:39:10,321 INFO L140 encePairwiseOnDemand]: 191/215 looper letters, 50 selfloop transitions, 9 changer transitions 5/194 dead transitions. [2023-11-29 23:39:10,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 194 transitions, 528 flow [2023-11-29 23:39:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 23:39:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 23:39:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1200 transitions. [2023-11-29 23:39:10,340 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-29 23:39:10,341 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1200 transitions. [2023-11-29 23:39:10,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1200 transitions. [2023-11-29 23:39:10,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:10,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1200 transitions. [2023-11-29 23:39:10,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:10,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:10,362 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:10,365 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 7 predicate places. [2023-11-29 23:39:10,365 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 528 flow [2023-11-29 23:39:10,366 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 145.625) internal successors, (1165), 8 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:10,366 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:10,367 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:10,367 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 23:39:10,367 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:10,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1537413067, now seen corresponding path program 1 times [2023-11-29 23:39:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880514220] [2023-11-29 23:39:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:10,730 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-29 23:39:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880514220] [2023-11-29 23:39:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880514220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 23:39:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261418215] [2023-11-29 23:39:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:10,733 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 23:39:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 23:39:10,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 23:39:10,737 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 215 [2023-11-29 23:39:10,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:10,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:10,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 215 [2023-11-29 23:39:10,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:11,027 INFO L124 PetriNetUnfolderBase]: 145/922 cut-off events. [2023-11-29 23:39:11,027 INFO L125 PetriNetUnfolderBase]: For 294/299 co-relation queries the response was YES. [2023-11-29 23:39:11,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 922 events. 145/922 cut-off events. For 294/299 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5113 event pairs, 47 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 1195. Up to 162 conditions per place. [2023-11-29 23:39:11,034 INFO L140 encePairwiseOnDemand]: 203/215 looper letters, 83 selfloop transitions, 5 changer transitions 11/234 dead transitions. [2023-11-29 23:39:11,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 234 transitions, 869 flow [2023-11-29 23:39:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 23:39:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 23:39:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1369 transitions. [2023-11-29 23:39:11,038 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7074935400516796 [2023-11-29 23:39:11,038 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1369 transitions. [2023-11-29 23:39:11,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1369 transitions. [2023-11-29 23:39:11,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:11,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1369 transitions. [2023-11-29 23:39:11,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 152.11111111111111) internal successors, (1369), 9 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,046 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,047 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 15 predicate places. [2023-11-29 23:39:11,047 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 234 transitions, 869 flow [2023-11-29 23:39:11,048 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,048 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:11,048 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:11,048 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 23:39:11,049 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:11,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1652916079, now seen corresponding path program 1 times [2023-11-29 23:39:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:11,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062105649] [2023-11-29 23:39:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:11,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062105649] [2023-11-29 23:39:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062105649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:11,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:11,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 23:39:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31595157] [2023-11-29 23:39:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:11,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 23:39:11,246 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2023-11-29 23:39:11,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 234 transitions, 869 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:11,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2023-11-29 23:39:11,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:11,523 INFO L124 PetriNetUnfolderBase]: 274/1440 cut-off events. [2023-11-29 23:39:11,527 INFO L125 PetriNetUnfolderBase]: For 925/953 co-relation queries the response was YES. [2023-11-29 23:39:11,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1440 events. 274/1440 cut-off events. For 925/953 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8970 event pairs, 118 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 2247. Up to 282 conditions per place. [2023-11-29 23:39:11,536 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 33 selfloop transitions, 5 changer transitions 12/247 dead transitions. [2023-11-29 23:39:11,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 247 transitions, 1017 flow [2023-11-29 23:39:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:39:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:39:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 923 transitions. [2023-11-29 23:39:11,539 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8586046511627907 [2023-11-29 23:39:11,539 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 923 transitions. [2023-11-29 23:39:11,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 923 transitions. [2023-11-29 23:39:11,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:11,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 923 transitions. [2023-11-29 23:39:11,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.6) internal successors, (923), 5 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,546 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 19 predicate places. [2023-11-29 23:39:11,546 INFO L500 AbstractCegarLoop]: Abstraction has has 213 places, 247 transitions, 1017 flow [2023-11-29 23:39:11,546 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:11,546 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:11,547 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:11,547 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 23:39:11,547 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:11,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 940049583, now seen corresponding path program 2 times [2023-11-29 23:39:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295797730] [2023-11-29 23:39:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295797730] [2023-11-29 23:39:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295797730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43630923] [2023-11-29 23:39:11,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:39:11,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:11,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:11,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:39:11,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 23:39:11,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:39:11,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:11,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:39:11,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:12,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:12,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43630923] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:12,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 23:39:12,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-11-29 23:39:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712416623] [2023-11-29 23:39:12,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:12,148 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-29 23:39:12,150 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2023-11-29 23:39:12,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 247 transitions, 1017 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:12,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:12,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2023-11-29 23:39:12,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:12,390 INFO L124 PetriNetUnfolderBase]: 273/1501 cut-off events. [2023-11-29 23:39:12,390 INFO L125 PetriNetUnfolderBase]: For 1236/1266 co-relation queries the response was YES. [2023-11-29 23:39:12,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 1501 events. 273/1501 cut-off events. For 1236/1266 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9518 event pairs, 67 based on Foata normal form. 2/1352 useless extension candidates. Maximal degree in co-relation 2077. Up to 284 conditions per place. [2023-11-29 23:39:12,400 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 46 selfloop transitions, 8 changer transitions 14/265 dead transitions. [2023-11-29 23:39:12,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 265 transitions, 1240 flow [2023-11-29 23:39:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:39:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:39:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2023-11-29 23:39:12,403 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8686046511627907 [2023-11-29 23:39:12,404 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2023-11-29 23:39:12,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2023-11-29 23:39:12,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:12,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2023-11-29 23:39:12,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:12,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:12,407 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:12,408 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 22 predicate places. [2023-11-29 23:39:12,408 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 265 transitions, 1240 flow [2023-11-29 23:39:12,409 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:12,409 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:12,409 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:12,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 23:39:12,615 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:12,615 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:12,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1676877739, now seen corresponding path program 3 times [2023-11-29 23:39:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042172066] [2023-11-29 23:39:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042172066] [2023-11-29 23:39:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042172066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310869289] [2023-11-29 23:39:12,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:39:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:12,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:39:12,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 23:39:12,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 23:39:12,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:12,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 23:39:12,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:13,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 23:39:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310869289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 23:39:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-29 23:39:13,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037335883] [2023-11-29 23:39:13,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:13,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:13,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:13,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 23:39:13,123 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2023-11-29 23:39:13,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 265 transitions, 1240 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:13,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2023-11-29 23:39:13,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:13,350 INFO L124 PetriNetUnfolderBase]: 270/1492 cut-off events. [2023-11-29 23:39:13,350 INFO L125 PetriNetUnfolderBase]: For 1706/1748 co-relation queries the response was YES. [2023-11-29 23:39:13,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1492 events. 270/1492 cut-off events. For 1706/1748 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9393 event pairs, 62 based on Foata normal form. 9/1357 useless extension candidates. Maximal degree in co-relation 3013. Up to 285 conditions per place. [2023-11-29 23:39:13,360 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 47 selfloop transitions, 7 changer transitions 14/265 dead transitions. [2023-11-29 23:39:13,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 265 transitions, 1349 flow [2023-11-29 23:39:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:39:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:39:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2023-11-29 23:39:13,366 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8686046511627907 [2023-11-29 23:39:13,366 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2023-11-29 23:39:13,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2023-11-29 23:39:13,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:13,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2023-11-29 23:39:13,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,370 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,371 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 25 predicate places. [2023-11-29 23:39:13,372 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 265 transitions, 1349 flow [2023-11-29 23:39:13,372 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,372 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:13,372 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:13,381 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-29 23:39:13,578 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:13,579 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:13,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 554499434, now seen corresponding path program 1 times [2023-11-29 23:39:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114693480] [2023-11-29 23:39:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114693480] [2023-11-29 23:39:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114693480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 23:39:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059654421] [2023-11-29 23:39:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:13,730 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 23:39:13,731 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2023-11-29 23:39:13,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 265 transitions, 1349 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:13,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2023-11-29 23:39:13,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:13,979 INFO L124 PetriNetUnfolderBase]: 325/1737 cut-off events. [2023-11-29 23:39:13,979 INFO L125 PetriNetUnfolderBase]: For 3091/3474 co-relation queries the response was YES. [2023-11-29 23:39:13,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 1737 events. 325/1737 cut-off events. For 3091/3474 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 11230 event pairs, 111 based on Foata normal form. 28/1579 useless extension candidates. Maximal degree in co-relation 3567. Up to 343 conditions per place. [2023-11-29 23:39:13,991 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 48 selfloop transitions, 7 changer transitions 21/284 dead transitions. [2023-11-29 23:39:13,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 284 transitions, 1642 flow [2023-11-29 23:39:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:39:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:39:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 956 transitions. [2023-11-29 23:39:13,994 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8893023255813953 [2023-11-29 23:39:13,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 956 transitions. [2023-11-29 23:39:13,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 956 transitions. [2023-11-29 23:39:13,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:13,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 956 transitions. [2023-11-29 23:39:13,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 191.2) internal successors, (956), 5 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:13,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,000 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 29 predicate places. [2023-11-29 23:39:14,000 INFO L500 AbstractCegarLoop]: Abstraction has has 223 places, 284 transitions, 1642 flow [2023-11-29 23:39:14,002 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,002 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:14,002 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:14,002 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 23:39:14,002 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:14,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash -7673596, now seen corresponding path program 2 times [2023-11-29 23:39:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257158616] [2023-11-29 23:39:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257158616] [2023-11-29 23:39:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257158616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:14,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 23:39:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492147933] [2023-11-29 23:39:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:14,179 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:39:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:39:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:39:14,180 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 215 [2023-11-29 23:39:14,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 284 transitions, 1642 flow. Second operand has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:14,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 215 [2023-11-29 23:39:14,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:14,503 INFO L124 PetriNetUnfolderBase]: 387/2030 cut-off events. [2023-11-29 23:39:14,503 INFO L125 PetriNetUnfolderBase]: For 4139/4482 co-relation queries the response was YES. [2023-11-29 23:39:14,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 2030 events. 387/2030 cut-off events. For 4139/4482 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13617 event pairs, 163 based on Foata normal form. 18/1856 useless extension candidates. Maximal degree in co-relation 4225. Up to 359 conditions per place. [2023-11-29 23:39:14,517 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 83 selfloop transitions, 10 changer transitions 28/315 dead transitions. [2023-11-29 23:39:14,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 315 transitions, 2139 flow [2023-11-29 23:39:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:39:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:39:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 935 transitions. [2023-11-29 23:39:14,520 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8697674418604651 [2023-11-29 23:39:14,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 935 transitions. [2023-11-29 23:39:14,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 935 transitions. [2023-11-29 23:39:14,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:14,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 935 transitions. [2023-11-29 23:39:14,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,525 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,525 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 33 predicate places. [2023-11-29 23:39:14,526 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 315 transitions, 2139 flow [2023-11-29 23:39:14,526 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:14,526 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:14,526 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:14,526 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 23:39:14,527 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:14,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash -920711194, now seen corresponding path program 3 times [2023-11-29 23:39:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616226587] [2023-11-29 23:39:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616226587] [2023-11-29 23:39:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616226587] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:14,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201044910] [2023-11-29 23:39:14,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:39:14,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:14,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:39:14,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 23:39:14,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 23:39:14,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:14,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 23:39:14,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:15,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 23:39:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201044910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 23:39:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 23:39:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763553738] [2023-11-29 23:39:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:15,215 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 23:39:15,217 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2023-11-29 23:39:15,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 315 transitions, 2139 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:15,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:15,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2023-11-29 23:39:15,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:15,474 INFO L124 PetriNetUnfolderBase]: 401/2082 cut-off events. [2023-11-29 23:39:15,475 INFO L125 PetriNetUnfolderBase]: For 5222/5513 co-relation queries the response was YES. [2023-11-29 23:39:15,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 2082 events. 401/2082 cut-off events. For 5222/5513 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 14066 event pairs, 131 based on Foata normal form. 17/1907 useless extension candidates. Maximal degree in co-relation 5359. Up to 384 conditions per place. [2023-11-29 23:39:15,489 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 55 selfloop transitions, 13 changer transitions 28/320 dead transitions. [2023-11-29 23:39:15,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 320 transitions, 2371 flow [2023-11-29 23:39:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:39:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:39:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2023-11-29 23:39:15,492 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8976744186046511 [2023-11-29 23:39:15,492 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2023-11-29 23:39:15,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2023-11-29 23:39:15,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:15,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2023-11-29 23:39:15,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:15,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:15,495 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:15,496 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 36 predicate places. [2023-11-29 23:39:15,497 INFO L500 AbstractCegarLoop]: Abstraction has has 230 places, 320 transitions, 2371 flow [2023-11-29 23:39:15,497 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:15,497 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:15,497 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:15,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 23:39:15,703 WARN L482 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-29 23:39:15,703 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:15,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1390922564, now seen corresponding path program 4 times [2023-11-29 23:39:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076276469] [2023-11-29 23:39:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:15,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076276469] [2023-11-29 23:39:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076276469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:15,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:15,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 23:39:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436822097] [2023-11-29 23:39:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:15,847 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:39:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:15,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:39:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:39:15,849 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 215 [2023-11-29 23:39:15,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 320 transitions, 2371 flow. Second operand has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:15,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:15,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 215 [2023-11-29 23:39:15,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:16,132 INFO L124 PetriNetUnfolderBase]: 413/2111 cut-off events. [2023-11-29 23:39:16,133 INFO L125 PetriNetUnfolderBase]: For 6772/7265 co-relation queries the response was YES. [2023-11-29 23:39:16,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 2111 events. 413/2111 cut-off events. For 6772/7265 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 14318 event pairs, 154 based on Foata normal form. 15/1929 useless extension candidates. Maximal degree in co-relation 5097. Up to 457 conditions per place. [2023-11-29 23:39:16,148 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 89 selfloop transitions, 18 changer transitions 28/329 dead transitions. [2023-11-29 23:39:16,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 329 transitions, 2665 flow [2023-11-29 23:39:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:39:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:39:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 924 transitions. [2023-11-29 23:39:16,151 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8595348837209302 [2023-11-29 23:39:16,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 924 transitions. [2023-11-29 23:39:16,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 924 transitions. [2023-11-29 23:39:16,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:16,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 924 transitions. [2023-11-29 23:39:16,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:16,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:16,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:16,156 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 40 predicate places. [2023-11-29 23:39:16,156 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 329 transitions, 2665 flow [2023-11-29 23:39:16,157 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:16,157 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:16,157 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:16,157 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 23:39:16,157 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:16,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash 68237290, now seen corresponding path program 5 times [2023-11-29 23:39:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:16,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460742277] [2023-11-29 23:39:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:16,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460742277] [2023-11-29 23:39:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460742277] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374816959] [2023-11-29 23:39:16,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 23:39:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:16,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:39:16,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 23:39:16,499 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:39:16,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:16,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:39:16,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:16,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374816959] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:16,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 23:39:16,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-11-29 23:39:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973350510] [2023-11-29 23:39:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:16,821 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-29 23:39:16,823 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2023-11-29 23:39:16,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 329 transitions, 2665 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:16,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:16,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2023-11-29 23:39:16,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:17,088 INFO L124 PetriNetUnfolderBase]: 391/2054 cut-off events. [2023-11-29 23:39:17,089 INFO L125 PetriNetUnfolderBase]: For 6439/7040 co-relation queries the response was YES. [2023-11-29 23:39:17,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6523 conditions, 2054 events. 391/2054 cut-off events. For 6439/7040 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13124 event pairs, 129 based on Foata normal form. 21/1895 useless extension candidates. Maximal degree in co-relation 5480. Up to 419 conditions per place. [2023-11-29 23:39:17,104 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 55 selfloop transitions, 25 changer transitions 27/327 dead transitions. [2023-11-29 23:39:17,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 327 transitions, 2879 flow [2023-11-29 23:39:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:39:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:39:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 771 transitions. [2023-11-29 23:39:17,107 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8965116279069767 [2023-11-29 23:39:17,107 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 771 transitions. [2023-11-29 23:39:17,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 771 transitions. [2023-11-29 23:39:17,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:17,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 771 transitions. [2023-11-29 23:39:17,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:17,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:17,111 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:17,111 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 42 predicate places. [2023-11-29 23:39:17,111 INFO L500 AbstractCegarLoop]: Abstraction has has 236 places, 327 transitions, 2879 flow [2023-11-29 23:39:17,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:17,112 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:17,112 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:17,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-29 23:39:17,318 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:17,318 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:17,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1869088246, now seen corresponding path program 1 times [2023-11-29 23:39:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:17,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460128995] [2023-11-29 23:39:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:17,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460128995] [2023-11-29 23:39:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460128995] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667921664] [2023-11-29 23:39:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:17,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:39:17,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 23:39:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:17,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 23:39:17,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:18,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 23:39:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:18,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:19,626 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:39:19,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 23:39:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667921664] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:39:20,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:39:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2023-11-29 23:39:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754705606] [2023-11-29 23:39:20,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:39:20,466 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 23:39:20,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:20,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 23:39:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 23:39:20,471 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215 [2023-11-29 23:39:20,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 327 transitions, 2879 flow. Second operand has 41 states, 41 states have (on average 75.17073170731707) internal successors, (3082), 41 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:20,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:20,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215 [2023-11-29 23:39:20,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:37,627 INFO L124 PetriNetUnfolderBase]: 14269/29803 cut-off events. [2023-11-29 23:39:37,627 INFO L125 PetriNetUnfolderBase]: For 111301/112016 co-relation queries the response was YES. [2023-11-29 23:39:37,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104460 conditions, 29803 events. 14269/29803 cut-off events. For 111301/112016 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 251302 event pairs, 673 based on Foata normal form. 68/27883 useless extension candidates. Maximal degree in co-relation 86586. Up to 5573 conditions per place. [2023-11-29 23:39:37,830 INFO L140 encePairwiseOnDemand]: 132/215 looper letters, 1194 selfloop transitions, 398 changer transitions 883/2554 dead transitions. [2023-11-29 23:39:37,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 2554 transitions, 19551 flow [2023-11-29 23:39:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2023-11-29 23:39:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2023-11-29 23:39:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 15533 transitions. [2023-11-29 23:39:37,866 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.36488137185811603 [2023-11-29 23:39:37,866 INFO L72 ComplementDD]: Start complementDD. Operand 198 states and 15533 transitions. [2023-11-29 23:39:37,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 15533 transitions. [2023-11-29 23:39:37,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:37,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 198 states and 15533 transitions. [2023-11-29 23:39:37,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 199 states, 198 states have (on average 78.44949494949495) internal successors, (15533), 198 states have internal predecessors, (15533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:37,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 199 states, 199 states have (on average 215.0) internal successors, (42785), 199 states have internal predecessors, (42785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:37,989 INFO L81 ComplementDD]: Finished complementDD. Result has 199 states, 199 states have (on average 215.0) internal successors, (42785), 199 states have internal predecessors, (42785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:37,989 INFO L307 CegarLoopForPetriNet]: 194 programPoint places, 239 predicate places. [2023-11-29 23:39:37,990 INFO L500 AbstractCegarLoop]: Abstraction has has 433 places, 2554 transitions, 19551 flow [2023-11-29 23:39:37,990 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 75.17073170731707) internal successors, (3082), 41 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:37,990 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:37,991 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:38,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 23:39:38,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 23:39:38,203 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:38,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 325197408, now seen corresponding path program 2 times [2023-11-29 23:39:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144658978] [2023-11-29 23:39:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144658978] [2023-11-29 23:39:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144658978] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755120493] [2023-11-29 23:39:50,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:39:50,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:50,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:50,988 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-29 23:39:50,992 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-29 23:39:51,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:39:51,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:51,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 23:39:51,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:52,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 23:39:52,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 23:39:52,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 23:39:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:54,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:56,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (v_~x2~0_33 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* v_~x2~0_33 4))) (select .cse1 (+ (* (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset)) 4) c_~f~0.offset))) (< c_~size~0 (+ .cse0 1)) (< v_~x2~0_33 0) (< c_~size~0 (+ v_~x2~0_33 1)))))) is different from false [2023-11-29 23:39:56,378 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (v_~x2~0_33 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (< c_~size~0 (+ .cse0 1)) (= (select .cse1 (+ (* 4 (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset))) c_~f~0.offset)) (select .cse1 (+ c_~f~0.offset (* v_~x2~0_33 4)))) (< .cse0 0) (< v_~x2~0_33 0) (< c_~size~0 (+ v_~x2~0_33 1)))))) is different from false [2023-11-29 23:39:56,530 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (v_~x2~0_33 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) |c_ULTIMATE.start_main_#t~ret15#1.base|))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|)))) (or (< .cse0 0) (< c_~size~0 (+ .cse0 1)) (= (select .cse1 (+ (* (select .cse1 (+ (* c_~x1~0 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|)) (select .cse1 (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| (* v_~x2~0_33 4)))) (< v_~x2~0_33 0) (< c_~size~0 (+ v_~x2~0_33 1)))))) is different from false [2023-11-29 23:39:57,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:39:57,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2023-11-29 23:39:57,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:39:57,394 INFO L378 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 544 [2023-11-29 23:39:57,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:39:57,455 INFO L378 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 152 [2023-11-29 23:39:57,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:39:57,522 INFO L378 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 149 [2023-11-29 23:39:59,390 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-29 23:39:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 23:39:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755120493] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:39:59,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:39:59,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 31] total 81 [2023-11-29 23:39:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832476246] [2023-11-29 23:39:59,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:39:59,935 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-11-29 23:39:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:59,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-11-29 23:39:59,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=5531, Unknown=24, NotChecked=462, Total=6480 [2023-11-29 23:39:59,940 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 215 [2023-11-29 23:39:59,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 2554 transitions, 19551 flow. Second operand has 81 states, 81 states have (on average 48.358024691358025) internal successors, (3917), 81 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:59,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:59,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 215 [2023-11-29 23:39:59,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:40:23,230 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-29 23:40:26,025 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-29 23:40:28,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:37,980 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-29 23:40:48,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:58,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:15,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:41:31,508 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 [] [2023-11-29 23:41:35,608 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-29 23:41:39,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:42,053 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-29 23:41:51,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:41:56,946 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 [] [2023-11-29 23:41:58,999 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 [] [2023-11-29 23:42:11,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:42:27,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 23:42:49,644 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 [] [2023-11-29 23:42:54,162 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 [] [2023-11-29 23:42:56,204 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 [] [2023-11-29 23:42:58,271 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 [] [2023-11-29 23:43:08,820 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 [] [2023-11-29 23:43:11,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:43:13,447 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-29 23:43:20,536 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-29 23:43:24,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:43:26,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:43:46,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:43:57,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:43:59,441 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 [] [2023-11-29 23:44:05,064 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 [] [2023-11-29 23:44:07,088 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 [] [2023-11-29 23:44:08,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:44:10,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:44:12,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:44:15,412 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 [] [2023-11-29 23:44:38,178 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-29 23:44:51,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:44:53,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:45:00,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:45:02,762 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 [] [2023-11-29 23:45:07,903 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 [] [2023-11-29 23:45:10,140 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 [] [2023-11-29 23:45:12,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:45:15,033 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-29 23:45:17,116 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-29 23:45:21,142 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-29 23:45:22,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:45:24,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:45:39,685 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-29 23:45:41,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:45:53,083 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 [] [2023-11-29 23:45:54,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:46:01,746 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 [] [2023-11-29 23:46:04,115 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 [] [2023-11-29 23:46:06,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:46:08,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:46:10,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:46:20,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:46:39,443 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-29 23:46:41,467 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-29 23:46:43,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:46:49,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:46:52,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:47:12,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:47:26,271 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 [] [2023-11-29 23:47:28,295 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 [] [2023-11-29 23:47:30,424 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 [] [2023-11-29 23:47:32,470 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 [] [2023-11-29 23:47:34,494 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 [] [2023-11-29 23:47:40,069 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 [] [2023-11-29 23:47:41,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:47:51,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:47:53,432 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 [] [2023-11-29 23:47:55,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:47:59,532 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-29 23:48:08,207 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-29 23:48:10,240 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-29 23:48:12,293 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-29 23:48:24,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:48:27,818 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-29 23:48:30,713 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-29 23:48:41,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:48:43,649 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 [] [2023-11-29 23:49:04,124 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 [] [2023-11-29 23:49:15,058 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-29 23:49:36,142 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-29 23:49:51,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 [] [2023-11-29 23:50:19,045 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-29 23:50:22,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:50:26,834 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 [] [2023-11-29 23:50:46,261 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-29 23:51:04,558 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-29 23:51:21,630 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 [] [2023-11-29 23:51:24,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:51:26,076 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 [] [2023-11-29 23:51:28,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:51:47,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 23:51:49,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 23:51:51,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 23:52:04,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:52:08,172 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-29 23:52:10,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:52:12,293 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-29 23:52:30,185 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 [] [2023-11-29 23:52:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:52:56,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 23:52:58,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-11-29 23:53:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2023-11-29 23:53:28,448 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-29 23:53:28,455 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-29 23:53:28,493 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:53:28,493 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-29 23:53:28,648 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:53:28,649 WARN L624 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 464 known predicates. [2023-11-29 23:53:28,650 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-29 23:53:28,650 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-29 23:53:28,650 INFO L457 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1] [2023-11-29 23:53:28,652 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 23:53:28,652 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 23:53:28,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:53:28 BasicIcfg [2023-11-29 23:53:28,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 23:53:28,656 INFO L158 Benchmark]: Toolchain (without parser) took 860191.52ms. Allocated memory was 583.0MB in the beginning and 2.0GB in the end (delta: 1.4GB). Free memory was 535.3MB in the beginning and 666.1MB in the end (delta: -130.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-11-29 23:53:28,656 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory was 313.0MB in the beginning and 312.9MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:53:28,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.96ms. Allocated memory is still 583.0MB. Free memory was 534.9MB in the beginning and 523.0MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-29 23:53:28,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.84ms. Allocated memory is still 583.0MB. Free memory was 523.0MB in the beginning and 520.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:53:28,656 INFO L158 Benchmark]: Boogie Preprocessor took 26.60ms. Allocated memory is still 583.0MB. Free memory was 520.9MB in the beginning and 519.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:53:28,657 INFO L158 Benchmark]: RCFGBuilder took 458.08ms. Allocated memory is still 583.0MB. Free memory was 519.2MB in the beginning and 499.9MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-29 23:53:28,657 INFO L158 Benchmark]: TraceAbstraction took 859484.08ms. Allocated memory was 583.0MB in the beginning and 2.0GB in the end (delta: 1.4GB). Free memory was 499.3MB in the beginning and 666.1MB in the end (delta: -166.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-11-29 23:53:28,658 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.12ms. Allocated memory is still 367.0MB. Free memory was 313.0MB in the beginning and 312.9MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 186.96ms. Allocated memory is still 583.0MB. Free memory was 534.9MB in the beginning and 523.0MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.84ms. Allocated memory is still 583.0MB. Free memory was 523.0MB in the beginning and 520.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.60ms. Allocated memory is still 583.0MB. Free memory was 520.9MB in the beginning and 519.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 458.08ms. Allocated memory is still 583.0MB. Free memory was 519.2MB in the beginning and 499.9MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 859484.08ms. Allocated memory was 583.0MB in the beginning and 2.0GB in the end (delta: 1.4GB). Free memory was 499.3MB in the beginning and 666.1MB in the end (delta: -166.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 464 known predicates. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 464 known predicates. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 464 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 291 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 859.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 828.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 84 mSolverCounterUnknown, 9316 SdHoareTripleChecker+Valid, 304.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9316 mSDsluCounter, 15233 SdHoareTripleChecker+Invalid, 299.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6262 IncrementalHoareTripleChecker+Unchecked, 14466 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21971 IncrementalHoareTripleChecker+Invalid, 28709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 767 mSDtfsCounter, 21971 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2278 GetRequests, 1516 SyntacticMatches, 16 SemanticMatches, 745 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 105358 ImplicationChecksByTransitivity, 529.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19551occurred in iteration=11, InterpolantAutomatonStates: 251, 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, 0.8s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 2696 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3329 ConstructedInterpolants, 153 QuantifiedInterpolants, 29345 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 28/89 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