/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:41:59,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:41:59,580 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-SemanticLbe.epf [2023-11-17 15:41:59,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:41:59,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:41:59,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:41:59,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:41:59,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:41:59,613 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:41:59,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:41:59,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:41:59,616 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:41:59,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:41:59,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:41:59,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:41:59,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:41:59,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:41:59,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:41:59,618 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:41:59,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:41:59,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:41:59,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:41:59,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:41:59,619 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:41:59,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:41:59,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:41:59,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:41:59,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:41:59,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:41:59,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:41:59,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:41:59,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:41:59,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:41:59,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:41:59,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:41:59,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:41:59,785 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:41:59,786 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:41:59,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-11-17 15:42:00,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:42:00,921 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:42:00,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-11-17 15:42:00,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a539295/f3091e0966a34198af625116c16a4b49/FLAGb0a6ed992 [2023-11-17 15:42:00,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a539295/f3091e0966a34198af625116c16a4b49 [2023-11-17 15:42:00,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:42:00,938 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:42:00,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:42:00,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:42:00,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:42:00,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:42:00" (1/1) ... [2023-11-17 15:42:00,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350fa42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:00, skipping insertion in model container [2023-11-17 15:42:00,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:42:00" (1/1) ... [2023-11-17 15:42:00,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:42:01,090 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/bench-exp1x3.wvr.c[1875,1888] [2023-11-17 15:42:01,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:42:01,102 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:42:01,118 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/bench-exp1x3.wvr.c[1875,1888] [2023-11-17 15:42:01,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:42:01,134 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:42:01,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01 WrapperNode [2023-11-17 15:42:01,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:42:01,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:42:01,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:42:01,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:42:01,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,155 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2023-11-17 15:42:01,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:42:01,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:42:01,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:42:01,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:42:01,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:42:01,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:42:01,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:42:01,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:42:01,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (1/1) ... [2023-11-17 15:42:01,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:42:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:42:01,198 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-17 15:42:01,208 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-17 15:42:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:42:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 15:42:01,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 15:42:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 15:42:01,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 15:42:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:42:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:42:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:42:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:42:01,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:42:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:42:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:42:01,219 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:42:01,315 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:42:01,317 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:42:01,483 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:42:01,491 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:42:01,491 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 15:42:01,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:42:01 BoogieIcfgContainer [2023-11-17 15:42:01,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:42:01,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:42:01,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:42:01,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:42:01,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:42:00" (1/3) ... [2023-11-17 15:42:01,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cd8dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:42:01, skipping insertion in model container [2023-11-17 15:42:01,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:42:01" (2/3) ... [2023-11-17 15:42:01,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cd8dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:42:01, skipping insertion in model container [2023-11-17 15:42:01,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:42:01" (3/3) ... [2023-11-17 15:42:01,498 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-11-17 15:42:01,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:42:01,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 15:42:01,509 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:42:01,567 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 15:42:01,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 178 flow [2023-11-17 15:42:01,623 INFO L124 PetriNetUnfolderBase]: 6/80 cut-off events. [2023-11-17 15:42:01,623 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:42:01,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 6/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-11-17 15:42:01,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 178 flow [2023-11-17 15:42:01,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 71 transitions, 154 flow [2023-11-17 15:42:01,631 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:42:01,640 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 71 transitions, 154 flow [2023-11-17 15:42:01,642 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 71 transitions, 154 flow [2023-11-17 15:42:01,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 71 transitions, 154 flow [2023-11-17 15:42:01,658 INFO L124 PetriNetUnfolderBase]: 6/71 cut-off events. [2023-11-17 15:42:01,658 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:42:01,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 71 events. 6/71 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-11-17 15:42:01,664 INFO L119 LiptonReduction]: Number of co-enabled transitions 308 [2023-11-17 15:42:03,159 INFO L134 LiptonReduction]: Checked pairs total: 360 [2023-11-17 15:42:03,160 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-11-17 15:42:03,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:42:03,176 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b02af78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:42:03,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 15:42:03,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:42:03,179 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-11-17 15:42:03,180 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:42:03,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:42:03,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:42:03,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:42:03,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:42:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash 953603441, now seen corresponding path program 1 times [2023-11-17 15:42:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:42:03,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842455803] [2023-11-17 15:42:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:42:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:03,391 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-17 15:42:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:42:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842455803] [2023-11-17 15:42:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842455803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:42:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:42:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:42:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117112986] [2023-11-17 15:42:03,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:42:03,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:42:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:42:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:42:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:42:03,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 150 [2023-11-17 15:42:03,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-17 15:42:03,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:42:03,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 150 [2023-11-17 15:42:03,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:42:03,460 INFO L124 PetriNetUnfolderBase]: 65/114 cut-off events. [2023-11-17 15:42:03,461 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-17 15:42:03,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 114 events. 65/114 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2023-11-17 15:42:03,464 INFO L140 encePairwiseOnDemand]: 146/150 looper letters, 19 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2023-11-17 15:42:03,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2023-11-17 15:42:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:42:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:42:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2023-11-17 15:42:03,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2023-11-17 15:42:03,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 207 transitions. [2023-11-17 15:42:03,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 207 transitions. [2023-11-17 15:42:03,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:42:03,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 207 transitions. [2023-11-17 15:42:03,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-17 15:42:03,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 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-17 15:42:03,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 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-17 15:42:03,490 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 207 transitions. [2023-11-17 15:42:03,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2023-11-17 15:42:03,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:42:03,494 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2023-11-17 15:42:03,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2023-11-17 15:42:03,499 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2023-11-17 15:42:03,499 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2023-11-17 15:42:03,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-17 15:42:03,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:42:03,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:42:03,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:42:03,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:42:03,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:42:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -971508643, now seen corresponding path program 1 times [2023-11-17 15:42:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:42:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141381080] [2023-11-17 15:42:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:42:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:42:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141381080] [2023-11-17 15:42:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141381080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:42:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:42:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:42:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129190925] [2023-11-17 15:42:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:42:03,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:42:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:42:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:42:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:42:03,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:42:03,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-17 15:42:03,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:42:03,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:42:03,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:42:03,766 INFO L124 PetriNetUnfolderBase]: 63/111 cut-off events. [2023-11-17 15:42:03,766 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-17 15:42:03,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 111 events. 63/111 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 278 event pairs, 2 based on Foata normal form. 2/113 useless extension candidates. Maximal degree in co-relation 72. Up to 45 conditions per place. [2023-11-17 15:42:03,769 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 24 selfloop transitions, 6 changer transitions 4/36 dead transitions. [2023-11-17 15:42:03,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 36 transitions, 169 flow [2023-11-17 15:42:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:42:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:42:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 330 transitions. [2023-11-17 15:42:03,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-11-17 15:42:03,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 330 transitions. [2023-11-17 15:42:03,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 330 transitions. [2023-11-17 15:42:03,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:42:03,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 330 transitions. [2023-11-17 15:42:03,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-17 15:42:03,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:03,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:03,779 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 5 states and 330 transitions. [2023-11-17 15:42:03,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 36 transitions, 169 flow [2023-11-17 15:42:03,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 36 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:42:03,780 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 74 flow [2023-11-17 15:42:03,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2023-11-17 15:42:03,781 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-11-17 15:42:03,781 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 74 flow [2023-11-17 15:42:03,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-17 15:42:03,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:42:03,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:42:03,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:42:03,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:42:03,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:42:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1905740451, now seen corresponding path program 1 times [2023-11-17 15:42:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:42:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715765144] [2023-11-17 15:42:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:42:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:42:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715765144] [2023-11-17 15:42:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715765144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:42:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:42:03,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:42:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585163371] [2023-11-17 15:42:03,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:42:03,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:42:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:42:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:42:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:42:03,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:42:03,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-17 15:42:03,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:42:03,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:42:03,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:42:03,914 INFO L124 PetriNetUnfolderBase]: 56/102 cut-off events. [2023-11-17 15:42:03,914 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-17 15:42:03,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 102 events. 56/102 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 255 event pairs, 2 based on Foata normal form. 4/106 useless extension candidates. Maximal degree in co-relation 79. Up to 50 conditions per place. [2023-11-17 15:42:03,916 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 19 selfloop transitions, 4 changer transitions 8/33 dead transitions. [2023-11-17 15:42:03,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 33 transitions, 171 flow [2023-11-17 15:42:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:42:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:42:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2023-11-17 15:42:03,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436 [2023-11-17 15:42:03,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 327 transitions. [2023-11-17 15:42:03,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 327 transitions. [2023-11-17 15:42:03,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:42:03,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 327 transitions. [2023-11-17 15:42:03,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-17 15:42:03,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:03,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:03,920 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 74 flow. Second operand 5 states and 327 transitions. [2023-11-17 15:42:03,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 33 transitions, 171 flow [2023-11-17 15:42:03,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:42:03,922 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 68 flow [2023-11-17 15:42:03,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-11-17 15:42:03,923 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2023-11-17 15:42:03,923 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 68 flow [2023-11-17 15:42:03,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-17 15:42:03,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:42:03,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:42:03,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:42:03,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:42:03,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:42:03,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1024316319, now seen corresponding path program 2 times [2023-11-17 15:42:03,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:42:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292612525] [2023-11-17 15:42:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:42:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:04,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:42:04,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292612525] [2023-11-17 15:42:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292612525] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:42:04,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733380341] [2023-11-17 15:42:04,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 15:42:04,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:42:04,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:42:04,013 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-17 15:42:04,020 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-17 15:42:04,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:42:04,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:42:04,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 15:42:04,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:42:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:04,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:42:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733380341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:42:04,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:42:04,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 15:42:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534852020] [2023-11-17 15:42:04,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:42:04,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:42:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:42:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:42:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:42:04,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:42:04,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-17 15:42:04,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:42:04,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:42:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:42:04,357 INFO L124 PetriNetUnfolderBase]: 44/79 cut-off events. [2023-11-17 15:42:04,357 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-17 15:42:04,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 79 events. 44/79 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 4 based on Foata normal form. 6/85 useless extension candidates. Maximal degree in co-relation 71. Up to 53 conditions per place. [2023-11-17 15:42:04,358 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 22 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-11-17 15:42:04,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2023-11-17 15:42:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:42:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:42:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2023-11-17 15:42:04,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2023-11-17 15:42:04,360 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 325 transitions. [2023-11-17 15:42:04,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 325 transitions. [2023-11-17 15:42:04,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:42:04,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 325 transitions. [2023-11-17 15:42:04,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-17 15:42:04,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:04,362 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:04,362 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 68 flow. Second operand 5 states and 325 transitions. [2023-11-17 15:42:04,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2023-11-17 15:42:04,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 151 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:42:04,363 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 95 flow [2023-11-17 15:42:04,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-17 15:42:04,364 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2023-11-17 15:42:04,364 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 95 flow [2023-11-17 15:42:04,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-17 15:42:04,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:42:04,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:42:04,372 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-17 15:42:04,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:42:04,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:42:04,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:42:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1679704371, now seen corresponding path program 2 times [2023-11-17 15:42:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:42:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790630852] [2023-11-17 15:42:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:42:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:04,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:42:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790630852] [2023-11-17 15:42:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790630852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:42:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150749316] [2023-11-17 15:42:04,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 15:42:04,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:42:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:42:04,620 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-17 15:42:04,626 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-17 15:42:04,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:42:04,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:42:04,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 15:42:04,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:42:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:04,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:42:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150749316] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:42:04,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:42:04,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 15:42:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997279123] [2023-11-17 15:42:04,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:42:04,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:42:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:42:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:42:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:42:04,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:42:04,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 62.333333333333336) internal successors, (374), 6 states have internal predecessors, (374), 0 states have call successors, (0), 0 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-17 15:42:04,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:42:04,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:42:04,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:42:04,817 INFO L124 PetriNetUnfolderBase]: 40/75 cut-off events. [2023-11-17 15:42:04,817 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-17 15:42:04,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 75 events. 40/75 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 4 based on Foata normal form. 4/79 useless extension candidates. Maximal degree in co-relation 121. Up to 61 conditions per place. [2023-11-17 15:42:04,818 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 21 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-11-17 15:42:04,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 182 flow [2023-11-17 15:42:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:42:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:42:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2023-11-17 15:42:04,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428 [2023-11-17 15:42:04,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 321 transitions. [2023-11-17 15:42:04,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 321 transitions. [2023-11-17 15:42:04,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:42:04,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 321 transitions. [2023-11-17 15:42:04,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 64.2) internal successors, (321), 5 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-17 15:42:04,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:04,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-17 15:42:04,821 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 95 flow. Second operand 5 states and 321 transitions. [2023-11-17 15:42:04,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 182 flow [2023-11-17 15:42:04,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 177 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 15:42:04,824 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 131 flow [2023-11-17 15:42:04,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 15:42:04,825 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2023-11-17 15:42:04,826 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 131 flow [2023-11-17 15:42:04,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.333333333333336) internal successors, (374), 6 states have internal predecessors, (374), 0 states have call successors, (0), 0 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-17 15:42:04,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:42:04,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:42:04,833 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-17 15:42:05,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:42:05,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:42:05,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:42:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1793880585, now seen corresponding path program 1 times [2023-11-17 15:42:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:42:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897159876] [2023-11-17 15:42:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:42:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:42:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897159876] [2023-11-17 15:42:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897159876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:42:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964384009] [2023-11-17 15:42:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:42:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:42:05,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:42:05,475 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-17 15:42:05,498 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-17 15:42:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:42:05,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 15:42:05,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:42:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:45,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:42:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:42:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964384009] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:42:57,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:42:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2023-11-17 15:42:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918868939] [2023-11-17 15:42:57,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:42:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 15:42:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:42:57,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 15:42:57,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=167, Unknown=12, NotChecked=0, Total=240 [2023-11-17 15:42:57,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:42:57,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 131 flow. Second operand has 16 states, 16 states have (on average 60.9375) internal successors, (975), 16 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-17 15:42:57,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:42:57,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:42:57,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:10,071 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 15:43:12,110 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-17 15:43:13,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:43:19,249 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-17 15:43:21,698 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-17 15:43:23,798 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-17 15:43:26,227 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-17 15:43:28,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:43:30,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:43:32,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:43:34,263 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-17 15:43:37,261 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-17 15:43:39,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:43:48,769 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-17 15:43:52,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:43:58,251 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-17 15:44:00,261 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-17 15:44:02,603 INFO L124 PetriNetUnfolderBase]: 95/183 cut-off events. [2023-11-17 15:44:02,603 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2023-11-17 15:44:02,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 183 events. 95/183 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 589 event pairs, 4 based on Foata normal form. 7/190 useless extension candidates. Maximal degree in co-relation 478. Up to 63 conditions per place. [2023-11-17 15:44:02,604 INFO L140 encePairwiseOnDemand]: 143/150 looper letters, 48 selfloop transitions, 19 changer transitions 20/89 dead transitions. [2023-11-17 15:44:02,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 598 flow [2023-11-17 15:44:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 15:44:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 15:44:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 972 transitions. [2023-11-17 15:44:02,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432 [2023-11-17 15:44:02,616 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 972 transitions. [2023-11-17 15:44:02,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 972 transitions. [2023-11-17 15:44:02,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:44:02,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 972 transitions. [2023-11-17 15:44:02,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 64.8) internal successors, (972), 15 states have internal predecessors, (972), 0 states have call successors, (0), 0 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-17 15:44:02,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 150.0) internal successors, (2400), 16 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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-17 15:44:02,621 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 150.0) internal successors, (2400), 16 states have internal predecessors, (2400), 0 states have call successors, (0), 0 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-17 15:44:02,621 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 131 flow. Second operand 15 states and 972 transitions. [2023-11-17 15:44:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 598 flow [2023-11-17 15:44:02,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 583 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 15:44:02,624 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 294 flow [2023-11-17 15:44:02,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=294, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-11-17 15:44:02,624 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2023-11-17 15:44:02,625 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 294 flow [2023-11-17 15:44:02,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 60.9375) internal successors, (975), 16 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-17 15:44:02,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:44:02,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:44:02,644 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-17 15:44:02,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:44:02,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:44:02,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:44:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2084536351, now seen corresponding path program 2 times [2023-11-17 15:44:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:44:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766372750] [2023-11-17 15:44:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:44:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:44:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:44:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:44:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:44:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766372750] [2023-11-17 15:44:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766372750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:44:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650130612] [2023-11-17 15:44:03,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 15:44:03,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:44:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:44:03,061 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-17 15:44:03,063 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-17 15:44:05,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:44:05,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:44:05,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 15:44:05,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:44:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:44:17,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:44:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:44:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650130612] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:44:19,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:44:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-17 15:44:19,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293095981] [2023-11-17 15:44:19,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:44:19,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 15:44:19,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:44:19,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 15:44:19,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=108, Unknown=1, NotChecked=0, Total=156 [2023-11-17 15:44:19,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:44:19,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 294 flow. Second operand has 13 states, 13 states have (on average 61.30769230769231) internal successors, (797), 13 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-17 15:44:19,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:44:19,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:44:19,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:44:25,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:44:31,291 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-17 15:44:33,855 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-17 15:44:38,192 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-17 15:44:41,887 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-17 15:44:44,044 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-17 15:44:47,230 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-17 15:44:53,317 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-17 15:44:55,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:44:57,610 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-17 15:45:00,305 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-17 15:45:02,653 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-17 15:45:05,062 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-17 15:45:05,649 INFO L124 PetriNetUnfolderBase]: 172/317 cut-off events. [2023-11-17 15:45:05,649 INFO L125 PetriNetUnfolderBase]: For 1433/1433 co-relation queries the response was YES. [2023-11-17 15:45:05,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 317 events. 172/317 cut-off events. For 1433/1433 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1170 event pairs, 14 based on Foata normal form. 7/324 useless extension candidates. Maximal degree in co-relation 1623. Up to 144 conditions per place. [2023-11-17 15:45:05,651 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 62 selfloop transitions, 30 changer transitions 8/102 dead transitions. [2023-11-17 15:45:05,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 968 flow [2023-11-17 15:45:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 15:45:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 15:45:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 852 transitions. [2023-11-17 15:45:05,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369230769230769 [2023-11-17 15:45:05,653 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 852 transitions. [2023-11-17 15:45:05,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 852 transitions. [2023-11-17 15:45:05,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:45:05,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 852 transitions. [2023-11-17 15:45:05,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.53846153846153) internal successors, (852), 13 states have internal predecessors, (852), 0 states have call successors, (0), 0 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-17 15:45:05,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 150.0) internal successors, (2100), 14 states have internal predecessors, (2100), 0 states have call successors, (0), 0 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-17 15:45:05,657 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 150.0) internal successors, (2100), 14 states have internal predecessors, (2100), 0 states have call successors, (0), 0 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-17 15:45:05,657 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 294 flow. Second operand 13 states and 852 transitions. [2023-11-17 15:45:05,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 968 flow [2023-11-17 15:45:05,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 842 flow, removed 55 selfloop flow, removed 7 redundant places. [2023-11-17 15:45:05,662 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 564 flow [2023-11-17 15:45:05,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=564, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-17 15:45:05,663 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 41 predicate places. [2023-11-17 15:45:05,663 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 564 flow [2023-11-17 15:45:05,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.30769230769231) internal successors, (797), 13 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-17 15:45:05,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:45:05,664 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:45:05,669 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-17 15:45:05,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:45:05,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:45:05,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:45:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1481106681, now seen corresponding path program 3 times [2023-11-17 15:45:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:45:05,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609621187] [2023-11-17 15:45:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:45:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:45:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:45:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:05,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:45:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609621187] [2023-11-17 15:45:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609621187] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:45:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367271123] [2023-11-17 15:45:05,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 15:45:05,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:45:05,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:45:05,960 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-17 15:45:05,962 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-17 15:45:08,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 15:45:08,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:45:08,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 15:45:08,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:45:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:12,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:45:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:15,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367271123] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:45:15,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:45:15,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 15:45:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756120781] [2023-11-17 15:45:15,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:45:15,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:45:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:45:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:45:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=99, Unknown=3, NotChecked=0, Total=132 [2023-11-17 15:45:15,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:45:15,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 564 flow. Second operand has 12 states, 12 states have (on average 61.5) internal successors, (738), 12 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-17 15:45:15,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:45:15,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:45:15,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:45:24,949 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-17 15:45:26,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:28,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:30,969 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-17 15:45:32,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:34,979 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-17 15:45:36,984 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-17 15:45:39,014 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-17 15:45:41,091 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-17 15:45:47,276 INFO L124 PetriNetUnfolderBase]: 220/440 cut-off events. [2023-11-17 15:45:47,276 INFO L125 PetriNetUnfolderBase]: For 2537/2537 co-relation queries the response was YES. [2023-11-17 15:45:47,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 440 events. 220/440 cut-off events. For 2537/2537 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1990 event pairs, 18 based on Foata normal form. 19/459 useless extension candidates. Maximal degree in co-relation 2143. Up to 163 conditions per place. [2023-11-17 15:45:47,279 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 77 selfloop transitions, 23 changer transitions 27/129 dead transitions. [2023-11-17 15:45:47,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 129 transitions, 1266 flow [2023-11-17 15:45:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 15:45:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 15:45:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 914 transitions. [2023-11-17 15:45:47,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43523809523809526 [2023-11-17 15:45:47,282 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 914 transitions. [2023-11-17 15:45:47,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 914 transitions. [2023-11-17 15:45:47,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:45:47,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 914 transitions. [2023-11-17 15:45:47,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 65.28571428571429) internal successors, (914), 14 states have internal predecessors, (914), 0 states have call successors, (0), 0 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-17 15:45:47,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 150.0) internal successors, (2250), 15 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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-17 15:45:47,286 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 150.0) internal successors, (2250), 15 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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-17 15:45:47,286 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 564 flow. Second operand 14 states and 914 transitions. [2023-11-17 15:45:47,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 129 transitions, 1266 flow [2023-11-17 15:45:47,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 1077 flow, removed 89 selfloop flow, removed 3 redundant places. [2023-11-17 15:45:47,295 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 561 flow [2023-11-17 15:45:47,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=561, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2023-11-17 15:45:47,297 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 59 predicate places. [2023-11-17 15:45:47,297 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 561 flow [2023-11-17 15:45:47,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 61.5) internal successors, (738), 12 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-17 15:45:47,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:45:47,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:45:47,305 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-17 15:45:47,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:45:47,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:45:47,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:45:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1442634597, now seen corresponding path program 4 times [2023-11-17 15:45:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:45:47,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123153211] [2023-11-17 15:45:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:45:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:45:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:45:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:45:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123153211] [2023-11-17 15:45:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123153211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:45:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422957951] [2023-11-17 15:45:47,580 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 15:45:47,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:45:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:45:47,581 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-17 15:45:47,583 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-17 15:45:47,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 15:45:47,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:45:47,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 15:45:47,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:45:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:59,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:46:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:46:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422957951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:46:18,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:46:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-11-17 15:46:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413269780] [2023-11-17 15:46:18,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:46:18,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 15:46:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:46:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 15:46:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=167, Unknown=7, NotChecked=0, Total=240 [2023-11-17 15:46:18,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:46:18,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 561 flow. Second operand has 16 states, 16 states have (on average 61.375) internal successors, (982), 16 states have internal predecessors, (982), 0 states have call successors, (0), 0 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-17 15:46:18,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:46:18,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:46:18,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:46:20,788 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-17 15:46:25,859 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-17 15:46:27,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:46:43,747 WARN L293 SmtUtils]: Spent 16.18s on a formula simplification. DAG size of input: 46 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 15:46:52,880 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-17 15:46:54,896 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-17 15:47:13,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:15,212 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-17 15:47:23,921 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-17 15:47:26,114 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-17 15:47:28,665 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-17 15:47:30,670 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-17 15:47:32,688 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-17 15:47:33,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:36,318 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-17 15:47:39,140 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-17 15:47:41,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:43,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:45,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:47,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:49,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:51,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:47:53,785 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-17 15:48:00,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 15:48:02,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 15:48:04,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:48:05,730 INFO L124 PetriNetUnfolderBase]: 374/755 cut-off events. [2023-11-17 15:48:05,730 INFO L125 PetriNetUnfolderBase]: For 6381/6381 co-relation queries the response was YES. [2023-11-17 15:48:05,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 755 events. 374/755 cut-off events. For 6381/6381 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4014 event pairs, 16 based on Foata normal form. 10/765 useless extension candidates. Maximal degree in co-relation 3999. Up to 240 conditions per place. [2023-11-17 15:48:05,735 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 129 selfloop transitions, 73 changer transitions 15/219 dead transitions. [2023-11-17 15:48:05,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 219 transitions, 2209 flow [2023-11-17 15:48:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 15:48:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 15:48:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1640 transitions. [2023-11-17 15:48:05,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43733333333333335 [2023-11-17 15:48:05,739 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1640 transitions. [2023-11-17 15:48:05,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1640 transitions. [2023-11-17 15:48:05,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:48:05,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1640 transitions. [2023-11-17 15:48:05,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 65.6) internal successors, (1640), 25 states have internal predecessors, (1640), 0 states have call successors, (0), 0 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-17 15:48:05,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 150.0) internal successors, (3900), 26 states have internal predecessors, (3900), 0 states have call successors, (0), 0 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-17 15:48:05,746 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 150.0) internal successors, (3900), 26 states have internal predecessors, (3900), 0 states have call successors, (0), 0 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-17 15:48:05,746 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 561 flow. Second operand 25 states and 1640 transitions. [2023-11-17 15:48:05,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 219 transitions, 2209 flow [2023-11-17 15:48:05,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 219 transitions, 1898 flow, removed 133 selfloop flow, removed 10 redundant places. [2023-11-17 15:48:05,758 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 1286 flow [2023-11-17 15:48:05,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1286, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2023-11-17 15:48:05,758 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 80 predicate places. [2023-11-17 15:48:05,759 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 1286 flow [2023-11-17 15:48:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 61.375) internal successors, (982), 16 states have internal predecessors, (982), 0 states have call successors, (0), 0 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-17 15:48:05,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:48:05,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:48:05,766 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-17 15:48:05,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:48:05,965 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 15:48:05,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:48:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1344991177, now seen corresponding path program 5 times [2023-11-17 15:48:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:48:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475879554] [2023-11-17 15:48:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:48:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:48:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:48:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:48:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:48:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475879554] [2023-11-17 15:48:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475879554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:48:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156101916] [2023-11-17 15:48:06,043 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 15:48:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:48:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:48:06,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:48:06,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 15:49:00,632 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:49:00,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:49:00,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 15:49:00,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:49:38,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* (- 1) c_~x2~0))) (let ((.cse2 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse1 (div .cse3 2)) (.cse0 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 (mod c_~x1~0 4294967296)) (= (mod .cse1 2) 0) (= (mod c_~x1~0 2) 0) (= .cse2 (mod (* (div .cse3 4) 4294967295) 4294967296)) (<= (+ .cse2 1) .cse0) (<= (+ (mod (* .cse1 4294967295) 4294967296) 1) .cse0)))) is different from false [2023-11-17 15:49:57,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) c_~x2~0))) (let ((.cse0 (div .cse5 2)) (.cse4 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296))) (let ((.cse2 (mod c_~x1~0 4294967296)) (.cse3 (+ .cse4 1)) (.cse1 (+ (mod (* .cse0 4294967295) 4294967296) 1)) (.cse6 (mod c_~x2~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (= (mod .cse0 2) 0) (<= .cse1 .cse2) (<= .cse3 .cse2) (= (mod c_~x1~0 2) 0) (= .cse4 (mod (* (div .cse5 4) 4294967295) 4294967296)) (<= .cse3 .cse6) (<= .cse1 .cse6))))) is different from false [2023-11-17 15:50:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-17 15:50:25,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:50:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:50:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156101916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:50:51,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:50:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-11-17 15:50:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572527891] [2023-11-17 15:50:51,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:50:51,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 15:50:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:50:51,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 15:50:51,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=145, Unknown=18, NotChecked=54, Total=272 [2023-11-17 15:50:51,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 150 [2023-11-17 15:50:51,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 1286 flow. Second operand has 17 states, 17 states have (on average 61.470588235294116) internal successors, (1045), 17 states have internal predecessors, (1045), 0 states have call successors, (0), 0 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-17 15:50:51,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:50:51,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 150 [2023-11-17 15:50:51,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:50:54,712 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-17 15:50:57,697 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-17 15:51:00,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:02,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:04,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:06,390 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-17 15:51:08,401 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-17 15:51:10,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:13,665 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-17 15:51:15,680 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-17 15:51:17,683 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-17 15:51:19,688 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-17 15:51:21,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse0 (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296))) (.cse1 (* 4294967296 (div c_~x1~0 4294967296))) (.cse3 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (< .cse0 (+ .cse1 c_~x2~0 1)) (= (mod c_~x1~0 2) 0) (<= (+ .cse2 1) .cse3) (<= 1 .cse2) (= (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296) .cse2) (or (= .cse0 (+ .cse1 c_~x2~0)) (< (mod c_~x2~0 4294967296) .cse3)))) is different from false [2023-11-17 15:51:23,701 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-17 15:51:25,741 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-17 15:51:27,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-17 15:51:29,751 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 [] Received shutdown request... [2023-11-17 15:51:42,146 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-17 15:51:42,146 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 15:51:43,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 15:51:43,347 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 15:51:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:51:43,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 15:51:43,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:51:43,354 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2023-11-17 15:51:43,355 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 15:51:43,355 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 15:51:43,355 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1] [2023-11-17 15:51:43,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-11-17 15:51:43,359 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:51:43,360 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:51:43,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:51:43 BasicIcfg [2023-11-17 15:51:43,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:51:43,362 INFO L158 Benchmark]: Toolchain (without parser) took 582423.26ms. Allocated memory is still 303.0MB. Free memory was 260.4MB in the beginning and 218.2MB in the end (delta: 42.2MB). Peak memory consumption was 42.7MB. Max. memory is 8.0GB. [2023-11-17 15:51:43,362 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:51:43,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.58ms. Allocated memory is still 303.0MB. Free memory was 260.4MB in the beginning and 249.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-11-17 15:51:43,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.94ms. Allocated memory is still 303.0MB. Free memory was 249.3MB in the beginning and 247.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:51:43,362 INFO L158 Benchmark]: Boogie Preprocessor took 17.92ms. Allocated memory is still 303.0MB. Free memory was 247.8MB in the beginning and 246.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:51:43,362 INFO L158 Benchmark]: RCFGBuilder took 318.27ms. Allocated memory is still 303.0MB. Free memory was 246.2MB in the beginning and 233.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-11-17 15:51:43,362 INFO L158 Benchmark]: TraceAbstraction took 581867.63ms. Allocated memory is still 303.0MB. Free memory was 232.6MB in the beginning and 218.2MB in the end (delta: 14.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2023-11-17 15:51:43,363 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.10ms. Allocated memory is still 196.1MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.58ms. Allocated memory is still 303.0MB. Free memory was 260.4MB in the beginning and 249.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.94ms. Allocated memory is still 303.0MB. Free memory was 249.3MB in the beginning and 247.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.92ms. Allocated memory is still 303.0MB. Free memory was 247.8MB in the beginning and 246.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 318.27ms. Allocated memory is still 303.0MB. Free memory was 246.2MB in the beginning and 233.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 581867.63ms. Allocated memory is still 303.0MB. Free memory was 232.6MB in the beginning and 218.2MB in the end (delta: 14.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 72 PlacesBefore, 20 PlacesAfterwards, 71 TransitionsBefore, 15 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 68 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 209, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 209, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 360, independent: 151, independent conditional: 0, independent unconditional: 151, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 209, unknown conditional: 0, unknown unconditional: 209] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 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: 581.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 302.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 68 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 193.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 192.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1883 IncrementalHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 0 mSDtfsCounter, 1883 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 148 SyntacticMatches, 16 SemanticMatches, 119 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 232.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1286occurred in iteration=9, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 59.7s SatisfiabilityAnalysisTime, 216.3s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 7552 SizeOfPredicates, 13 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 11/56 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